./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix027_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26631dc8-f573-42a7-b8c7-6e07fba816af/bin/uautomizer-verify-NlZe1sFDwI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26631dc8-f573-42a7-b8c7-6e07fba816af/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_26631dc8-f573-42a7-b8c7-6e07fba816af/bin/uautomizer-verify-NlZe1sFDwI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26631dc8-f573-42a7-b8c7-6e07fba816af/bin/uautomizer-verify-NlZe1sFDwI/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix027_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26631dc8-f573-42a7-b8c7-6e07fba816af/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_26631dc8-f573-42a7-b8c7-6e07fba816af/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 d8f535cb798ce58a79ec2e9a728d4e5d884025e215c7cfd9880fc53267dd5a20 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-24 21:57:56,870 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-24 21:57:56,981 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26631dc8-f573-42a7-b8c7-6e07fba816af/bin/uautomizer-verify-NlZe1sFDwI/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-24 21:57:56,990 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-24 21:57:56,992 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-24 21:57:57,027 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-24 21:57:57,030 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-24 21:57:57,031 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-24 21:57:57,032 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-24 21:57:57,037 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-24 21:57:57,037 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-24 21:57:57,038 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-24 21:57:57,039 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-24 21:57:57,041 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-24 21:57:57,041 INFO L153 SettingsManager]: * Use SBE=true [2023-11-24 21:57:57,042 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-24 21:57:57,042 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-24 21:57:57,043 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-24 21:57:57,043 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-24 21:57:57,044 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-24 21:57:57,044 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-24 21:57:57,045 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-24 21:57:57,045 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-24 21:57:57,046 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-24 21:57:57,046 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-24 21:57:57,047 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-24 21:57:57,047 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-24 21:57:57,048 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-24 21:57:57,049 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-24 21:57:57,049 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-24 21:57:57,050 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-24 21:57:57,051 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-24 21:57:57,051 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 21:57:57,051 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-24 21:57:57,052 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-24 21:57:57,052 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-24 21:57:57,052 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-24 21:57:57,053 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-24 21:57:57,053 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-24 21:57:57,053 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-24 21:57:57,054 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-24 21:57:57,054 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_26631dc8-f573-42a7-b8c7-6e07fba816af/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_26631dc8-f573-42a7-b8c7-6e07fba816af/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 -> d8f535cb798ce58a79ec2e9a728d4e5d884025e215c7cfd9880fc53267dd5a20 [2023-11-24 21:57:57,330 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-24 21:57:57,352 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-24 21:57:57,355 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-24 21:57:57,357 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-24 21:57:57,357 INFO L274 PluginConnector]: CDTParser initialized [2023-11-24 21:57:57,359 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26631dc8-f573-42a7-b8c7-6e07fba816af/bin/uautomizer-verify-NlZe1sFDwI/../../sv-benchmarks/c/pthread-wmm/mix027_power.oepc_pso.oepc_rmo.oepc.i [2023-11-24 21:58:00,509 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-24 21:58:00,859 INFO L384 CDTParser]: Found 1 translation units. [2023-11-24 21:58:00,860 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26631dc8-f573-42a7-b8c7-6e07fba816af/sv-benchmarks/c/pthread-wmm/mix027_power.oepc_pso.oepc_rmo.oepc.i [2023-11-24 21:58:00,880 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26631dc8-f573-42a7-b8c7-6e07fba816af/bin/uautomizer-verify-NlZe1sFDwI/data/a92c4cf67/ee95a8e7dbd6488786f6e8f998f525a7/FLAG5c1dc2f9c [2023-11-24 21:58:00,895 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26631dc8-f573-42a7-b8c7-6e07fba816af/bin/uautomizer-verify-NlZe1sFDwI/data/a92c4cf67/ee95a8e7dbd6488786f6e8f998f525a7 [2023-11-24 21:58:00,898 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-24 21:58:00,899 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-24 21:58:00,901 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-24 21:58:00,901 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-24 21:58:00,907 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-24 21:58:00,908 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 09:58:00" (1/1) ... [2023-11-24 21:58:00,909 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37a2cd31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:58:00, skipping insertion in model container [2023-11-24 21:58:00,909 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 09:58:00" (1/1) ... [2023-11-24 21:58:00,998 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-24 21:58:01,496 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 21:58:01,513 INFO L202 MainTranslator]: Completed pre-run [2023-11-24 21:58:01,627 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 21:58:01,687 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 21:58:01,687 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 21:58:01,696 INFO L206 MainTranslator]: Completed translation [2023-11-24 21:58:01,697 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:58:01 WrapperNode [2023-11-24 21:58:01,697 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-24 21:58:01,699 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-24 21:58:01,699 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-24 21:58:01,700 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-24 21:58:01,709 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:58:01" (1/1) ... [2023-11-24 21:58:01,752 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:58:01" (1/1) ... [2023-11-24 21:58:01,790 INFO L138 Inliner]: procedures = 177, calls = 70, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 149 [2023-11-24 21:58:01,790 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-24 21:58:01,791 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-24 21:58:01,792 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-24 21:58:01,792 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-24 21:58:01,803 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:58:01" (1/1) ... [2023-11-24 21:58:01,804 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:58:01" (1/1) ... [2023-11-24 21:58:01,807 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:58:01" (1/1) ... [2023-11-24 21:58:01,833 INFO L175 MemorySlicer]: Split 6 memory accesses to 5 slices as follows [2, 1, 1, 1, 1]. 33 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 4 writes are split as follows [0, 1, 1, 1, 1]. [2023-11-24 21:58:01,840 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:58:01" (1/1) ... [2023-11-24 21:58:01,841 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:58:01" (1/1) ... [2023-11-24 21:58:01,855 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:58:01" (1/1) ... [2023-11-24 21:58:01,870 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:58:01" (1/1) ... [2023-11-24 21:58:01,873 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:58:01" (1/1) ... [2023-11-24 21:58:01,875 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:58:01" (1/1) ... [2023-11-24 21:58:01,884 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-24 21:58:01,885 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-24 21:58:01,892 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-24 21:58:01,893 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-24 21:58:01,894 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:58:01" (1/1) ... [2023-11-24 21:58:01,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 21:58:01,914 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26631dc8-f573-42a7-b8c7-6e07fba816af/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 21:58:01,939 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26631dc8-f573-42a7-b8c7-6e07fba816af/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:58:01,973 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26631dc8-f573-42a7-b8c7-6e07fba816af/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:58:01,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-24 21:58:01,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-24 21:58:01,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-24 21:58:01,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-24 21:58:01,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-24 21:58:01,986 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-24 21:58:01,986 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-24 21:58:01,986 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-24 21:58:01,987 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-24 21:58:01,987 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-24 21:58:01,989 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-24 21:58:01,989 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-24 21:58:01,989 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-24 21:58:01,989 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-24 21:58:01,990 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-24 21:58:01,990 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-24 21:58:01,990 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-24 21:58:01,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-24 21:58:01,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-24 21:58:01,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-24 21:58:01,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-24 21:58:01,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-24 21:58:01,992 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-24 21:58:01,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-24 21:58:01,993 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-24 21:58:01,994 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:58:02,198 INFO L241 CfgBuilder]: Building ICFG [2023-11-24 21:58:02,200 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-24 21:58:02,703 INFO L282 CfgBuilder]: Performing block encoding [2023-11-24 21:58:03,003 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-24 21:58:03,003 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-24 21:58:03,003 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 09:58:03 BoogieIcfgContainer [2023-11-24 21:58:03,004 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-24 21:58:03,010 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-24 21:58:03,010 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-24 21:58:03,013 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-24 21:58:03,014 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 09:58:00" (1/3) ... [2023-11-24 21:58:03,014 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60a76bcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 09:58:03, skipping insertion in model container [2023-11-24 21:58:03,015 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:58:01" (2/3) ... [2023-11-24 21:58:03,017 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60a76bcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 09:58:03, skipping insertion in model container [2023-11-24 21:58:03,017 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 09:58:03" (3/3) ... [2023-11-24 21:58:03,018 INFO L112 eAbstractionObserver]: Analyzing ICFG mix027_power.oepc_pso.oepc_rmo.oepc.i [2023-11-24 21:58:03,041 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-24 21:58:03,041 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-11-24 21:58:03,042 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-24 21:58:03,113 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-24 21:58:03,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 66 transitions, 148 flow [2023-11-24 21:58:03,205 INFO L124 PetriNetUnfolderBase]: 2/62 cut-off events. [2023-11-24 21:58:03,205 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-24 21:58:03,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75 conditions, 62 events. 2/62 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 125 event pairs, 0 based on Foata normal form. 0/49 useless extension candidates. Maximal degree in co-relation 63. Up to 2 conditions per place. [2023-11-24 21:58:03,215 INFO L82 GeneralOperation]: Start removeDead. Operand has 77 places, 66 transitions, 148 flow [2023-11-24 21:58:03,224 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 73 places, 62 transitions, 136 flow [2023-11-24 21:58:03,245 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-24 21:58:03,251 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;@44823ec0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 21:58:03,251 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-11-24 21:58:03,255 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-24 21:58:03,255 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-24 21:58:03,255 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-24 21:58:03,256 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:58:03,256 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-24 21:58:03,257 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 21:58:03,262 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:58:03,262 INFO L85 PathProgramCache]: Analyzing trace with hash 14227, now seen corresponding path program 1 times [2023-11-24 21:58:03,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:58:03,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777016282] [2023-11-24 21:58:03,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:58:03,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:58:03,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:58:03,613 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:58:03,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:58:03,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777016282] [2023-11-24 21:58:03,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777016282] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:58:03,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:58:03,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:58:03,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486927236] [2023-11-24 21:58:03,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:58:03,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:58:03,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:58:03,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:58:03,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:58:03,705 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 66 [2023-11-24 21:58:03,708 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 62 transitions, 136 flow. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states 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:58:03,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:58:03,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 66 [2023-11-24 21:58:03,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:58:05,631 INFO L124 PetriNetUnfolderBase]: 4217/7238 cut-off events. [2023-11-24 21:58:05,632 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2023-11-24 21:58:05,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13165 conditions, 7238 events. 4217/7238 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 408. Compared 53851 event pairs, 3179 based on Foata normal form. 360/6962 useless extension candidates. Maximal degree in co-relation 13150. Up to 4391 conditions per place. [2023-11-24 21:58:05,731 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 36 selfloop transitions, 2 changer transitions 0/69 dead transitions. [2023-11-24 21:58:05,732 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 69 transitions, 226 flow [2023-11-24 21:58:05,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:58:05,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:58:05,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2023-11-24 21:58:05,747 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7373737373737373 [2023-11-24 21:58:05,749 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 146 transitions. [2023-11-24 21:58:05,749 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 146 transitions. [2023-11-24 21:58:05,751 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:58:05,754 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 146 transitions. [2023-11-24 21:58:05,761 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states 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:58:05,767 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states 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:58:05,767 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states 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:58:05,769 INFO L175 Difference]: Start difference. First operand has 73 places, 62 transitions, 136 flow. Second operand 3 states and 146 transitions. [2023-11-24 21:58:05,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 69 transitions, 226 flow [2023-11-24 21:58:05,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 69 transitions, 222 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-24 21:58:05,787 INFO L231 Difference]: Finished difference. Result has 69 places, 58 transitions, 128 flow [2023-11-24 21:58:05,789 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=69, PETRI_TRANSITIONS=58} [2023-11-24 21:58:05,794 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -4 predicate places. [2023-11-24 21:58:05,794 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 58 transitions, 128 flow [2023-11-24 21:58:05,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states 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:58:05,795 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:58:05,795 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-24 21:58:05,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-24 21:58:05,796 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 21:58:05,796 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:58:05,797 INFO L85 PathProgramCache]: Analyzing trace with hash 14228, now seen corresponding path program 1 times [2023-11-24 21:58:05,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:58:05,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542815993] [2023-11-24 21:58:05,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:58:05,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:58:05,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:58:05,988 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:58:05,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:58:05,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542815993] [2023-11-24 21:58:05,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542815993] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:58:05,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:58:05,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:58:05,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214551561] [2023-11-24 21:58:05,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:58:05,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:58:05,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:58:05,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:58:05,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:58:06,019 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 66 [2023-11-24 21:58:06,019 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 58 transitions, 128 flow. Second operand has 3 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:58:06,019 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:58:06,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 66 [2023-11-24 21:58:06,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:58:07,469 INFO L124 PetriNetUnfolderBase]: 4217/7237 cut-off events. [2023-11-24 21:58:07,469 INFO L125 PetriNetUnfolderBase]: For 180/180 co-relation queries the response was YES. [2023-11-24 21:58:07,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13341 conditions, 7237 events. 4217/7237 cut-off events. For 180/180 co-relation queries the response was YES. Maximal size of possible extension queue 408. Compared 53803 event pairs, 3179 based on Foata normal form. 1/6602 useless extension candidates. Maximal degree in co-relation 13330. Up to 4390 conditions per place. [2023-11-24 21:58:07,545 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 35 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2023-11-24 21:58:07,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 68 transitions, 222 flow [2023-11-24 21:58:07,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:58:07,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:58:07,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2023-11-24 21:58:07,553 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7373737373737373 [2023-11-24 21:58:07,553 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 146 transitions. [2023-11-24 21:58:07,554 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 146 transitions. [2023-11-24 21:58:07,555 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:58:07,558 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 146 transitions. [2023-11-24 21:58:07,560 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states 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:58:07,562 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states 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:58:07,562 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states 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:58:07,563 INFO L175 Difference]: Start difference. First operand has 69 places, 58 transitions, 128 flow. Second operand 3 states and 146 transitions. [2023-11-24 21:58:07,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 68 transitions, 222 flow [2023-11-24 21:58:07,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 68 transitions, 218 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:58:07,579 INFO L231 Difference]: Finished difference. Result has 68 places, 57 transitions, 126 flow [2023-11-24 21:58:07,579 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=68, PETRI_TRANSITIONS=57} [2023-11-24 21:58:07,585 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -5 predicate places. [2023-11-24 21:58:07,585 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 57 transitions, 126 flow [2023-11-24 21:58:07,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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:58:07,585 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:58:07,586 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-24 21:58:07,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-24 21:58:07,586 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 21:58:07,586 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:58:07,587 INFO L85 PathProgramCache]: Analyzing trace with hash 424276393, now seen corresponding path program 1 times [2023-11-24 21:58:07,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:58:07,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257820874] [2023-11-24 21:58:07,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:58:07,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:58:07,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:58:07,831 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:58:07,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:58:07,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257820874] [2023-11-24 21:58:07,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257820874] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:58:07,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:58:07,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:58:07,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452698803] [2023-11-24 21:58:07,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:58:07,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:58:07,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:58:07,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:58:07,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:58:07,838 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 66 [2023-11-24 21:58:07,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 57 transitions, 126 flow. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states 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:58:07,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:58:07,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 66 [2023-11-24 21:58:07,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:58:08,917 INFO L124 PetriNetUnfolderBase]: 3311/5478 cut-off events. [2023-11-24 21:58:08,917 INFO L125 PetriNetUnfolderBase]: For 144/144 co-relation queries the response was YES. [2023-11-24 21:58:08,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10300 conditions, 5478 events. 3311/5478 cut-off events. For 144/144 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 39268 event pairs, 593 based on Foata normal form. 0/5401 useless extension candidates. Maximal degree in co-relation 10289. Up to 3661 conditions per place. [2023-11-24 21:58:08,967 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 41 selfloop transitions, 2 changer transitions 2/76 dead transitions. [2023-11-24 21:58:08,967 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 76 transitions, 262 flow [2023-11-24 21:58:08,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:58:08,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:58:08,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 157 transitions. [2023-11-24 21:58:08,970 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7929292929292929 [2023-11-24 21:58:08,971 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 157 transitions. [2023-11-24 21:58:08,971 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 157 transitions. [2023-11-24 21:58:08,971 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:58:08,971 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 157 transitions. [2023-11-24 21:58:08,972 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 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:58:08,975 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states 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:58:08,975 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states 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:58:08,976 INFO L175 Difference]: Start difference. First operand has 68 places, 57 transitions, 126 flow. Second operand 3 states and 157 transitions. [2023-11-24 21:58:08,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 76 transitions, 262 flow [2023-11-24 21:58:08,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 76 transitions, 256 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:58:08,982 INFO L231 Difference]: Finished difference. Result has 67 places, 55 transitions, 122 flow [2023-11-24 21:58:08,982 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=67, PETRI_TRANSITIONS=55} [2023-11-24 21:58:08,984 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -6 predicate places. [2023-11-24 21:58:08,984 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 55 transitions, 122 flow [2023-11-24 21:58:08,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states 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:58:08,985 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:58:08,985 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-24 21:58:08,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-24 21:58:08,985 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 21:58:08,986 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:58:08,987 INFO L85 PathProgramCache]: Analyzing trace with hash 424275281, now seen corresponding path program 1 times [2023-11-24 21:58:08,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:58:08,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004061017] [2023-11-24 21:58:08,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:58:08,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:58:09,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:58:09,064 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:58:09,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:58:09,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004061017] [2023-11-24 21:58:09,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004061017] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:58:09,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:58:09,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:58:09,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462717934] [2023-11-24 21:58:09,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:58:09,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:58:09,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:58:09,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:58:09,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:58:09,102 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 66 [2023-11-24 21:58:09,103 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 55 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states 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:58:09,103 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:58:09,103 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 66 [2023-11-24 21:58:09,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:58:10,007 INFO L124 PetriNetUnfolderBase]: 2906/5175 cut-off events. [2023-11-24 21:58:10,008 INFO L125 PetriNetUnfolderBase]: For 279/279 co-relation queries the response was YES. [2023-11-24 21:58:10,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9587 conditions, 5175 events. 2906/5175 cut-off events. For 279/279 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 37785 event pairs, 1880 based on Foata normal form. 0/4927 useless extension candidates. Maximal degree in co-relation 9576. Up to 3466 conditions per place. [2023-11-24 21:58:10,061 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 33 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2023-11-24 21:58:10,061 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 64 transitions, 212 flow [2023-11-24 21:58:10,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:58:10,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:58:10,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 141 transitions. [2023-11-24 21:58:10,063 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7121212121212122 [2023-11-24 21:58:10,063 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 141 transitions. [2023-11-24 21:58:10,063 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 141 transitions. [2023-11-24 21:58:10,064 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:58:10,064 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 141 transitions. [2023-11-24 21:58:10,065 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states 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:58:10,066 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states 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:58:10,067 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states 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:58:10,067 INFO L175 Difference]: Start difference. First operand has 67 places, 55 transitions, 122 flow. Second operand 3 states and 141 transitions. [2023-11-24 21:58:10,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 64 transitions, 212 flow [2023-11-24 21:58:10,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 64 transitions, 206 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:58:10,072 INFO L231 Difference]: Finished difference. Result has 65 places, 54 transitions, 120 flow [2023-11-24 21:58:10,072 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=65, PETRI_TRANSITIONS=54} [2023-11-24 21:58:10,074 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -8 predicate places. [2023-11-24 21:58:10,074 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 54 transitions, 120 flow [2023-11-24 21:58:10,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states 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:58:10,075 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:58:10,075 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-24 21:58:10,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-24 21:58:10,076 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 21:58:10,077 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:58:10,077 INFO L85 PathProgramCache]: Analyzing trace with hash 424275282, now seen corresponding path program 1 times [2023-11-24 21:58:10,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:58:10,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541679200] [2023-11-24 21:58:10,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:58:10,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:58:10,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:58:10,163 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:58:10,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:58:10,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541679200] [2023-11-24 21:58:10,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541679200] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:58:10,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:58:10,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:58:10,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571901438] [2023-11-24 21:58:10,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:58:10,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:58:10,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:58:10,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:58:10,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:58:10,188 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 66 [2023-11-24 21:58:10,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 54 transitions, 120 flow. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states 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:58:10,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:58:10,189 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 66 [2023-11-24 21:58:10,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:58:10,978 INFO L124 PetriNetUnfolderBase]: 2903/5168 cut-off events. [2023-11-24 21:58:10,979 INFO L125 PetriNetUnfolderBase]: For 147/147 co-relation queries the response was YES. [2023-11-24 21:58:10,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9441 conditions, 5168 events. 2903/5168 cut-off events. For 147/147 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 37758 event pairs, 1880 based on Foata normal form. 4/4924 useless extension candidates. Maximal degree in co-relation 9431. Up to 3459 conditions per place. [2023-11-24 21:58:11,022 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 32 selfloop transitions, 2 changer transitions 0/63 dead transitions. [2023-11-24 21:58:11,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 63 transitions, 206 flow [2023-11-24 21:58:11,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:58:11,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:58:11,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2023-11-24 21:58:11,023 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7222222222222222 [2023-11-24 21:58:11,023 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 143 transitions. [2023-11-24 21:58:11,024 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 143 transitions. [2023-11-24 21:58:11,024 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:58:11,024 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 143 transitions. [2023-11-24 21:58:11,025 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states 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:58:11,025 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states 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:58:11,026 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states 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:58:11,026 INFO L175 Difference]: Start difference. First operand has 65 places, 54 transitions, 120 flow. Second operand 3 states and 143 transitions. [2023-11-24 21:58:11,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 63 transitions, 206 flow [2023-11-24 21:58:11,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 63 transitions, 202 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:58:11,030 INFO L231 Difference]: Finished difference. Result has 64 places, 53 transitions, 118 flow [2023-11-24 21:58:11,030 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=64, PETRI_TRANSITIONS=53} [2023-11-24 21:58:11,031 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -9 predicate places. [2023-11-24 21:58:11,031 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 53 transitions, 118 flow [2023-11-24 21:58:11,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states 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:58:11,032 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:58:11,032 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:58:11,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-24 21:58:11,032 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 21:58:11,033 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:58:11,033 INFO L85 PathProgramCache]: Analyzing trace with hash -503420956, now seen corresponding path program 1 times [2023-11-24 21:58:11,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:58:11,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242433431] [2023-11-24 21:58:11,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:58:11,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:58:11,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:58:11,084 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:58:11,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:58:11,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242433431] [2023-11-24 21:58:11,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242433431] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:58:11,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:58:11,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:58:11,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186444228] [2023-11-24 21:58:11,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:58:11,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:58:11,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:58:11,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:58:11,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:58:11,104 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 66 [2023-11-24 21:58:11,104 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 53 transitions, 118 flow. Second operand has 3 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:58:11,104 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:58:11,104 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 66 [2023-11-24 21:58:11,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:58:11,874 INFO L124 PetriNetUnfolderBase]: 2920/5121 cut-off events. [2023-11-24 21:58:11,874 INFO L125 PetriNetUnfolderBase]: For 147/147 co-relation queries the response was YES. [2023-11-24 21:58:11,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9423 conditions, 5121 events. 2920/5121 cut-off events. For 147/147 co-relation queries the response was YES. Maximal size of possible extension queue 297. Compared 36957 event pairs, 1892 based on Foata normal form. 0/4895 useless extension candidates. Maximal degree in co-relation 9413. Up to 3460 conditions per place. [2023-11-24 21:58:11,916 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 33 selfloop transitions, 2 changer transitions 0/62 dead transitions. [2023-11-24 21:58:11,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 62 transitions, 206 flow [2023-11-24 21:58:11,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:58:11,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:58:11,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 141 transitions. [2023-11-24 21:58:11,918 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7121212121212122 [2023-11-24 21:58:11,918 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 141 transitions. [2023-11-24 21:58:11,918 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 141 transitions. [2023-11-24 21:58:11,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:58:11,919 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 141 transitions. [2023-11-24 21:58:11,919 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states 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:58:11,920 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states 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:58:11,920 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states 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:58:11,921 INFO L175 Difference]: Start difference. First operand has 64 places, 53 transitions, 118 flow. Second operand 3 states and 141 transitions. [2023-11-24 21:58:11,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 62 transitions, 206 flow [2023-11-24 21:58:11,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 62 transitions, 202 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:58:11,924 INFO L231 Difference]: Finished difference. Result has 63 places, 52 transitions, 116 flow [2023-11-24 21:58:11,925 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=63, PETRI_TRANSITIONS=52} [2023-11-24 21:58:11,925 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -10 predicate places. [2023-11-24 21:58:11,926 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 52 transitions, 116 flow [2023-11-24 21:58:11,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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:58:11,926 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:58:11,926 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:58:11,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-24 21:58:11,927 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 21:58:11,927 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:58:11,927 INFO L85 PathProgramCache]: Analyzing trace with hash -503420955, now seen corresponding path program 1 times [2023-11-24 21:58:11,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:58:11,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313964631] [2023-11-24 21:58:11,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:58:11,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:58:11,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:58:12,002 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:58:12,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:58:12,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313964631] [2023-11-24 21:58:12,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313964631] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:58:12,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:58:12,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:58:12,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235552970] [2023-11-24 21:58:12,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:58:12,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:58:12,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:58:12,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:58:12,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:58:12,022 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 66 [2023-11-24 21:58:12,022 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 52 transitions, 116 flow. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states 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:58:12,022 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:58:12,023 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 66 [2023-11-24 21:58:12,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:58:12,960 INFO L124 PetriNetUnfolderBase]: 2903/5092 cut-off events. [2023-11-24 21:58:12,961 INFO L125 PetriNetUnfolderBase]: For 152/152 co-relation queries the response was YES. [2023-11-24 21:58:12,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9373 conditions, 5092 events. 2903/5092 cut-off events. For 152/152 co-relation queries the response was YES. Maximal size of possible extension queue 297. Compared 36910 event pairs, 1884 based on Foata normal form. 12/4886 useless extension candidates. Maximal degree in co-relation 9363. Up to 3431 conditions per place. [2023-11-24 21:58:13,009 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 32 selfloop transitions, 2 changer transitions 0/61 dead transitions. [2023-11-24 21:58:13,009 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 61 transitions, 202 flow [2023-11-24 21:58:13,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:58:13,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:58:13,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2023-11-24 21:58:13,013 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7222222222222222 [2023-11-24 21:58:13,013 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 143 transitions. [2023-11-24 21:58:13,014 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 143 transitions. [2023-11-24 21:58:13,014 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:58:13,014 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 143 transitions. [2023-11-24 21:58:13,015 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states 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:58:13,016 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states 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:58:13,017 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states 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:58:13,017 INFO L175 Difference]: Start difference. First operand has 63 places, 52 transitions, 116 flow. Second operand 3 states and 143 transitions. [2023-11-24 21:58:13,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 61 transitions, 202 flow [2023-11-24 21:58:13,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 61 transitions, 198 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:58:13,022 INFO L231 Difference]: Finished difference. Result has 62 places, 51 transitions, 114 flow [2023-11-24 21:58:13,022 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=62, PETRI_TRANSITIONS=51} [2023-11-24 21:58:13,024 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -11 predicate places. [2023-11-24 21:58:13,024 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 51 transitions, 114 flow [2023-11-24 21:58:13,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states 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:58:13,025 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:58:13,025 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:58:13,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-24 21:58:13,025 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 21:58:13,026 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:58:13,026 INFO L85 PathProgramCache]: Analyzing trace with hash 612531236, now seen corresponding path program 1 times [2023-11-24 21:58:13,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:58:13,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020483545] [2023-11-24 21:58:13,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:58:13,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:58:13,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:58:13,103 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:58:13,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:58:13,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020483545] [2023-11-24 21:58:13,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020483545] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:58:13,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:58:13,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:58:13,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934379188] [2023-11-24 21:58:13,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:58:13,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:58:13,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:58:13,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:58:13,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:58:13,125 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 66 [2023-11-24 21:58:13,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 114 flow. Second operand has 3 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:58:13,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:58:13,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 66 [2023-11-24 21:58:13,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:58:13,925 INFO L124 PetriNetUnfolderBase]: 2978/5123 cut-off events. [2023-11-24 21:58:13,925 INFO L125 PetriNetUnfolderBase]: For 152/152 co-relation queries the response was YES. [2023-11-24 21:58:13,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9515 conditions, 5123 events. 2978/5123 cut-off events. For 152/152 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 36550 event pairs, 1424 based on Foata normal form. 0/4969 useless extension candidates. Maximal degree in co-relation 9505. Up to 3426 conditions per place. [2023-11-24 21:58:13,973 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 33 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2023-11-24 21:58:13,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 60 transitions, 202 flow [2023-11-24 21:58:13,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:58:13,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:58:13,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 141 transitions. [2023-11-24 21:58:13,975 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7121212121212122 [2023-11-24 21:58:13,976 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 141 transitions. [2023-11-24 21:58:13,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 141 transitions. [2023-11-24 21:58:13,980 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:58:13,981 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 141 transitions. [2023-11-24 21:58:13,981 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states 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:58:13,982 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states 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:58:13,983 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states 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:58:13,983 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 114 flow. Second operand 3 states and 141 transitions. [2023-11-24 21:58:13,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 60 transitions, 202 flow [2023-11-24 21:58:13,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 60 transitions, 198 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:58:13,990 INFO L231 Difference]: Finished difference. Result has 61 places, 50 transitions, 112 flow [2023-11-24 21:58:13,990 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=61, PETRI_TRANSITIONS=50} [2023-11-24 21:58:13,993 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -12 predicate places. [2023-11-24 21:58:13,994 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 50 transitions, 112 flow [2023-11-24 21:58:13,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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:58:13,994 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:58:13,995 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:58:13,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-24 21:58:13,995 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 21:58:13,996 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:58:13,996 INFO L85 PathProgramCache]: Analyzing trace with hash 612531237, now seen corresponding path program 1 times [2023-11-24 21:58:13,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:58:13,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605387261] [2023-11-24 21:58:13,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:58:13,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:58:14,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:58:14,122 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:58:14,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:58:14,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605387261] [2023-11-24 21:58:14,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605387261] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:58:14,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:58:14,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:58:14,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544239482] [2023-11-24 21:58:14,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:58:14,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:58:14,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:58:14,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:58:14,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:58:14,145 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 66 [2023-11-24 21:58:14,146 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states 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:58:14,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:58:14,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 66 [2023-11-24 21:58:14,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:58:14,954 INFO L124 PetriNetUnfolderBase]: 2903/5072 cut-off events. [2023-11-24 21:58:14,955 INFO L125 PetriNetUnfolderBase]: For 168/168 co-relation queries the response was YES. [2023-11-24 21:58:14,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9377 conditions, 5072 events. 2903/5072 cut-off events. For 168/168 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 36419 event pairs, 920 based on Foata normal form. 36/4990 useless extension candidates. Maximal degree in co-relation 9367. Up to 3315 conditions per place. [2023-11-24 21:58:14,992 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 32 selfloop transitions, 2 changer transitions 0/59 dead transitions. [2023-11-24 21:58:14,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 59 transitions, 198 flow [2023-11-24 21:58:14,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:58:14,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:58:14,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2023-11-24 21:58:14,994 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7222222222222222 [2023-11-24 21:58:14,994 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 143 transitions. [2023-11-24 21:58:14,994 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 143 transitions. [2023-11-24 21:58:14,994 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:58:14,994 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 143 transitions. [2023-11-24 21:58:14,995 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states 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:58:14,996 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states 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:58:14,996 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states 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:58:14,996 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 112 flow. Second operand 3 states and 143 transitions. [2023-11-24 21:58:14,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 59 transitions, 198 flow [2023-11-24 21:58:14,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 59 transitions, 194 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:58:14,999 INFO L231 Difference]: Finished difference. Result has 60 places, 49 transitions, 110 flow [2023-11-24 21:58:14,999 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=60, PETRI_TRANSITIONS=49} [2023-11-24 21:58:15,000 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -13 predicate places. [2023-11-24 21:58:15,000 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 49 transitions, 110 flow [2023-11-24 21:58:15,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states 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:58:15,001 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:58:15,001 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:58:15,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-24 21:58:15,001 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 21:58:15,002 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:58:15,002 INFO L85 PathProgramCache]: Analyzing trace with hash -136945484, now seen corresponding path program 1 times [2023-11-24 21:58:15,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:58:15,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769340302] [2023-11-24 21:58:15,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:58:15,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:58:15,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:58:15,962 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:58:15,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:58:15,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769340302] [2023-11-24 21:58:15,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769340302] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:58:15,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:58:15,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-24 21:58:15,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026814668] [2023-11-24 21:58:15,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:58:15,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-24 21:58:15,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:58:15,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-24 21:58:15,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-24 21:58:16,173 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 66 [2023-11-24 21:58:16,174 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 49 transitions, 110 flow. Second operand has 8 states, 8 states have (on average 33.875) internal successors, (271), 8 states have internal predecessors, (271), 0 states have call successors, (0), 0 states 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:58:16,174 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:58:16,174 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 66 [2023-11-24 21:58:16,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:58:17,069 INFO L124 PetriNetUnfolderBase]: 2920/4937 cut-off events. [2023-11-24 21:58:17,069 INFO L125 PetriNetUnfolderBase]: For 168/168 co-relation queries the response was YES. [2023-11-24 21:58:17,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9271 conditions, 4937 events. 2920/4937 cut-off events. For 168/168 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 34040 event pairs, 1148 based on Foata normal form. 144/4965 useless extension candidates. Maximal degree in co-relation 9261. Up to 3315 conditions per place. [2023-11-24 21:58:17,108 INFO L140 encePairwiseOnDemand]: 60/66 looper letters, 35 selfloop transitions, 4 changer transitions 11/73 dead transitions. [2023-11-24 21:58:17,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 73 transitions, 258 flow [2023-11-24 21:58:17,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 21:58:17,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-24 21:58:17,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 275 transitions. [2023-11-24 21:58:17,114 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5952380952380952 [2023-11-24 21:58:17,114 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 275 transitions. [2023-11-24 21:58:17,115 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 275 transitions. [2023-11-24 21:58:17,115 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:58:17,115 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 275 transitions. [2023-11-24 21:58:17,116 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 39.285714285714285) internal successors, (275), 7 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:58:17,118 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 66.0) internal successors, (528), 8 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:17,118 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 66.0) internal successors, (528), 8 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:17,119 INFO L175 Difference]: Start difference. First operand has 60 places, 49 transitions, 110 flow. Second operand 7 states and 275 transitions. [2023-11-24 21:58:17,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 73 transitions, 258 flow [2023-11-24 21:58:17,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 73 transitions, 254 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:58:17,122 INFO L231 Difference]: Finished difference. Result has 63 places, 47 transitions, 110 flow [2023-11-24 21:58:17,123 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=110, PETRI_PLACES=63, PETRI_TRANSITIONS=47} [2023-11-24 21:58:17,124 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -10 predicate places. [2023-11-24 21:58:17,124 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 47 transitions, 110 flow [2023-11-24 21:58:17,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 33.875) internal successors, (271), 8 states have internal predecessors, (271), 0 states have call successors, (0), 0 states 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:58:17,125 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:58:17,125 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:58:17,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-24 21:58:17,125 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 21:58:17,126 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:58:17,126 INFO L85 PathProgramCache]: Analyzing trace with hash -136943829, now seen corresponding path program 1 times [2023-11-24 21:58:17,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:58:17,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446055695] [2023-11-24 21:58:17,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:58:17,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:58:17,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:58:17,384 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:58:17,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:58:17,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446055695] [2023-11-24 21:58:17,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446055695] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:58:17,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:58:17,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 21:58:17,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618611695] [2023-11-24 21:58:17,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:58:17,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 21:58:17,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:58:17,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 21:58:17,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-24 21:58:17,405 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 66 [2023-11-24 21:58:17,405 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 47 transitions, 110 flow. Second operand has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 states have internal predecessors, (159), 0 states have call successors, (0), 0 states 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:58:17,405 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:58:17,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 66 [2023-11-24 21:58:17,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:58:23,304 INFO L124 PetriNetUnfolderBase]: 37338/53546 cut-off events. [2023-11-24 21:58:23,304 INFO L125 PetriNetUnfolderBase]: For 194/194 co-relation queries the response was YES. [2023-11-24 21:58:23,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104223 conditions, 53546 events. 37338/53546 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 2354. Compared 386842 event pairs, 8409 based on Foata normal form. 0/52246 useless extension candidates. Maximal degree in co-relation 104212. Up to 18479 conditions per place. [2023-11-24 21:58:23,557 INFO L140 encePairwiseOnDemand]: 54/66 looper letters, 47 selfloop transitions, 8 changer transitions 103/174 dead transitions. [2023-11-24 21:58:23,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 174 transitions, 688 flow [2023-11-24 21:58:23,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-24 21:58:23,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-24 21:58:23,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 421 transitions. [2023-11-24 21:58:23,560 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7087542087542088 [2023-11-24 21:58:23,560 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 421 transitions. [2023-11-24 21:58:23,561 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 421 transitions. [2023-11-24 21:58:23,561 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:58:23,561 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 421 transitions. [2023-11-24 21:58:23,563 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 46.77777777777778) internal successors, (421), 9 states have internal predecessors, (421), 0 states have call successors, (0), 0 states 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:58:23,565 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 66.0) internal successors, (660), 10 states have internal predecessors, (660), 0 states have call successors, (0), 0 states 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:58:23,565 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 66.0) internal successors, (660), 10 states have internal predecessors, (660), 0 states have call successors, (0), 0 states 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:58:23,566 INFO L175 Difference]: Start difference. First operand has 63 places, 47 transitions, 110 flow. Second operand 9 states and 421 transitions. [2023-11-24 21:58:23,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 174 transitions, 688 flow [2023-11-24 21:58:23,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 174 transitions, 678 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-24 21:58:23,570 INFO L231 Difference]: Finished difference. Result has 73 places, 53 transitions, 213 flow [2023-11-24 21:58:23,570 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=213, PETRI_PLACES=73, PETRI_TRANSITIONS=53} [2023-11-24 21:58:23,571 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 0 predicate places. [2023-11-24 21:58:23,571 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 53 transitions, 213 flow [2023-11-24 21:58:23,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 states have internal predecessors, (159), 0 states have call successors, (0), 0 states 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:58:23,572 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:58:23,572 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:58:23,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-24 21:58:23,572 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 21:58:23,573 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:58:23,573 INFO L85 PathProgramCache]: Analyzing trace with hash -491877362, now seen corresponding path program 1 times [2023-11-24 21:58:23,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:58:23,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763262150] [2023-11-24 21:58:23,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:58:23,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:58:23,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:58:23,880 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:58:23,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:58:23,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763262150] [2023-11-24 21:58:23,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763262150] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:58:23,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:58:23,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 21:58:23,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090507354] [2023-11-24 21:58:23,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:58:23,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 21:58:23,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:58:23,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 21:58:23,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-24 21:58:23,906 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 66 [2023-11-24 21:58:23,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 53 transitions, 213 flow. Second operand has 5 states, 5 states have (on average 35.8) internal successors, (179), 5 states have internal predecessors, (179), 0 states have call successors, (0), 0 states 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:58:23,907 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:58:23,907 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 66 [2023-11-24 21:58:23,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:58:29,027 INFO L124 PetriNetUnfolderBase]: 22612/35930 cut-off events. [2023-11-24 21:58:29,027 INFO L125 PetriNetUnfolderBase]: For 39516/40516 co-relation queries the response was YES. [2023-11-24 21:58:29,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97502 conditions, 35930 events. 22612/35930 cut-off events. For 39516/40516 co-relation queries the response was YES. Maximal size of possible extension queue 1827. Compared 297691 event pairs, 6824 based on Foata normal form. 1082/36392 useless extension candidates. Maximal degree in co-relation 97483. Up to 23152 conditions per place. [2023-11-24 21:58:29,422 INFO L140 encePairwiseOnDemand]: 60/66 looper letters, 38 selfloop transitions, 5 changer transitions 51/118 dead transitions. [2023-11-24 21:58:29,423 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 118 transitions, 688 flow [2023-11-24 21:58:29,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 21:58:29,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-24 21:58:29,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 312 transitions. [2023-11-24 21:58:29,429 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6753246753246753 [2023-11-24 21:58:29,430 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 312 transitions. [2023-11-24 21:58:29,430 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 312 transitions. [2023-11-24 21:58:29,430 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:58:29,431 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 312 transitions. [2023-11-24 21:58:29,432 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 44.57142857142857) internal successors, (312), 7 states have internal predecessors, (312), 0 states have call successors, (0), 0 states 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:58:29,435 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 66.0) internal successors, (528), 8 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:29,436 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 66.0) internal successors, (528), 8 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:29,437 INFO L175 Difference]: Start difference. First operand has 73 places, 53 transitions, 213 flow. Second operand 7 states and 312 transitions. [2023-11-24 21:58:29,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 118 transitions, 688 flow [2023-11-24 21:58:29,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 118 transitions, 610 flow, removed 19 selfloop flow, removed 4 redundant places. [2023-11-24 21:58:29,897 INFO L231 Difference]: Finished difference. Result has 73 places, 57 transitions, 256 flow [2023-11-24 21:58:29,897 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=256, PETRI_PLACES=73, PETRI_TRANSITIONS=57} [2023-11-24 21:58:29,898 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 0 predicate places. [2023-11-24 21:58:29,898 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 57 transitions, 256 flow [2023-11-24 21:58:29,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.8) internal successors, (179), 5 states have internal predecessors, (179), 0 states have call successors, (0), 0 states 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:58:29,899 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:58:29,899 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:58:29,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-24 21:58:29,900 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 21:58:29,900 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:58:29,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1700530250, now seen corresponding path program 1 times [2023-11-24 21:58:29,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:58:29,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386150804] [2023-11-24 21:58:29,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:58:29,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:58:29,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:58:30,300 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:58:30,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:58:30,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386150804] [2023-11-24 21:58:30,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386150804] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:58:30,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:58:30,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 21:58:30,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329870593] [2023-11-24 21:58:30,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:58:30,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 21:58:30,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:58:30,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 21:58:30,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-24 21:58:30,311 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 66 [2023-11-24 21:58:30,311 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 57 transitions, 256 flow. Second operand has 5 states, 5 states have (on average 35.8) internal successors, (179), 5 states have internal predecessors, (179), 0 states have call successors, (0), 0 states 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:58:30,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:58:30,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 66 [2023-11-24 21:58:30,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:58:32,264 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([463] L824-->L840: Formula: (let ((.cse8 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse5 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse6 (not .cse5)) (.cse12 (= (mod v_~a$w_buff0_used~0_138 256) 0)) (.cse2 (and .cse5 .cse8)) (.cse3 (and (= (mod v_~a$w_buff1_used~0_125 256) 0) .cse5))) (let ((.cse9 (or .cse12 .cse2 .cse3)) (.cse10 (and .cse6 (not .cse12)))) (let ((.cse1 (= (mod v_~a$w_buff0_used~0_137 256) 0)) (.cse4 (= (mod v_~a$w_buff1_used~0_124 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse11 (ite .cse9 v_~a~0_74 (ite .cse10 v_~a$w_buff0~0_55 v_~a$w_buff1~0_48)))) (and (= v_~a$flush_delayed~0_23 0) (= v_~a$w_buff0~0_54 v_~a$w_buff0~0_55) (= v_~a$w_buff1~0_48 v_~a$w_buff1~0_47) (= (ite .cse0 v_~a$w_buff1_used~0_125 (ite (or .cse1 .cse2 .cse3) v_~a$w_buff1_used~0_125 0)) v_~a$w_buff1_used~0_124) (= (ite .cse0 v_~a$r_buff0_thd4~0_62 (ite (or .cse1 (and .cse4 .cse5) .cse2) v_~a$r_buff0_thd4~0_62 (ite (and .cse6 (not .cse1)) 0 v_~a$r_buff0_thd4~0_62))) v_~a$r_buff0_thd4~0_61) (= v_~a$r_buff1_thd4~0_59 (ite .cse0 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse7 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or .cse1 (and .cse7 .cse8) (and .cse7 .cse4))) v_~a$r_buff1_thd4~0_60 0))) (= v_~a$w_buff0_used~0_137 (ite .cse0 v_~a$w_buff0_used~0_138 (ite .cse9 v_~a$w_buff0_used~0_138 (ite .cse10 0 v_~a$w_buff0_used~0_138)))) (= v_~a~0_74 v_~a$mem_tmp~0_18) (= .cse11 v_~__unbuffered_p3_EBX~0_10) (= v_~a~0_72 (ite .cse0 v_~a$mem_tmp~0_18 .cse11))))))) InVars {~a~0=v_~a~0_74, ~a$w_buff1~0=v_~a$w_buff1~0_48, ~a$w_buff0~0=v_~a$w_buff0~0_55, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_138, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_125, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_137, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_61, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_72, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_13, ~a$w_buff1~0=v_~a$w_buff1~0_47, ~a$flush_delayed~0=v_~a$flush_delayed~0_23, ~a$w_buff0~0=v_~a$w_buff0~0_54, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_124, ~weak$$choice2~0=v_~weak$$choice2~0_30, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][65], [Black: 149#(= ~z~0 0), Black: 153#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~z~0 0)), 8#L804true, Black: 155#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z~0 0)), Black: 150#(not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)), 14#L871-3true, 164#true, 122#(and (not (= |ULTIMATE.start_main_~#t714~0#1.base| |ULTIMATE.start_main_~#t713~0#1.base|)) (not (= |ULTIMATE.start_main_~#t715~0#1.base| |ULTIMATE.start_main_~#t713~0#1.base|)) (not (= |ULTIMATE.start_main_~#t716~0#1.base| |ULTIMATE.start_main_~#t715~0#1.base|)) (not (= |ULTIMATE.start_main_~#t716~0#1.base| |ULTIMATE.start_main_~#t714~0#1.base|)) (not (= |ULTIMATE.start_main_~#t715~0#1.base| |ULTIMATE.start_main_~#t714~0#1.base|)) (not (= |ULTIMATE.start_main_~#t716~0#1.base| |ULTIMATE.start_main_~#t713~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t715~0#1.base| 0) |ULTIMATE.start_main_~#t714~0#1.base| 0) |ULTIMATE.start_main_~#t713~0#1.base| 0) |ULTIMATE.start_main_~#t716~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)), P1Thread1of1ForFork1InUse, 53#L771true, P2Thread1of1ForFork0InUse, P3Thread1of1ForFork2InUse, Black: 128#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 135#(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))), P0Thread1of1ForFork3InUse, Black: 131#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 133#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~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: 127#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 147#true, 31#P1EXITtrue, 46#L840true, Black: 157#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)))]) [2023-11-24 21:58:32,264 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2023-11-24 21:58:32,264 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-24 21:58:32,264 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-24 21:58:32,265 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-24 21:58:32,438 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([463] L824-->L840: Formula: (let ((.cse8 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse5 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse6 (not .cse5)) (.cse12 (= (mod v_~a$w_buff0_used~0_138 256) 0)) (.cse2 (and .cse5 .cse8)) (.cse3 (and (= (mod v_~a$w_buff1_used~0_125 256) 0) .cse5))) (let ((.cse9 (or .cse12 .cse2 .cse3)) (.cse10 (and .cse6 (not .cse12)))) (let ((.cse1 (= (mod v_~a$w_buff0_used~0_137 256) 0)) (.cse4 (= (mod v_~a$w_buff1_used~0_124 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse11 (ite .cse9 v_~a~0_74 (ite .cse10 v_~a$w_buff0~0_55 v_~a$w_buff1~0_48)))) (and (= v_~a$flush_delayed~0_23 0) (= v_~a$w_buff0~0_54 v_~a$w_buff0~0_55) (= v_~a$w_buff1~0_48 v_~a$w_buff1~0_47) (= (ite .cse0 v_~a$w_buff1_used~0_125 (ite (or .cse1 .cse2 .cse3) v_~a$w_buff1_used~0_125 0)) v_~a$w_buff1_used~0_124) (= (ite .cse0 v_~a$r_buff0_thd4~0_62 (ite (or .cse1 (and .cse4 .cse5) .cse2) v_~a$r_buff0_thd4~0_62 (ite (and .cse6 (not .cse1)) 0 v_~a$r_buff0_thd4~0_62))) v_~a$r_buff0_thd4~0_61) (= v_~a$r_buff1_thd4~0_59 (ite .cse0 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse7 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or .cse1 (and .cse7 .cse8) (and .cse7 .cse4))) v_~a$r_buff1_thd4~0_60 0))) (= v_~a$w_buff0_used~0_137 (ite .cse0 v_~a$w_buff0_used~0_138 (ite .cse9 v_~a$w_buff0_used~0_138 (ite .cse10 0 v_~a$w_buff0_used~0_138)))) (= v_~a~0_74 v_~a$mem_tmp~0_18) (= .cse11 v_~__unbuffered_p3_EBX~0_10) (= v_~a~0_72 (ite .cse0 v_~a$mem_tmp~0_18 .cse11))))))) InVars {~a~0=v_~a~0_74, ~a$w_buff1~0=v_~a$w_buff1~0_48, ~a$w_buff0~0=v_~a$w_buff0~0_55, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_138, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_125, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_137, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_61, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_72, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_13, ~a$w_buff1~0=v_~a$w_buff1~0_47, ~a$flush_delayed~0=v_~a$flush_delayed~0_23, ~a$w_buff0~0=v_~a$w_buff0~0_54, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_124, ~weak$$choice2~0=v_~weak$$choice2~0_30, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][65], [Black: 149#(= ~z~0 0), Black: 153#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~z~0 0)), Black: 155#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z~0 0)), 8#L804true, Black: 150#(not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)), 164#true, 16#L872true, 122#(and (not (= |ULTIMATE.start_main_~#t714~0#1.base| |ULTIMATE.start_main_~#t713~0#1.base|)) (not (= |ULTIMATE.start_main_~#t715~0#1.base| |ULTIMATE.start_main_~#t713~0#1.base|)) (not (= |ULTIMATE.start_main_~#t716~0#1.base| |ULTIMATE.start_main_~#t715~0#1.base|)) (not (= |ULTIMATE.start_main_~#t716~0#1.base| |ULTIMATE.start_main_~#t714~0#1.base|)) (not (= |ULTIMATE.start_main_~#t715~0#1.base| |ULTIMATE.start_main_~#t714~0#1.base|)) (not (= |ULTIMATE.start_main_~#t716~0#1.base| |ULTIMATE.start_main_~#t713~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t715~0#1.base| 0) |ULTIMATE.start_main_~#t714~0#1.base| 0) |ULTIMATE.start_main_~#t713~0#1.base| 0) |ULTIMATE.start_main_~#t716~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)), P1Thread1of1ForFork1InUse, 53#L771true, P2Thread1of1ForFork0InUse, Black: 128#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), P3Thread1of1ForFork2InUse, Black: 135#(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))), P0Thread1of1ForFork3InUse, Black: 131#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 133#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~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: 127#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 147#true, 31#P1EXITtrue, 46#L840true, Black: 157#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)))]) [2023-11-24 21:58:32,439 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-11-24 21:58:32,439 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-24 21:58:32,439 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-24 21:58:32,439 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-24 21:58:33,041 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([463] L824-->L840: Formula: (let ((.cse8 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse5 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse6 (not .cse5)) (.cse12 (= (mod v_~a$w_buff0_used~0_138 256) 0)) (.cse2 (and .cse5 .cse8)) (.cse3 (and (= (mod v_~a$w_buff1_used~0_125 256) 0) .cse5))) (let ((.cse9 (or .cse12 .cse2 .cse3)) (.cse10 (and .cse6 (not .cse12)))) (let ((.cse1 (= (mod v_~a$w_buff0_used~0_137 256) 0)) (.cse4 (= (mod v_~a$w_buff1_used~0_124 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse11 (ite .cse9 v_~a~0_74 (ite .cse10 v_~a$w_buff0~0_55 v_~a$w_buff1~0_48)))) (and (= v_~a$flush_delayed~0_23 0) (= v_~a$w_buff0~0_54 v_~a$w_buff0~0_55) (= v_~a$w_buff1~0_48 v_~a$w_buff1~0_47) (= (ite .cse0 v_~a$w_buff1_used~0_125 (ite (or .cse1 .cse2 .cse3) v_~a$w_buff1_used~0_125 0)) v_~a$w_buff1_used~0_124) (= (ite .cse0 v_~a$r_buff0_thd4~0_62 (ite (or .cse1 (and .cse4 .cse5) .cse2) v_~a$r_buff0_thd4~0_62 (ite (and .cse6 (not .cse1)) 0 v_~a$r_buff0_thd4~0_62))) v_~a$r_buff0_thd4~0_61) (= v_~a$r_buff1_thd4~0_59 (ite .cse0 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse7 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or .cse1 (and .cse7 .cse8) (and .cse7 .cse4))) v_~a$r_buff1_thd4~0_60 0))) (= v_~a$w_buff0_used~0_137 (ite .cse0 v_~a$w_buff0_used~0_138 (ite .cse9 v_~a$w_buff0_used~0_138 (ite .cse10 0 v_~a$w_buff0_used~0_138)))) (= v_~a~0_74 v_~a$mem_tmp~0_18) (= .cse11 v_~__unbuffered_p3_EBX~0_10) (= v_~a~0_72 (ite .cse0 v_~a$mem_tmp~0_18 .cse11))))))) InVars {~a~0=v_~a~0_74, ~a$w_buff1~0=v_~a$w_buff1~0_48, ~a$w_buff0~0=v_~a$w_buff0~0_55, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_138, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_125, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_137, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_61, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_72, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_13, ~a$w_buff1~0=v_~a$w_buff1~0_47, ~a$flush_delayed~0=v_~a$flush_delayed~0_23, ~a$w_buff0~0=v_~a$w_buff0~0_54, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_124, ~weak$$choice2~0=v_~weak$$choice2~0_30, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][65], [Black: 149#(= ~z~0 0), Black: 153#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~z~0 0)), Black: 155#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z~0 0)), 8#L804true, Black: 150#(not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)), 14#L871-3true, 122#(and (not (= |ULTIMATE.start_main_~#t714~0#1.base| |ULTIMATE.start_main_~#t713~0#1.base|)) (not (= |ULTIMATE.start_main_~#t715~0#1.base| |ULTIMATE.start_main_~#t713~0#1.base|)) (not (= |ULTIMATE.start_main_~#t716~0#1.base| |ULTIMATE.start_main_~#t715~0#1.base|)) (not (= |ULTIMATE.start_main_~#t716~0#1.base| |ULTIMATE.start_main_~#t714~0#1.base|)) (not (= |ULTIMATE.start_main_~#t715~0#1.base| |ULTIMATE.start_main_~#t714~0#1.base|)) (not (= |ULTIMATE.start_main_~#t716~0#1.base| |ULTIMATE.start_main_~#t713~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t715~0#1.base| 0) |ULTIMATE.start_main_~#t714~0#1.base| 0) |ULTIMATE.start_main_~#t713~0#1.base| 0) |ULTIMATE.start_main_~#t716~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)), 164#true, P1Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, 43#P0EXITtrue, P3Thread1of1ForFork2InUse, Black: 128#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 135#(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))), P0Thread1of1ForFork3InUse, Black: 131#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 133#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~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: 127#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 147#true, 31#P1EXITtrue, 46#L840true, Black: 157#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)))]) [2023-11-24 21:58:33,041 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-11-24 21:58:33,042 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-24 21:58:33,042 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-24 21:58:33,042 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-24 21:58:33,368 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([463] L824-->L840: Formula: (let ((.cse8 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse5 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse6 (not .cse5)) (.cse12 (= (mod v_~a$w_buff0_used~0_138 256) 0)) (.cse2 (and .cse5 .cse8)) (.cse3 (and (= (mod v_~a$w_buff1_used~0_125 256) 0) .cse5))) (let ((.cse9 (or .cse12 .cse2 .cse3)) (.cse10 (and .cse6 (not .cse12)))) (let ((.cse1 (= (mod v_~a$w_buff0_used~0_137 256) 0)) (.cse4 (= (mod v_~a$w_buff1_used~0_124 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse11 (ite .cse9 v_~a~0_74 (ite .cse10 v_~a$w_buff0~0_55 v_~a$w_buff1~0_48)))) (and (= v_~a$flush_delayed~0_23 0) (= v_~a$w_buff0~0_54 v_~a$w_buff0~0_55) (= v_~a$w_buff1~0_48 v_~a$w_buff1~0_47) (= (ite .cse0 v_~a$w_buff1_used~0_125 (ite (or .cse1 .cse2 .cse3) v_~a$w_buff1_used~0_125 0)) v_~a$w_buff1_used~0_124) (= (ite .cse0 v_~a$r_buff0_thd4~0_62 (ite (or .cse1 (and .cse4 .cse5) .cse2) v_~a$r_buff0_thd4~0_62 (ite (and .cse6 (not .cse1)) 0 v_~a$r_buff0_thd4~0_62))) v_~a$r_buff0_thd4~0_61) (= v_~a$r_buff1_thd4~0_59 (ite .cse0 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse7 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or .cse1 (and .cse7 .cse8) (and .cse7 .cse4))) v_~a$r_buff1_thd4~0_60 0))) (= v_~a$w_buff0_used~0_137 (ite .cse0 v_~a$w_buff0_used~0_138 (ite .cse9 v_~a$w_buff0_used~0_138 (ite .cse10 0 v_~a$w_buff0_used~0_138)))) (= v_~a~0_74 v_~a$mem_tmp~0_18) (= .cse11 v_~__unbuffered_p3_EBX~0_10) (= v_~a~0_72 (ite .cse0 v_~a$mem_tmp~0_18 .cse11))))))) InVars {~a~0=v_~a~0_74, ~a$w_buff1~0=v_~a$w_buff1~0_48, ~a$w_buff0~0=v_~a$w_buff0~0_55, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_138, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_125, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_137, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_61, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_72, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_13, ~a$w_buff1~0=v_~a$w_buff1~0_47, ~a$flush_delayed~0=v_~a$flush_delayed~0_23, ~a$w_buff0~0=v_~a$w_buff0~0_54, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_124, ~weak$$choice2~0=v_~weak$$choice2~0_30, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][65], [Black: 149#(= ~z~0 0), Black: 153#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~z~0 0)), Black: 155#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z~0 0)), 8#L804true, Black: 150#(not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)), 164#true, 16#L872true, 122#(and (not (= |ULTIMATE.start_main_~#t714~0#1.base| |ULTIMATE.start_main_~#t713~0#1.base|)) (not (= |ULTIMATE.start_main_~#t715~0#1.base| |ULTIMATE.start_main_~#t713~0#1.base|)) (not (= |ULTIMATE.start_main_~#t716~0#1.base| |ULTIMATE.start_main_~#t715~0#1.base|)) (not (= |ULTIMATE.start_main_~#t716~0#1.base| |ULTIMATE.start_main_~#t714~0#1.base|)) (not (= |ULTIMATE.start_main_~#t715~0#1.base| |ULTIMATE.start_main_~#t714~0#1.base|)) (not (= |ULTIMATE.start_main_~#t716~0#1.base| |ULTIMATE.start_main_~#t713~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t715~0#1.base| 0) |ULTIMATE.start_main_~#t714~0#1.base| 0) |ULTIMATE.start_main_~#t713~0#1.base| 0) |ULTIMATE.start_main_~#t716~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)), P1Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, 43#P0EXITtrue, Black: 128#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), P3Thread1of1ForFork2InUse, Black: 135#(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: 131#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), P0Thread1of1ForFork3InUse, Black: 133#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~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: 127#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 147#true, 31#P1EXITtrue, 46#L840true, Black: 157#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)))]) [2023-11-24 21:58:33,369 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-11-24 21:58:33,369 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-24 21:58:33,369 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-24 21:58:33,369 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-24 21:58:33,409 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([463] L824-->L840: Formula: (let ((.cse8 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse5 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse6 (not .cse5)) (.cse12 (= (mod v_~a$w_buff0_used~0_138 256) 0)) (.cse2 (and .cse5 .cse8)) (.cse3 (and (= (mod v_~a$w_buff1_used~0_125 256) 0) .cse5))) (let ((.cse9 (or .cse12 .cse2 .cse3)) (.cse10 (and .cse6 (not .cse12)))) (let ((.cse1 (= (mod v_~a$w_buff0_used~0_137 256) 0)) (.cse4 (= (mod v_~a$w_buff1_used~0_124 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse11 (ite .cse9 v_~a~0_74 (ite .cse10 v_~a$w_buff0~0_55 v_~a$w_buff1~0_48)))) (and (= v_~a$flush_delayed~0_23 0) (= v_~a$w_buff0~0_54 v_~a$w_buff0~0_55) (= v_~a$w_buff1~0_48 v_~a$w_buff1~0_47) (= (ite .cse0 v_~a$w_buff1_used~0_125 (ite (or .cse1 .cse2 .cse3) v_~a$w_buff1_used~0_125 0)) v_~a$w_buff1_used~0_124) (= (ite .cse0 v_~a$r_buff0_thd4~0_62 (ite (or .cse1 (and .cse4 .cse5) .cse2) v_~a$r_buff0_thd4~0_62 (ite (and .cse6 (not .cse1)) 0 v_~a$r_buff0_thd4~0_62))) v_~a$r_buff0_thd4~0_61) (= v_~a$r_buff1_thd4~0_59 (ite .cse0 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse7 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or .cse1 (and .cse7 .cse8) (and .cse7 .cse4))) v_~a$r_buff1_thd4~0_60 0))) (= v_~a$w_buff0_used~0_137 (ite .cse0 v_~a$w_buff0_used~0_138 (ite .cse9 v_~a$w_buff0_used~0_138 (ite .cse10 0 v_~a$w_buff0_used~0_138)))) (= v_~a~0_74 v_~a$mem_tmp~0_18) (= .cse11 v_~__unbuffered_p3_EBX~0_10) (= v_~a~0_72 (ite .cse0 v_~a$mem_tmp~0_18 .cse11))))))) InVars {~a~0=v_~a~0_74, ~a$w_buff1~0=v_~a$w_buff1~0_48, ~a$w_buff0~0=v_~a$w_buff0~0_55, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_138, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_125, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_137, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_61, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_72, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_13, ~a$w_buff1~0=v_~a$w_buff1~0_47, ~a$flush_delayed~0=v_~a$flush_delayed~0_23, ~a$w_buff0~0=v_~a$w_buff0~0_54, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_124, ~weak$$choice2~0=v_~weak$$choice2~0_30, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][65], [Black: 149#(= ~z~0 0), 30#L876true, Black: 153#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~z~0 0)), 8#L804true, Black: 155#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z~0 0)), Black: 150#(not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)), 164#true, 122#(and (not (= |ULTIMATE.start_main_~#t714~0#1.base| |ULTIMATE.start_main_~#t713~0#1.base|)) (not (= |ULTIMATE.start_main_~#t715~0#1.base| |ULTIMATE.start_main_~#t713~0#1.base|)) (not (= |ULTIMATE.start_main_~#t716~0#1.base| |ULTIMATE.start_main_~#t715~0#1.base|)) (not (= |ULTIMATE.start_main_~#t716~0#1.base| |ULTIMATE.start_main_~#t714~0#1.base|)) (not (= |ULTIMATE.start_main_~#t715~0#1.base| |ULTIMATE.start_main_~#t714~0#1.base|)) (not (= |ULTIMATE.start_main_~#t716~0#1.base| |ULTIMATE.start_main_~#t713~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t715~0#1.base| 0) |ULTIMATE.start_main_~#t714~0#1.base| 0) |ULTIMATE.start_main_~#t713~0#1.base| 0) |ULTIMATE.start_main_~#t716~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)), P1Thread1of1ForFork1InUse, 53#L771true, P2Thread1of1ForFork0InUse, Black: 128#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), P3Thread1of1ForFork2InUse, Black: 135#(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: 131#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), P0Thread1of1ForFork3InUse, Black: 133#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~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: 127#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 147#true, 31#P1EXITtrue, 46#L840true, Black: 157#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)))]) [2023-11-24 21:58:33,409 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-11-24 21:58:33,409 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-24 21:58:33,410 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-24 21:58:33,410 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-24 21:58:33,800 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([463] L824-->L840: Formula: (let ((.cse8 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse5 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse6 (not .cse5)) (.cse12 (= (mod v_~a$w_buff0_used~0_138 256) 0)) (.cse2 (and .cse5 .cse8)) (.cse3 (and (= (mod v_~a$w_buff1_used~0_125 256) 0) .cse5))) (let ((.cse9 (or .cse12 .cse2 .cse3)) (.cse10 (and .cse6 (not .cse12)))) (let ((.cse1 (= (mod v_~a$w_buff0_used~0_137 256) 0)) (.cse4 (= (mod v_~a$w_buff1_used~0_124 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse11 (ite .cse9 v_~a~0_74 (ite .cse10 v_~a$w_buff0~0_55 v_~a$w_buff1~0_48)))) (and (= v_~a$flush_delayed~0_23 0) (= v_~a$w_buff0~0_54 v_~a$w_buff0~0_55) (= v_~a$w_buff1~0_48 v_~a$w_buff1~0_47) (= (ite .cse0 v_~a$w_buff1_used~0_125 (ite (or .cse1 .cse2 .cse3) v_~a$w_buff1_used~0_125 0)) v_~a$w_buff1_used~0_124) (= (ite .cse0 v_~a$r_buff0_thd4~0_62 (ite (or .cse1 (and .cse4 .cse5) .cse2) v_~a$r_buff0_thd4~0_62 (ite (and .cse6 (not .cse1)) 0 v_~a$r_buff0_thd4~0_62))) v_~a$r_buff0_thd4~0_61) (= v_~a$r_buff1_thd4~0_59 (ite .cse0 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse7 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or .cse1 (and .cse7 .cse8) (and .cse7 .cse4))) v_~a$r_buff1_thd4~0_60 0))) (= v_~a$w_buff0_used~0_137 (ite .cse0 v_~a$w_buff0_used~0_138 (ite .cse9 v_~a$w_buff0_used~0_138 (ite .cse10 0 v_~a$w_buff0_used~0_138)))) (= v_~a~0_74 v_~a$mem_tmp~0_18) (= .cse11 v_~__unbuffered_p3_EBX~0_10) (= v_~a~0_72 (ite .cse0 v_~a$mem_tmp~0_18 .cse11))))))) InVars {~a~0=v_~a~0_74, ~a$w_buff1~0=v_~a$w_buff1~0_48, ~a$w_buff0~0=v_~a$w_buff0~0_55, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_138, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_125, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_137, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_61, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_72, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_13, ~a$w_buff1~0=v_~a$w_buff1~0_47, ~a$flush_delayed~0=v_~a$flush_delayed~0_23, ~a$w_buff0~0=v_~a$w_buff0~0_54, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_124, ~weak$$choice2~0=v_~weak$$choice2~0_30, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][65], [Black: 149#(= ~z~0 0), Black: 153#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~z~0 0)), Black: 155#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z~0 0)), 8#L804true, Black: 150#(not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)), 44#L882true, 164#true, 122#(and (not (= |ULTIMATE.start_main_~#t714~0#1.base| |ULTIMATE.start_main_~#t713~0#1.base|)) (not (= |ULTIMATE.start_main_~#t715~0#1.base| |ULTIMATE.start_main_~#t713~0#1.base|)) (not (= |ULTIMATE.start_main_~#t716~0#1.base| |ULTIMATE.start_main_~#t715~0#1.base|)) (not (= |ULTIMATE.start_main_~#t716~0#1.base| |ULTIMATE.start_main_~#t714~0#1.base|)) (not (= |ULTIMATE.start_main_~#t715~0#1.base| |ULTIMATE.start_main_~#t714~0#1.base|)) (not (= |ULTIMATE.start_main_~#t716~0#1.base| |ULTIMATE.start_main_~#t713~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t715~0#1.base| 0) |ULTIMATE.start_main_~#t714~0#1.base| 0) |ULTIMATE.start_main_~#t713~0#1.base| 0) |ULTIMATE.start_main_~#t716~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)), P1Thread1of1ForFork1InUse, 53#L771true, P2Thread1of1ForFork0InUse, Black: 128#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), P3Thread1of1ForFork2InUse, Black: 135#(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))), P0Thread1of1ForFork3InUse, Black: 131#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 133#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~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: 127#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 147#true, 31#P1EXITtrue, 46#L840true, Black: 157#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)))]) [2023-11-24 21:58:33,800 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-24 21:58:33,800 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-24 21:58:33,800 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-24 21:58:33,801 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-24 21:58:33,801 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([422] L882-->L885: Formula: (= v_~main$tmp_guard1~0_2 (ite (= (ite (not (and (= 2 v_~z~0_5) (= v_~__unbuffered_p1_EAX~0_3 0) (= 2 v_~__unbuffered_p3_EAX~0_3) (= v_~__unbuffered_p3_EBX~0_3 0) (= 2 v_~x~0_4))) 1 0) 0) 0 1)) InVars {~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~z~0=v_~z~0_5, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~x~0=v_~x~0_4} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_2, ~z~0=v_~z~0_5, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[~main$tmp_guard1~0][76], [Black: 149#(= ~z~0 0), Black: 153#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~z~0 0)), Black: 155#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z~0 0)), 8#L804true, Black: 150#(not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)), 59#L885true, 122#(and (not (= |ULTIMATE.start_main_~#t714~0#1.base| |ULTIMATE.start_main_~#t713~0#1.base|)) (not (= |ULTIMATE.start_main_~#t715~0#1.base| |ULTIMATE.start_main_~#t713~0#1.base|)) (not (= |ULTIMATE.start_main_~#t716~0#1.base| |ULTIMATE.start_main_~#t715~0#1.base|)) (not (= |ULTIMATE.start_main_~#t716~0#1.base| |ULTIMATE.start_main_~#t714~0#1.base|)) (not (= |ULTIMATE.start_main_~#t715~0#1.base| |ULTIMATE.start_main_~#t714~0#1.base|)) (not (= |ULTIMATE.start_main_~#t716~0#1.base| |ULTIMATE.start_main_~#t713~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t715~0#1.base| 0) |ULTIMATE.start_main_~#t714~0#1.base| 0) |ULTIMATE.start_main_~#t713~0#1.base| 0) |ULTIMATE.start_main_~#t716~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)), 164#true, P1Thread1of1ForFork1InUse, 62#L824true, 53#L771true, P2Thread1of1ForFork0InUse, Black: 128#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), P3Thread1of1ForFork2InUse, Black: 135#(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))), P0Thread1of1ForFork3InUse, Black: 131#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 133#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~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: 127#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 147#true, 31#P1EXITtrue, Black: 157#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)))]) [2023-11-24 21:58:33,801 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-24 21:58:33,801 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-24 21:58:33,801 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-24 21:58:33,802 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-24 21:58:34,286 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([463] L824-->L840: Formula: (let ((.cse8 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse5 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse6 (not .cse5)) (.cse12 (= (mod v_~a$w_buff0_used~0_138 256) 0)) (.cse2 (and .cse5 .cse8)) (.cse3 (and (= (mod v_~a$w_buff1_used~0_125 256) 0) .cse5))) (let ((.cse9 (or .cse12 .cse2 .cse3)) (.cse10 (and .cse6 (not .cse12)))) (let ((.cse1 (= (mod v_~a$w_buff0_used~0_137 256) 0)) (.cse4 (= (mod v_~a$w_buff1_used~0_124 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse11 (ite .cse9 v_~a~0_74 (ite .cse10 v_~a$w_buff0~0_55 v_~a$w_buff1~0_48)))) (and (= v_~a$flush_delayed~0_23 0) (= v_~a$w_buff0~0_54 v_~a$w_buff0~0_55) (= v_~a$w_buff1~0_48 v_~a$w_buff1~0_47) (= (ite .cse0 v_~a$w_buff1_used~0_125 (ite (or .cse1 .cse2 .cse3) v_~a$w_buff1_used~0_125 0)) v_~a$w_buff1_used~0_124) (= (ite .cse0 v_~a$r_buff0_thd4~0_62 (ite (or .cse1 (and .cse4 .cse5) .cse2) v_~a$r_buff0_thd4~0_62 (ite (and .cse6 (not .cse1)) 0 v_~a$r_buff0_thd4~0_62))) v_~a$r_buff0_thd4~0_61) (= v_~a$r_buff1_thd4~0_59 (ite .cse0 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse7 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or .cse1 (and .cse7 .cse8) (and .cse7 .cse4))) v_~a$r_buff1_thd4~0_60 0))) (= v_~a$w_buff0_used~0_137 (ite .cse0 v_~a$w_buff0_used~0_138 (ite .cse9 v_~a$w_buff0_used~0_138 (ite .cse10 0 v_~a$w_buff0_used~0_138)))) (= v_~a~0_74 v_~a$mem_tmp~0_18) (= .cse11 v_~__unbuffered_p3_EBX~0_10) (= v_~a~0_72 (ite .cse0 v_~a$mem_tmp~0_18 .cse11))))))) InVars {~a~0=v_~a~0_74, ~a$w_buff1~0=v_~a$w_buff1~0_48, ~a$w_buff0~0=v_~a$w_buff0~0_55, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_138, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_125, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_137, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_61, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_72, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_13, ~a$w_buff1~0=v_~a$w_buff1~0_47, ~a$flush_delayed~0=v_~a$flush_delayed~0_23, ~a$w_buff0~0=v_~a$w_buff0~0_54, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_124, ~weak$$choice2~0=v_~weak$$choice2~0_30, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][65], [Black: 149#(= ~z~0 0), Black: 153#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~z~0 0)), 30#L876true, Black: 155#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z~0 0)), 8#L804true, Black: 150#(not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)), 164#true, 122#(and (not (= |ULTIMATE.start_main_~#t714~0#1.base| |ULTIMATE.start_main_~#t713~0#1.base|)) (not (= |ULTIMATE.start_main_~#t715~0#1.base| |ULTIMATE.start_main_~#t713~0#1.base|)) (not (= |ULTIMATE.start_main_~#t716~0#1.base| |ULTIMATE.start_main_~#t715~0#1.base|)) (not (= |ULTIMATE.start_main_~#t716~0#1.base| |ULTIMATE.start_main_~#t714~0#1.base|)) (not (= |ULTIMATE.start_main_~#t715~0#1.base| |ULTIMATE.start_main_~#t714~0#1.base|)) (not (= |ULTIMATE.start_main_~#t716~0#1.base| |ULTIMATE.start_main_~#t713~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t715~0#1.base| 0) |ULTIMATE.start_main_~#t714~0#1.base| 0) |ULTIMATE.start_main_~#t713~0#1.base| 0) |ULTIMATE.start_main_~#t716~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)), P1Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, 43#P0EXITtrue, Black: 128#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), P3Thread1of1ForFork2InUse, Black: 135#(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))), P0Thread1of1ForFork3InUse, Black: 131#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 133#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~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: 127#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 147#true, 31#P1EXITtrue, 46#L840true, Black: 157#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)))]) [2023-11-24 21:58:34,286 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-24 21:58:34,286 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-24 21:58:34,287 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-24 21:58:34,287 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-24 21:58:34,565 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([463] L824-->L840: Formula: (let ((.cse8 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse5 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse6 (not .cse5)) (.cse12 (= (mod v_~a$w_buff0_used~0_138 256) 0)) (.cse2 (and .cse5 .cse8)) (.cse3 (and (= (mod v_~a$w_buff1_used~0_125 256) 0) .cse5))) (let ((.cse9 (or .cse12 .cse2 .cse3)) (.cse10 (and .cse6 (not .cse12)))) (let ((.cse1 (= (mod v_~a$w_buff0_used~0_137 256) 0)) (.cse4 (= (mod v_~a$w_buff1_used~0_124 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse11 (ite .cse9 v_~a~0_74 (ite .cse10 v_~a$w_buff0~0_55 v_~a$w_buff1~0_48)))) (and (= v_~a$flush_delayed~0_23 0) (= v_~a$w_buff0~0_54 v_~a$w_buff0~0_55) (= v_~a$w_buff1~0_48 v_~a$w_buff1~0_47) (= (ite .cse0 v_~a$w_buff1_used~0_125 (ite (or .cse1 .cse2 .cse3) v_~a$w_buff1_used~0_125 0)) v_~a$w_buff1_used~0_124) (= (ite .cse0 v_~a$r_buff0_thd4~0_62 (ite (or .cse1 (and .cse4 .cse5) .cse2) v_~a$r_buff0_thd4~0_62 (ite (and .cse6 (not .cse1)) 0 v_~a$r_buff0_thd4~0_62))) v_~a$r_buff0_thd4~0_61) (= v_~a$r_buff1_thd4~0_59 (ite .cse0 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse7 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or .cse1 (and .cse7 .cse8) (and .cse7 .cse4))) v_~a$r_buff1_thd4~0_60 0))) (= v_~a$w_buff0_used~0_137 (ite .cse0 v_~a$w_buff0_used~0_138 (ite .cse9 v_~a$w_buff0_used~0_138 (ite .cse10 0 v_~a$w_buff0_used~0_138)))) (= v_~a~0_74 v_~a$mem_tmp~0_18) (= .cse11 v_~__unbuffered_p3_EBX~0_10) (= v_~a~0_72 (ite .cse0 v_~a$mem_tmp~0_18 .cse11))))))) InVars {~a~0=v_~a~0_74, ~a$w_buff1~0=v_~a$w_buff1~0_48, ~a$w_buff0~0=v_~a$w_buff0~0_55, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_138, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_125, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_137, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_61, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_72, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_13, ~a$w_buff1~0=v_~a$w_buff1~0_47, ~a$flush_delayed~0=v_~a$flush_delayed~0_23, ~a$w_buff0~0=v_~a$w_buff0~0_54, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_124, ~weak$$choice2~0=v_~weak$$choice2~0_30, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][65], [Black: 149#(= ~z~0 0), Black: 153#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~z~0 0)), 8#L804true, Black: 155#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z~0 0)), Black: 150#(not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)), 44#L882true, 164#true, 122#(and (not (= |ULTIMATE.start_main_~#t714~0#1.base| |ULTIMATE.start_main_~#t713~0#1.base|)) (not (= |ULTIMATE.start_main_~#t715~0#1.base| |ULTIMATE.start_main_~#t713~0#1.base|)) (not (= |ULTIMATE.start_main_~#t716~0#1.base| |ULTIMATE.start_main_~#t715~0#1.base|)) (not (= |ULTIMATE.start_main_~#t716~0#1.base| |ULTIMATE.start_main_~#t714~0#1.base|)) (not (= |ULTIMATE.start_main_~#t715~0#1.base| |ULTIMATE.start_main_~#t714~0#1.base|)) (not (= |ULTIMATE.start_main_~#t716~0#1.base| |ULTIMATE.start_main_~#t713~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t715~0#1.base| 0) |ULTIMATE.start_main_~#t714~0#1.base| 0) |ULTIMATE.start_main_~#t713~0#1.base| 0) |ULTIMATE.start_main_~#t716~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)), P1Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, 43#P0EXITtrue, Black: 128#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), P3Thread1of1ForFork2InUse, Black: 135#(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: 131#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), P0Thread1of1ForFork3InUse, Black: 133#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~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: 127#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 147#true, 31#P1EXITtrue, 46#L840true, Black: 157#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)))]) [2023-11-24 21:58:34,566 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-11-24 21:58:34,566 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-24 21:58:34,566 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-24 21:58:34,566 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-24 21:58:34,566 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([422] L882-->L885: Formula: (= v_~main$tmp_guard1~0_2 (ite (= (ite (not (and (= 2 v_~z~0_5) (= v_~__unbuffered_p1_EAX~0_3 0) (= 2 v_~__unbuffered_p3_EAX~0_3) (= v_~__unbuffered_p3_EBX~0_3 0) (= 2 v_~x~0_4))) 1 0) 0) 0 1)) InVars {~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~z~0=v_~z~0_5, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~x~0=v_~x~0_4} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_2, ~z~0=v_~z~0_5, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[~main$tmp_guard1~0][76], [Black: 149#(= ~z~0 0), Black: 153#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~z~0 0)), 8#L804true, Black: 155#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z~0 0)), Black: 150#(not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)), 59#L885true, 164#true, 122#(and (not (= |ULTIMATE.start_main_~#t714~0#1.base| |ULTIMATE.start_main_~#t713~0#1.base|)) (not (= |ULTIMATE.start_main_~#t715~0#1.base| |ULTIMATE.start_main_~#t713~0#1.base|)) (not (= |ULTIMATE.start_main_~#t716~0#1.base| |ULTIMATE.start_main_~#t715~0#1.base|)) (not (= |ULTIMATE.start_main_~#t716~0#1.base| |ULTIMATE.start_main_~#t714~0#1.base|)) (not (= |ULTIMATE.start_main_~#t715~0#1.base| |ULTIMATE.start_main_~#t714~0#1.base|)) (not (= |ULTIMATE.start_main_~#t716~0#1.base| |ULTIMATE.start_main_~#t713~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t715~0#1.base| 0) |ULTIMATE.start_main_~#t714~0#1.base| 0) |ULTIMATE.start_main_~#t713~0#1.base| 0) |ULTIMATE.start_main_~#t716~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)), P1Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, 62#L824true, 43#P0EXITtrue, Black: 128#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), P3Thread1of1ForFork2InUse, Black: 135#(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))), P0Thread1of1ForFork3InUse, Black: 131#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 133#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~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: 127#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 147#true, 31#P1EXITtrue, Black: 157#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)))]) [2023-11-24 21:58:34,566 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-11-24 21:58:34,567 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-24 21:58:34,567 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-24 21:58:34,567 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-24 21:58:35,476 INFO L124 PetriNetUnfolderBase]: 21972/35287 cut-off events. [2023-11-24 21:58:35,477 INFO L125 PetriNetUnfolderBase]: For 58741/59646 co-relation queries the response was YES. [2023-11-24 21:58:35,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98309 conditions, 35287 events. 21972/35287 cut-off events. For 58741/59646 co-relation queries the response was YES. Maximal size of possible extension queue 1863. Compared 297766 event pairs, 10159 based on Foata normal form. 1082/34942 useless extension candidates. Maximal degree in co-relation 98287. Up to 21988 conditions per place. [2023-11-24 21:58:35,750 INFO L140 encePairwiseOnDemand]: 60/66 looper letters, 44 selfloop transitions, 5 changer transitions 55/132 dead transitions. [2023-11-24 21:58:35,750 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 132 transitions, 761 flow [2023-11-24 21:58:35,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 21:58:35,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-24 21:58:35,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 319 transitions. [2023-11-24 21:58:35,753 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6904761904761905 [2023-11-24 21:58:35,753 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 319 transitions. [2023-11-24 21:58:35,753 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 319 transitions. [2023-11-24 21:58:35,754 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:58:35,754 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 319 transitions. [2023-11-24 21:58:35,756 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 45.57142857142857) internal successors, (319), 7 states have internal predecessors, (319), 0 states have call successors, (0), 0 states 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:58:35,759 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 66.0) internal successors, (528), 8 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:35,760 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 66.0) internal successors, (528), 8 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:35,760 INFO L175 Difference]: Start difference. First operand has 73 places, 57 transitions, 256 flow. Second operand 7 states and 319 transitions. [2023-11-24 21:58:35,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 132 transitions, 761 flow [2023-11-24 21:58:36,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 132 transitions, 748 flow, removed 4 selfloop flow, removed 3 redundant places. [2023-11-24 21:58:36,277 INFO L231 Difference]: Finished difference. Result has 77 places, 61 transitions, 320 flow [2023-11-24 21:58:36,278 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=320, PETRI_PLACES=77, PETRI_TRANSITIONS=61} [2023-11-24 21:58:36,278 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 4 predicate places. [2023-11-24 21:58:36,278 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 61 transitions, 320 flow [2023-11-24 21:58:36,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.8) internal successors, (179), 5 states have internal predecessors, (179), 0 states have call successors, (0), 0 states 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:58:36,279 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:58:36,279 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:58:36,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-24 21:58:36,279 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 21:58:36,280 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:58:36,280 INFO L85 PathProgramCache]: Analyzing trace with hash -88178579, now seen corresponding path program 1 times [2023-11-24 21:58:36,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:58:36,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949692856] [2023-11-24 21:58:36,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:58:36,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:58:36,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:58:36,490 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:58:36,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:58:36,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949692856] [2023-11-24 21:58:36,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949692856] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:58:36,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:58:36,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 21:58:36,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973149602] [2023-11-24 21:58:36,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:58:36,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 21:58:36,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:58:36,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 21:58:36,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-24 21:58:36,496 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 66 [2023-11-24 21:58:36,497 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 61 transitions, 320 flow. Second operand has 5 states, 5 states have (on average 36.8) internal successors, (184), 5 states have internal predecessors, (184), 0 states have call successors, (0), 0 states 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:58:36,497 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:58:36,497 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 66 [2023-11-24 21:58:36,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:58:41,301 INFO L124 PetriNetUnfolderBase]: 18990/30238 cut-off events. [2023-11-24 21:58:41,301 INFO L125 PetriNetUnfolderBase]: For 66502/67944 co-relation queries the response was YES. [2023-11-24 21:58:41,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87239 conditions, 30238 events. 18990/30238 cut-off events. For 66502/67944 co-relation queries the response was YES. Maximal size of possible extension queue 1578. Compared 246082 event pairs, 5204 based on Foata normal form. 1092/30384 useless extension candidates. Maximal degree in co-relation 87213. Up to 15512 conditions per place. [2023-11-24 21:58:41,766 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 34 selfloop transitions, 3 changer transitions 43/114 dead transitions. [2023-11-24 21:58:41,766 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 114 transitions, 644 flow [2023-11-24 21:58:41,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 21:58:41,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-24 21:58:41,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 314 transitions. [2023-11-24 21:58:41,770 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6796536796536796 [2023-11-24 21:58:41,771 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 314 transitions. [2023-11-24 21:58:41,771 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 314 transitions. [2023-11-24 21:58:41,771 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:58:41,772 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 314 transitions. [2023-11-24 21:58:41,773 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 44.857142857142854) internal successors, (314), 7 states have internal predecessors, (314), 0 states have call successors, (0), 0 states 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:58:41,778 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 66.0) internal successors, (528), 8 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:41,778 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 66.0) internal successors, (528), 8 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:41,779 INFO L175 Difference]: Start difference. First operand has 77 places, 61 transitions, 320 flow. Second operand 7 states and 314 transitions. [2023-11-24 21:58:41,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 114 transitions, 644 flow [2023-11-24 21:58:41,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 114 transitions, 627 flow, removed 6 selfloop flow, removed 3 redundant places. [2023-11-24 21:58:41,935 INFO L231 Difference]: Finished difference. Result has 81 places, 61 transitions, 326 flow [2023-11-24 21:58:41,936 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=307, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=326, PETRI_PLACES=81, PETRI_TRANSITIONS=61} [2023-11-24 21:58:41,936 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 8 predicate places. [2023-11-24 21:58:41,937 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 61 transitions, 326 flow [2023-11-24 21:58:41,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 36.8) internal successors, (184), 5 states have internal predecessors, (184), 0 states have call successors, (0), 0 states 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:58:41,937 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:58:41,937 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] [2023-11-24 21:58:41,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-24 21:58:41,937 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 21:58:41,937 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:58:41,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1640057037, now seen corresponding path program 1 times [2023-11-24 21:58:41,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:58:41,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811910711] [2023-11-24 21:58:41,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:58:41,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:58:41,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:58:42,118 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:58:42,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:58:42,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811910711] [2023-11-24 21:58:42,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811910711] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:58:42,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:58:42,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-24 21:58:42,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398850056] [2023-11-24 21:58:42,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:58:42,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-24 21:58:42,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:58:42,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-24 21:58:42,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-24 21:58:42,133 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 66 [2023-11-24 21:58:42,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 61 transitions, 326 flow. Second operand has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 0 states have call successors, (0), 0 states 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:58:42,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:58:42,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 66 [2023-11-24 21:58:42,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:58:49,777 INFO L124 PetriNetUnfolderBase]: 34520/52005 cut-off events. [2023-11-24 21:58:49,778 INFO L125 PetriNetUnfolderBase]: For 75367/82518 co-relation queries the response was YES. [2023-11-24 21:58:50,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133974 conditions, 52005 events. 34520/52005 cut-off events. For 75367/82518 co-relation queries the response was YES. Maximal size of possible extension queue 2101. Compared 397064 event pairs, 5882 based on Foata normal form. 2194/52700 useless extension candidates. Maximal degree in co-relation 133944. Up to 28039 conditions per place. [2023-11-24 21:58:50,163 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 57 selfloop transitions, 6 changer transitions 0/95 dead transitions. [2023-11-24 21:58:50,163 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 95 transitions, 543 flow [2023-11-24 21:58:50,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 21:58:50,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-24 21:58:50,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 190 transitions. [2023-11-24 21:58:50,168 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7196969696969697 [2023-11-24 21:58:50,168 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 190 transitions. [2023-11-24 21:58:50,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 190 transitions. [2023-11-24 21:58:50,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:58:50,169 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 190 transitions. [2023-11-24 21:58:50,170 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 47.5) internal successors, (190), 4 states have internal predecessors, (190), 0 states have call successors, (0), 0 states 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:58:50,171 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 66.0) internal successors, (330), 5 states have internal predecessors, (330), 0 states have call successors, (0), 0 states 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:58:50,171 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 66.0) internal successors, (330), 5 states have internal predecessors, (330), 0 states have call successors, (0), 0 states 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:58:50,171 INFO L175 Difference]: Start difference. First operand has 81 places, 61 transitions, 326 flow. Second operand 4 states and 190 transitions. [2023-11-24 21:58:50,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 95 transitions, 543 flow [2023-11-24 21:58:50,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 95 transitions, 525 flow, removed 6 selfloop flow, removed 6 redundant places. [2023-11-24 21:58:50,361 INFO L231 Difference]: Finished difference. Result has 76 places, 66 transitions, 354 flow [2023-11-24 21:58:50,361 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=354, PETRI_PLACES=76, PETRI_TRANSITIONS=66} [2023-11-24 21:58:50,362 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 3 predicate places. [2023-11-24 21:58:50,362 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 66 transitions, 354 flow [2023-11-24 21:58:50,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 0 states have call successors, (0), 0 states 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:58:50,363 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:58:50,363 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] [2023-11-24 21:58:50,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-24 21:58:50,363 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 21:58:50,364 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:58:50,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1001356891, now seen corresponding path program 1 times [2023-11-24 21:58:50,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:58:50,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654391440] [2023-11-24 21:58:50,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:58:50,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:58:50,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:58:50,627 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:58:50,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:58:50,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654391440] [2023-11-24 21:58:50,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654391440] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:58:50,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:58:50,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 21:58:50,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402611344] [2023-11-24 21:58:50,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:58:50,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 21:58:50,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:58:50,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 21:58:50,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-24 21:58:50,647 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 66 [2023-11-24 21:58:50,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 66 transitions, 354 flow. Second operand has 5 states, 5 states have (on average 36.4) internal successors, (182), 5 states have internal predecessors, (182), 0 states have call successors, (0), 0 states 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:58:50,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:58:50,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 66 [2023-11-24 21:58:50,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand