./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix011_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-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c4cd8c4-4f20-4e49-9988-5a8403f7bb69/bin/uautomizer-verify-NlZe1sFDwI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c4cd8c4-4f20-4e49-9988-5a8403f7bb69/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_0c4cd8c4-4f20-4e49-9988-5a8403f7bb69/bin/uautomizer-verify-NlZe1sFDwI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c4cd8c4-4f20-4e49-9988-5a8403f7bb69/bin/uautomizer-verify-NlZe1sFDwI/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix011_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c4cd8c4-4f20-4e49-9988-5a8403f7bb69/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_0c4cd8c4-4f20-4e49-9988-5a8403f7bb69/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 833fe1bfba6e9465d0762b8b4b281d00d9e54d53b8918b133a54714c1d863b1b --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-24 21:56:50,766 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-24 21:56:50,887 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c4cd8c4-4f20-4e49-9988-5a8403f7bb69/bin/uautomizer-verify-NlZe1sFDwI/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-24 21:56:50,892 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-24 21:56:50,893 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-24 21:56:50,916 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-24 21:56:50,917 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-24 21:56:50,917 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-24 21:56:50,918 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-24 21:56:50,919 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-24 21:56:50,920 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-24 21:56:50,920 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-24 21:56:50,921 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-24 21:56:50,922 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-24 21:56:50,922 INFO L153 SettingsManager]: * Use SBE=true [2023-11-24 21:56:50,923 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-24 21:56:50,924 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-24 21:56:50,924 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-24 21:56:50,925 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-24 21:56:50,925 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-24 21:56:50,926 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-24 21:56:50,927 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-24 21:56:50,927 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-24 21:56:50,928 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-24 21:56:50,928 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-24 21:56:50,928 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-24 21:56:50,929 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-24 21:56:50,929 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-24 21:56:50,930 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-24 21:56:50,930 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-24 21:56:50,931 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-24 21:56:50,931 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-24 21:56:50,931 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 21:56:50,932 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-24 21:56:50,932 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-24 21:56:50,932 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-24 21:56:50,933 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-24 21:56:50,933 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-24 21:56:50,933 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-24 21:56:50,933 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-24 21:56:50,934 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-24 21:56:50,934 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_0c4cd8c4-4f20-4e49-9988-5a8403f7bb69/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_0c4cd8c4-4f20-4e49-9988-5a8403f7bb69/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 -> 833fe1bfba6e9465d0762b8b4b281d00d9e54d53b8918b133a54714c1d863b1b [2023-11-24 21:56:51,254 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-24 21:56:51,288 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-24 21:56:51,291 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-24 21:56:51,292 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-24 21:56:51,292 INFO L274 PluginConnector]: CDTParser initialized [2023-11-24 21:56:51,294 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c4cd8c4-4f20-4e49-9988-5a8403f7bb69/bin/uautomizer-verify-NlZe1sFDwI/../../sv-benchmarks/c/pthread-wmm/mix011_power.oepc_pso.oepc_rmo.oepc.i [2023-11-24 21:56:54,547 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-24 21:56:54,902 INFO L384 CDTParser]: Found 1 translation units. [2023-11-24 21:56:54,903 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c4cd8c4-4f20-4e49-9988-5a8403f7bb69/sv-benchmarks/c/pthread-wmm/mix011_power.oepc_pso.oepc_rmo.oepc.i [2023-11-24 21:56:54,928 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c4cd8c4-4f20-4e49-9988-5a8403f7bb69/bin/uautomizer-verify-NlZe1sFDwI/data/f96c5c830/0b93eb2b8a84471dba4da0d97a3752e4/FLAG206380c04 [2023-11-24 21:56:54,943 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c4cd8c4-4f20-4e49-9988-5a8403f7bb69/bin/uautomizer-verify-NlZe1sFDwI/data/f96c5c830/0b93eb2b8a84471dba4da0d97a3752e4 [2023-11-24 21:56:54,946 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-24 21:56:54,947 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-24 21:56:54,949 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-24 21:56:54,949 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-24 21:56:54,958 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-24 21:56:54,961 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 09:56:54" (1/1) ... [2023-11-24 21:56:54,962 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72dacf31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:56:54, skipping insertion in model container [2023-11-24 21:56:54,963 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 09:56:54" (1/1) ... [2023-11-24 21:56:55,018 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-24 21:56:55,561 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 21:56:55,574 INFO L202 MainTranslator]: Completed pre-run [2023-11-24 21:56:55,646 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 21:56:55,686 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 21:56:55,686 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 21:56:55,694 INFO L206 MainTranslator]: Completed translation [2023-11-24 21:56:55,695 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:56:55 WrapperNode [2023-11-24 21:56:55,695 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-24 21:56:55,696 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-24 21:56:55,697 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-24 21:56:55,697 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-24 21:56:55,706 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:56:55" (1/1) ... [2023-11-24 21:56:55,764 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:56:55" (1/1) ... [2023-11-24 21:56:55,857 INFO L138 Inliner]: procedures = 176, calls = 61, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 136 [2023-11-24 21:56:55,858 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-24 21:56:55,868 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-24 21:56:55,869 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-24 21:56:55,869 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-24 21:56:55,887 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:56:55" (1/1) ... [2023-11-24 21:56:55,887 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:56:55" (1/1) ... [2023-11-24 21:56:55,892 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:56:55" (1/1) ... [2023-11-24 21:56:55,911 INFO L175 MemorySlicer]: Split 5 memory accesses to 4 slices as follows [2, 1, 1, 1]. 40 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2023-11-24 21:56:55,912 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:56:55" (1/1) ... [2023-11-24 21:56:55,912 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:56:55" (1/1) ... [2023-11-24 21:56:55,923 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:56:55" (1/1) ... [2023-11-24 21:56:55,925 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:56:55" (1/1) ... [2023-11-24 21:56:55,928 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:56:55" (1/1) ... [2023-11-24 21:56:55,930 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:56:55" (1/1) ... [2023-11-24 21:56:55,935 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-24 21:56:55,941 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-24 21:56:55,941 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-24 21:56:55,941 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-24 21:56:55,942 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:56:55" (1/1) ... [2023-11-24 21:56:55,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 21:56:55,971 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c4cd8c4-4f20-4e49-9988-5a8403f7bb69/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 21:56:55,986 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c4cd8c4-4f20-4e49-9988-5a8403f7bb69/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:56:55,999 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c4cd8c4-4f20-4e49-9988-5a8403f7bb69/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:56:56,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-24 21:56:56,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-24 21:56:56,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-24 21:56:56,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-24 21:56:56,022 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-24 21:56:56,022 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-24 21:56:56,022 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-24 21:56:56,022 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-24 21:56:56,023 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-24 21:56:56,023 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-24 21:56:56,023 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-24 21:56:56,023 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-24 21:56:56,023 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-24 21:56:56,024 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-24 21:56:56,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-24 21:56:56,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-24 21:56:56,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-24 21:56:56,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-24 21:56:56,025 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-24 21:56:56,025 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-24 21:56:56,025 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-24 21:56:56,027 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:56:56,190 INFO L241 CfgBuilder]: Building ICFG [2023-11-24 21:56:56,192 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-24 21:56:56,626 INFO L282 CfgBuilder]: Performing block encoding [2023-11-24 21:56:56,938 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-24 21:56:56,939 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-24 21:56:56,939 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 09:56:56 BoogieIcfgContainer [2023-11-24 21:56:56,940 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-24 21:56:56,944 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-24 21:56:56,945 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-24 21:56:56,949 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-24 21:56:56,949 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 09:56:54" (1/3) ... [2023-11-24 21:56:56,950 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@744b61c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 09:56:56, skipping insertion in model container [2023-11-24 21:56:56,950 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:56:55" (2/3) ... [2023-11-24 21:56:56,951 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@744b61c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 09:56:56, skipping insertion in model container [2023-11-24 21:56:56,952 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 09:56:56" (3/3) ... [2023-11-24 21:56:56,956 INFO L112 eAbstractionObserver]: Analyzing ICFG mix011_power.oepc_pso.oepc_rmo.oepc.i [2023-11-24 21:56:56,979 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-24 21:56:56,979 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-24 21:56:56,980 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-24 21:56:57,087 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-24 21:56:57,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 56 transitions, 124 flow [2023-11-24 21:56:57,182 INFO L124 PetriNetUnfolderBase]: 2/53 cut-off events. [2023-11-24 21:56:57,182 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-24 21:56:57,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63 conditions, 53 events. 2/53 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 108 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 52. Up to 2 conditions per place. [2023-11-24 21:56:57,187 INFO L82 GeneralOperation]: Start removeDead. Operand has 64 places, 56 transitions, 124 flow [2023-11-24 21:56:57,200 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 61 places, 53 transitions, 115 flow [2023-11-24 21:56:57,221 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-24 21:56:57,237 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;@2e659a4b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 21:56:57,237 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-11-24 21:56:57,241 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-24 21:56:57,241 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-24 21:56:57,241 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-24 21:56:57,242 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:56:57,242 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-24 21:56:57,243 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 21:56:57,248 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:56:57,248 INFO L85 PathProgramCache]: Analyzing trace with hash 12771, now seen corresponding path program 1 times [2023-11-24 21:56:57,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:56:57,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933268349] [2023-11-24 21:56:57,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:56:57,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:56:57,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:56:57,654 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:56:57,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:56:57,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933268349] [2023-11-24 21:56:57,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933268349] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:56:57,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:56:57,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:56:57,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486547780] [2023-11-24 21:56:57,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:56:57,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:56:57,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:56:57,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:56:57,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:56:57,744 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 56 [2023-11-24 21:56:57,747 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 53 transitions, 115 flow. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:56:57,747 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:56:57,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 56 [2023-11-24 21:56:57,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:56:58,523 INFO L124 PetriNetUnfolderBase]: 1057/2063 cut-off events. [2023-11-24 21:56:58,524 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-11-24 21:56:58,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3689 conditions, 2063 events. 1057/2063 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 14427 event pairs, 791 based on Foata normal form. 120/1972 useless extension candidates. Maximal degree in co-relation 3675. Up to 1193 conditions per place. [2023-11-24 21:56:58,555 INFO L140 encePairwiseOnDemand]: 51/56 looper letters, 30 selfloop transitions, 2 changer transitions 0/58 dead transitions. [2023-11-24 21:56:58,555 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 58 transitions, 189 flow [2023-11-24 21:56:58,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:56:58,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:56:58,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2023-11-24 21:56:58,572 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7261904761904762 [2023-11-24 21:56:58,573 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 122 transitions. [2023-11-24 21:56:58,573 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 122 transitions. [2023-11-24 21:56:58,575 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:56:58,578 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 122 transitions. [2023-11-24 21:56:58,582 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states 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:56:58,588 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 0 states have call successors, (0), 0 states 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:56:58,588 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 0 states have call successors, (0), 0 states 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:56:58,590 INFO L175 Difference]: Start difference. First operand has 61 places, 53 transitions, 115 flow. Second operand 3 states and 122 transitions. [2023-11-24 21:56:58,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 58 transitions, 189 flow [2023-11-24 21:56:58,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 58 transitions, 186 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-24 21:56:58,605 INFO L231 Difference]: Finished difference. Result has 58 places, 49 transitions, 108 flow [2023-11-24 21:56:58,608 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=56, 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=108, PETRI_PLACES=58, PETRI_TRANSITIONS=49} [2023-11-24 21:56:58,612 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, -3 predicate places. [2023-11-24 21:56:58,613 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 49 transitions, 108 flow [2023-11-24 21:56:58,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:56:58,613 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:56:58,613 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-24 21:56:58,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-24 21:56:58,614 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 21:56:58,615 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:56:58,616 INFO L85 PathProgramCache]: Analyzing trace with hash 12772, now seen corresponding path program 1 times [2023-11-24 21:56:58,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:56:58,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389451729] [2023-11-24 21:56:58,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:56:58,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:56:58,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:56:58,759 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:56:58,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:56:58,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389451729] [2023-11-24 21:56:58,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389451729] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:56:58,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:56:58,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:56:58,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631116328] [2023-11-24 21:56:58,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:56:58,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:56:58,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:56:58,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:56:58,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:56:58,778 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 56 [2023-11-24 21:56:58,778 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 49 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states 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:56:58,778 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:56:58,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 56 [2023-11-24 21:56:58,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:56:59,216 INFO L124 PetriNetUnfolderBase]: 1057/2062 cut-off events. [2023-11-24 21:56:59,216 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2023-11-24 21:56:59,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3746 conditions, 2062 events. 1057/2062 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 14398 event pairs, 791 based on Foata normal form. 1/1852 useless extension candidates. Maximal degree in co-relation 3735. Up to 1192 conditions per place. [2023-11-24 21:56:59,237 INFO L140 encePairwiseOnDemand]: 53/56 looper letters, 29 selfloop transitions, 2 changer transitions 0/57 dead transitions. [2023-11-24 21:56:59,237 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 57 transitions, 186 flow [2023-11-24 21:56:59,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:56:59,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:56:59,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2023-11-24 21:56:59,243 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7261904761904762 [2023-11-24 21:56:59,244 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 122 transitions. [2023-11-24 21:56:59,244 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 122 transitions. [2023-11-24 21:56:59,244 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:56:59,245 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 122 transitions. [2023-11-24 21:56:59,246 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states 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:56:59,247 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 0 states have call successors, (0), 0 states 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:56:59,247 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 0 states have call successors, (0), 0 states 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:56:59,247 INFO L175 Difference]: Start difference. First operand has 58 places, 49 transitions, 108 flow. Second operand 3 states and 122 transitions. [2023-11-24 21:56:59,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 57 transitions, 186 flow [2023-11-24 21:56:59,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 57 transitions, 182 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:56:59,252 INFO L231 Difference]: Finished difference. Result has 57 places, 48 transitions, 106 flow [2023-11-24 21:56:59,252 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=57, PETRI_TRANSITIONS=48} [2023-11-24 21:56:59,253 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, -4 predicate places. [2023-11-24 21:56:59,253 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 48 transitions, 106 flow [2023-11-24 21:56:59,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states 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:56:59,254 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:56:59,254 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-24 21:56:59,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-24 21:56:59,255 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 21:56:59,255 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:56:59,255 INFO L85 PathProgramCache]: Analyzing trace with hash 380847395, now seen corresponding path program 1 times [2023-11-24 21:56:59,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:56:59,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321630684] [2023-11-24 21:56:59,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:56:59,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:56:59,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:56:59,443 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:56:59,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:56:59,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321630684] [2023-11-24 21:56:59,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321630684] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:56:59,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:56:59,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:56:59,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283744886] [2023-11-24 21:56:59,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:56:59,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:56:59,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:56:59,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:56:59,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:56:59,447 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 56 [2023-11-24 21:56:59,447 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 48 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states 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:56:59,447 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:56:59,447 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 56 [2023-11-24 21:56:59,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:56:59,786 INFO L124 PetriNetUnfolderBase]: 825/1468 cut-off events. [2023-11-24 21:56:59,787 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2023-11-24 21:56:59,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2796 conditions, 1468 events. 825/1468 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 8966 event pairs, 457 based on Foata normal form. 0/1442 useless extension candidates. Maximal degree in co-relation 2785. Up to 1009 conditions per place. [2023-11-24 21:56:59,801 INFO L140 encePairwiseOnDemand]: 53/56 looper letters, 33 selfloop transitions, 2 changer transitions 2/63 dead transitions. [2023-11-24 21:56:59,802 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 63 transitions, 216 flow [2023-11-24 21:56:59,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:56:59,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:56:59,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 131 transitions. [2023-11-24 21:56:59,809 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7797619047619048 [2023-11-24 21:56:59,809 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 131 transitions. [2023-11-24 21:56:59,810 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 131 transitions. [2023-11-24 21:56:59,810 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:56:59,810 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 131 transitions. [2023-11-24 21:56:59,813 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states 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:56:59,815 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 0 states have call successors, (0), 0 states 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:56:59,816 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 0 states have call successors, (0), 0 states 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:56:59,816 INFO L175 Difference]: Start difference. First operand has 57 places, 48 transitions, 106 flow. Second operand 3 states and 131 transitions. [2023-11-24 21:56:59,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 63 transitions, 216 flow [2023-11-24 21:56:59,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 63 transitions, 210 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:56:59,820 INFO L231 Difference]: Finished difference. Result has 56 places, 46 transitions, 102 flow [2023-11-24 21:56:59,820 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=56, PETRI_TRANSITIONS=46} [2023-11-24 21:56:59,821 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, -5 predicate places. [2023-11-24 21:56:59,821 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 46 transitions, 102 flow [2023-11-24 21:56:59,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states 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:56:59,822 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:56:59,822 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-24 21:56:59,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-24 21:56:59,822 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 21:56:59,823 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:56:59,823 INFO L85 PathProgramCache]: Analyzing trace with hash 380845985, now seen corresponding path program 1 times [2023-11-24 21:56:59,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:56:59,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188529664] [2023-11-24 21:56:59,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:56:59,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:56:59,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:56:59,897 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:56:59,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:56:59,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188529664] [2023-11-24 21:56:59,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188529664] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:56:59,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:56:59,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:56:59,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327209541] [2023-11-24 21:56:59,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:56:59,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:56:59,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:56:59,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:56:59,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:56:59,916 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 56 [2023-11-24 21:56:59,916 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 46 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states 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:56:59,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:56:59,917 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 56 [2023-11-24 21:56:59,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:57:00,233 INFO L124 PetriNetUnfolderBase]: 724/1477 cut-off events. [2023-11-24 21:57:00,234 INFO L125 PetriNetUnfolderBase]: For 93/93 co-relation queries the response was YES. [2023-11-24 21:57:00,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2705 conditions, 1477 events. 724/1477 cut-off events. For 93/93 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 9996 event pairs, 416 based on Foata normal form. 0/1401 useless extension candidates. Maximal degree in co-relation 2694. Up to 940 conditions per place. [2023-11-24 21:57:00,248 INFO L140 encePairwiseOnDemand]: 53/56 looper letters, 27 selfloop transitions, 2 changer transitions 0/53 dead transitions. [2023-11-24 21:57:00,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 53 transitions, 176 flow [2023-11-24 21:57:00,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:57:00,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:57:00,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2023-11-24 21:57:00,250 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6964285714285714 [2023-11-24 21:57:00,251 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 117 transitions. [2023-11-24 21:57:00,251 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 117 transitions. [2023-11-24 21:57:00,251 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:57:00,251 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 117 transitions. [2023-11-24 21:57:00,252 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states 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:57:00,253 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 0 states have call successors, (0), 0 states 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:57:00,253 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 0 states have call successors, (0), 0 states 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:57:00,253 INFO L175 Difference]: Start difference. First operand has 56 places, 46 transitions, 102 flow. Second operand 3 states and 117 transitions. [2023-11-24 21:57:00,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 53 transitions, 176 flow [2023-11-24 21:57:00,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 53 transitions, 170 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:57:00,256 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 100 flow [2023-11-24 21:57:00,256 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=54, PETRI_TRANSITIONS=45} [2023-11-24 21:57:00,257 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, -7 predicate places. [2023-11-24 21:57:00,257 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 45 transitions, 100 flow [2023-11-24 21:57:00,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states 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:57:00,258 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:57:00,258 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-24 21:57:00,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-24 21:57:00,259 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 21:57:00,259 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:57:00,259 INFO L85 PathProgramCache]: Analyzing trace with hash 380845986, now seen corresponding path program 1 times [2023-11-24 21:57:00,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:57:00,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056701980] [2023-11-24 21:57:00,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:57:00,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:57:00,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:57:00,324 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:57:00,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:57:00,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056701980] [2023-11-24 21:57:00,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056701980] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:57:00,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:57:00,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:57:00,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844514290] [2023-11-24 21:57:00,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:57:00,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:57:00,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:57:00,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:57:00,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:57:00,341 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 56 [2023-11-24 21:57:00,342 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states 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:57:00,342 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:57:00,342 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 56 [2023-11-24 21:57:00,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:57:00,623 INFO L124 PetriNetUnfolderBase]: 721/1470 cut-off events. [2023-11-24 21:57:00,623 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2023-11-24 21:57:00,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2649 conditions, 1470 events. 721/1470 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 9952 event pairs, 416 based on Foata normal form. 4/1398 useless extension candidates. Maximal degree in co-relation 2639. Up to 933 conditions per place. [2023-11-24 21:57:00,637 INFO L140 encePairwiseOnDemand]: 53/56 looper letters, 26 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2023-11-24 21:57:00,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 52 transitions, 170 flow [2023-11-24 21:57:00,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:57:00,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:57:00,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2023-11-24 21:57:00,639 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7083333333333334 [2023-11-24 21:57:00,639 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 119 transitions. [2023-11-24 21:57:00,639 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 119 transitions. [2023-11-24 21:57:00,640 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:57:00,640 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 119 transitions. [2023-11-24 21:57:00,641 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:57:00,642 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 0 states have call successors, (0), 0 states 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:57:00,642 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 0 states have call successors, (0), 0 states 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:57:00,642 INFO L175 Difference]: Start difference. First operand has 54 places, 45 transitions, 100 flow. Second operand 3 states and 119 transitions. [2023-11-24 21:57:00,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 52 transitions, 170 flow [2023-11-24 21:57:00,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 52 transitions, 166 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:57:00,645 INFO L231 Difference]: Finished difference. Result has 53 places, 44 transitions, 98 flow [2023-11-24 21:57:00,646 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=53, PETRI_TRANSITIONS=44} [2023-11-24 21:57:00,648 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, -8 predicate places. [2023-11-24 21:57:00,648 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 44 transitions, 98 flow [2023-11-24 21:57:00,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states 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:57:00,649 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:57:00,649 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:57:00,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-24 21:57:00,650 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 21:57:00,651 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:57:00,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1520468079, now seen corresponding path program 1 times [2023-11-24 21:57:00,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:57:00,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320493285] [2023-11-24 21:57:00,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:57:00,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:57:00,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:57:00,716 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:57:00,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:57:00,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320493285] [2023-11-24 21:57:00,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320493285] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:57:00,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:57:00,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:57:00,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631202369] [2023-11-24 21:57:00,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:57:00,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:57:00,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:57:00,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:57:00,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:57:00,735 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 56 [2023-11-24 21:57:00,735 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 44 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states 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:57:00,736 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:57:00,736 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 56 [2023-11-24 21:57:00,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:57:01,057 INFO L124 PetriNetUnfolderBase]: 738/1475 cut-off events. [2023-11-24 21:57:01,058 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2023-11-24 21:57:01,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2683 conditions, 1475 events. 738/1475 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 9880 event pairs, 260 based on Foata normal form. 0/1425 useless extension candidates. Maximal degree in co-relation 2673. Up to 934 conditions per place. [2023-11-24 21:57:01,072 INFO L140 encePairwiseOnDemand]: 53/56 looper letters, 27 selfloop transitions, 2 changer transitions 0/51 dead transitions. [2023-11-24 21:57:01,072 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 51 transitions, 170 flow [2023-11-24 21:57:01,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:57:01,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:57:01,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2023-11-24 21:57:01,074 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6964285714285714 [2023-11-24 21:57:01,074 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 117 transitions. [2023-11-24 21:57:01,074 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 117 transitions. [2023-11-24 21:57:01,074 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:57:01,075 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 117 transitions. [2023-11-24 21:57:01,075 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states 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:57:01,076 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 0 states have call successors, (0), 0 states 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:57:01,076 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 0 states have call successors, (0), 0 states 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:57:01,077 INFO L175 Difference]: Start difference. First operand has 53 places, 44 transitions, 98 flow. Second operand 3 states and 117 transitions. [2023-11-24 21:57:01,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 51 transitions, 170 flow [2023-11-24 21:57:01,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 51 transitions, 166 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:57:01,081 INFO L231 Difference]: Finished difference. Result has 52 places, 43 transitions, 96 flow [2023-11-24 21:57:01,081 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=52, PETRI_TRANSITIONS=43} [2023-11-24 21:57:01,085 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, -9 predicate places. [2023-11-24 21:57:01,085 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 43 transitions, 96 flow [2023-11-24 21:57:01,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states 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:57:01,086 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:57:01,086 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:57:01,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-24 21:57:01,086 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 21:57:01,087 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:57:01,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1520468078, now seen corresponding path program 1 times [2023-11-24 21:57:01,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:57:01,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260301102] [2023-11-24 21:57:01,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:57:01,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:57:01,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:57:01,212 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:57:01,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:57:01,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260301102] [2023-11-24 21:57:01,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260301102] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:57:01,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:57:01,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:57:01,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604110080] [2023-11-24 21:57:01,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:57:01,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:57:01,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:57:01,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:57:01,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:57:01,238 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 56 [2023-11-24 21:57:01,238 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 43 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states 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:57:01,239 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:57:01,239 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 56 [2023-11-24 21:57:01,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:57:01,532 INFO L124 PetriNetUnfolderBase]: 721/1446 cut-off events. [2023-11-24 21:57:01,532 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2023-11-24 21:57:01,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2633 conditions, 1446 events. 721/1446 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 9704 event pairs, 260 based on Foata normal form. 12/1412 useless extension candidates. Maximal degree in co-relation 2623. Up to 905 conditions per place. [2023-11-24 21:57:01,547 INFO L140 encePairwiseOnDemand]: 53/56 looper letters, 26 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2023-11-24 21:57:01,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 50 transitions, 166 flow [2023-11-24 21:57:01,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:57:01,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:57:01,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2023-11-24 21:57:01,550 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7083333333333334 [2023-11-24 21:57:01,550 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 119 transitions. [2023-11-24 21:57:01,550 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 119 transitions. [2023-11-24 21:57:01,551 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:57:01,553 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 119 transitions. [2023-11-24 21:57:01,555 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:57:01,556 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 0 states have call successors, (0), 0 states 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:57:01,557 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 0 states have call successors, (0), 0 states 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:57:01,558 INFO L175 Difference]: Start difference. First operand has 52 places, 43 transitions, 96 flow. Second operand 3 states and 119 transitions. [2023-11-24 21:57:01,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 50 transitions, 166 flow [2023-11-24 21:57:01,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 50 transitions, 162 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:57:01,561 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 94 flow [2023-11-24 21:57:01,561 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2023-11-24 21:57:01,563 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, -10 predicate places. [2023-11-24 21:57:01,564 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 42 transitions, 94 flow [2023-11-24 21:57:01,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states 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:57:01,565 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:57:01,565 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:57:01,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-24 21:57:01,566 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 21:57:01,567 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:57:01,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1989728837, now seen corresponding path program 1 times [2023-11-24 21:57:01,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:57:01,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597007558] [2023-11-24 21:57:01,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:57:01,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:57:01,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:57:02,237 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:57:02,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:57:02,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597007558] [2023-11-24 21:57:02,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597007558] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:57:02,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:57:02,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-24 21:57:02,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843702983] [2023-11-24 21:57:02,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:57:02,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-24 21:57:02,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:57:02,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-24 21:57:02,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-24 21:57:02,469 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 56 [2023-11-24 21:57:02,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 42 transitions, 94 flow. Second operand has 9 states, 9 states have (on average 28.666666666666668) internal successors, (258), 9 states have internal predecessors, (258), 0 states have call successors, (0), 0 states 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:57:02,469 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:57:02,469 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 56 [2023-11-24 21:57:02,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:57:03,365 INFO L124 PetriNetUnfolderBase]: 1803/3296 cut-off events. [2023-11-24 21:57:03,366 INFO L125 PetriNetUnfolderBase]: For 124/124 co-relation queries the response was YES. [2023-11-24 21:57:03,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6186 conditions, 3296 events. 1803/3296 cut-off events. For 124/124 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 23027 event pairs, 576 based on Foata normal form. 64/3332 useless extension candidates. Maximal degree in co-relation 6175. Up to 1231 conditions per place. [2023-11-24 21:57:03,397 INFO L140 encePairwiseOnDemand]: 50/56 looper letters, 53 selfloop transitions, 5 changer transitions 11/87 dead transitions. [2023-11-24 21:57:03,397 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 87 transitions, 332 flow [2023-11-24 21:57:03,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 21:57:03,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-24 21:57:03,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 259 transitions. [2023-11-24 21:57:03,399 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6607142857142857 [2023-11-24 21:57:03,399 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 259 transitions. [2023-11-24 21:57:03,399 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 259 transitions. [2023-11-24 21:57:03,400 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:57:03,400 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 259 transitions. [2023-11-24 21:57:03,401 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 37.0) internal successors, (259), 7 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:57:03,402 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 56.0) internal successors, (448), 8 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:57:03,403 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 56.0) internal successors, (448), 8 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:57:03,403 INFO L175 Difference]: Start difference. First operand has 51 places, 42 transitions, 94 flow. Second operand 7 states and 259 transitions. [2023-11-24 21:57:03,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 87 transitions, 332 flow [2023-11-24 21:57:03,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 87 transitions, 322 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:57:03,408 INFO L231 Difference]: Finished difference. Result has 59 places, 44 transitions, 118 flow [2023-11-24 21:57:03,408 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=118, PETRI_PLACES=59, PETRI_TRANSITIONS=44} [2023-11-24 21:57:03,410 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, -2 predicate places. [2023-11-24 21:57:03,411 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 44 transitions, 118 flow [2023-11-24 21:57:03,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 28.666666666666668) internal successors, (258), 9 states have internal predecessors, (258), 0 states have call successors, (0), 0 states 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:57:03,411 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:57:03,411 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:57:03,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-24 21:57:03,412 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 21:57:03,412 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:57:03,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1989730121, now seen corresponding path program 1 times [2023-11-24 21:57:03,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:57:03,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305927239] [2023-11-24 21:57:03,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:57:03,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:57:03,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:57:03,704 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:57:03,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:57:03,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305927239] [2023-11-24 21:57:03,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305927239] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:57:03,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:57:03,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 21:57:03,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13209777] [2023-11-24 21:57:03,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:57:03,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 21:57:03,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:57:03,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 21:57:03,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-24 21:57:03,723 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 56 [2023-11-24 21:57:03,724 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 44 transitions, 118 flow. Second operand has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:57:03,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:57:03,724 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 56 [2023-11-24 21:57:03,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:57:06,647 INFO L124 PetriNetUnfolderBase]: 9945/16168 cut-off events. [2023-11-24 21:57:06,647 INFO L125 PetriNetUnfolderBase]: For 1816/1816 co-relation queries the response was YES. [2023-11-24 21:57:06,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32604 conditions, 16168 events. 9945/16168 cut-off events. For 1816/1816 co-relation queries the response was YES. Maximal size of possible extension queue 804. Compared 123571 event pairs, 2815 based on Foata normal form. 0/15722 useless extension candidates. Maximal degree in co-relation 32589. Up to 6614 conditions per place. [2023-11-24 21:57:06,759 INFO L140 encePairwiseOnDemand]: 44/56 looper letters, 89 selfloop transitions, 27 changer transitions 20/151 dead transitions. [2023-11-24 21:57:06,759 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 151 transitions, 655 flow [2023-11-24 21:57:06,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-24 21:57:06,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-24 21:57:06,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 350 transitions. [2023-11-24 21:57:06,762 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6944444444444444 [2023-11-24 21:57:06,762 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 350 transitions. [2023-11-24 21:57:06,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 350 transitions. [2023-11-24 21:57:06,763 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:57:06,763 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 350 transitions. [2023-11-24 21:57:06,764 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 38.888888888888886) internal successors, (350), 9 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:57:06,766 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 56.0) internal successors, (560), 10 states have internal predecessors, (560), 0 states have call successors, (0), 0 states 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:57:06,766 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 56.0) internal successors, (560), 10 states have internal predecessors, (560), 0 states have call successors, (0), 0 states 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:57:06,767 INFO L175 Difference]: Start difference. First operand has 59 places, 44 transitions, 118 flow. Second operand 9 states and 350 transitions. [2023-11-24 21:57:06,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 151 transitions, 655 flow [2023-11-24 21:57:06,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 151 transitions, 648 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-11-24 21:57:06,788 INFO L231 Difference]: Finished difference. Result has 70 places, 69 transitions, 340 flow [2023-11-24 21:57:06,788 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=340, PETRI_PLACES=70, PETRI_TRANSITIONS=69} [2023-11-24 21:57:06,789 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 9 predicate places. [2023-11-24 21:57:06,789 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 69 transitions, 340 flow [2023-11-24 21:57:06,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:57:06,790 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:57:06,790 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:57:06,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-24 21:57:06,790 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 21:57:06,791 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:57:06,791 INFO L85 PathProgramCache]: Analyzing trace with hash -592651530, now seen corresponding path program 1 times [2023-11-24 21:57:06,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:57:06,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729432282] [2023-11-24 21:57:06,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:57:06,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:57:06,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:57:07,041 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:57:07,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:57:07,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729432282] [2023-11-24 21:57:07,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729432282] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:57:07,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:57:07,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 21:57:07,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555504870] [2023-11-24 21:57:07,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:57:07,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 21:57:07,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:57:07,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 21:57:07,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-24 21:57:07,065 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 56 [2023-11-24 21:57:07,066 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 69 transitions, 340 flow. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:57:07,066 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:57:07,066 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 56 [2023-11-24 21:57:07,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:57:10,147 INFO L124 PetriNetUnfolderBase]: 10393/16870 cut-off events. [2023-11-24 21:57:10,147 INFO L125 PetriNetUnfolderBase]: For 25849/25971 co-relation queries the response was YES. [2023-11-24 21:57:10,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51269 conditions, 16870 events. 10393/16870 cut-off events. For 25849/25971 co-relation queries the response was YES. Maximal size of possible extension queue 850. Compared 130599 event pairs, 1957 based on Foata normal form. 235/17081 useless extension candidates. Maximal degree in co-relation 51248. Up to 5437 conditions per place. [2023-11-24 21:57:10,293 INFO L140 encePairwiseOnDemand]: 45/56 looper letters, 100 selfloop transitions, 28 changer transitions 61/204 dead transitions. [2023-11-24 21:57:10,293 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 204 transitions, 1339 flow [2023-11-24 21:57:10,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-24 21:57:10,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-11-24 21:57:10,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 439 transitions. [2023-11-24 21:57:10,303 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6532738095238095 [2023-11-24 21:57:10,303 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 439 transitions. [2023-11-24 21:57:10,303 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 439 transitions. [2023-11-24 21:57:10,304 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:57:10,304 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 439 transitions. [2023-11-24 21:57:10,306 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 36.583333333333336) internal successors, (439), 12 states have internal predecessors, (439), 0 states have call successors, (0), 0 states 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:57:10,308 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 56.0) internal successors, (728), 13 states have internal predecessors, (728), 0 states have call successors, (0), 0 states 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:57:10,310 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 56.0) internal successors, (728), 13 states have internal predecessors, (728), 0 states have call successors, (0), 0 states 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:57:10,310 INFO L175 Difference]: Start difference. First operand has 70 places, 69 transitions, 340 flow. Second operand 12 states and 439 transitions. [2023-11-24 21:57:10,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 204 transitions, 1339 flow [2023-11-24 21:57:10,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 204 transitions, 1339 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-24 21:57:10,710 INFO L231 Difference]: Finished difference. Result has 90 places, 72 transitions, 490 flow [2023-11-24 21:57:10,711 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=490, PETRI_PLACES=90, PETRI_TRANSITIONS=72} [2023-11-24 21:57:10,712 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 29 predicate places. [2023-11-24 21:57:10,713 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 72 transitions, 490 flow [2023-11-24 21:57:10,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:57:10,713 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:57:10,713 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:57:10,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-24 21:57:10,714 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 21:57:10,714 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:57:10,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1915460777, now seen corresponding path program 1 times [2023-11-24 21:57:10,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:57:10,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799993539] [2023-11-24 21:57:10,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:57:10,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:57:10,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:57:10,949 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:57:10,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:57:10,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799993539] [2023-11-24 21:57:10,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799993539] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:57:10,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:57:10,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 21:57:10,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183968324] [2023-11-24 21:57:10,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:57:10,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 21:57:10,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:57:10,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 21:57:10,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-24 21:57:10,957 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 56 [2023-11-24 21:57:10,957 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 72 transitions, 490 flow. Second operand has 5 states, 5 states have (on average 30.4) internal successors, (152), 5 states have internal predecessors, (152), 0 states have call successors, (0), 0 states 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:57:10,958 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:57:10,958 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 56 [2023-11-24 21:57:10,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:57:13,948 INFO L124 PetriNetUnfolderBase]: 8946/15230 cut-off events. [2023-11-24 21:57:13,949 INFO L125 PetriNetUnfolderBase]: For 33976/34744 co-relation queries the response was YES. [2023-11-24 21:57:14,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49750 conditions, 15230 events. 8946/15230 cut-off events. For 33976/34744 co-relation queries the response was YES. Maximal size of possible extension queue 921. Compared 124832 event pairs, 2031 based on Foata normal form. 503/15531 useless extension candidates. Maximal degree in co-relation 49718. Up to 6764 conditions per place. [2023-11-24 21:57:14,233 INFO L140 encePairwiseOnDemand]: 49/56 looper letters, 80 selfloop transitions, 32 changer transitions 0/142 dead transitions. [2023-11-24 21:57:14,233 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 142 transitions, 1107 flow [2023-11-24 21:57:14,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-24 21:57:14,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-24 21:57:14,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 300 transitions. [2023-11-24 21:57:14,235 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6696428571428571 [2023-11-24 21:57:14,236 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 300 transitions. [2023-11-24 21:57:14,236 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 300 transitions. [2023-11-24 21:57:14,236 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:57:14,237 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 300 transitions. [2023-11-24 21:57:14,238 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 37.5) internal successors, (300), 8 states have internal predecessors, (300), 0 states have call successors, (0), 0 states 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:57:14,239 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 56.0) internal successors, (504), 9 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:57:14,240 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 56.0) internal successors, (504), 9 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:57:14,240 INFO L175 Difference]: Start difference. First operand has 90 places, 72 transitions, 490 flow. Second operand 8 states and 300 transitions. [2023-11-24 21:57:14,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 142 transitions, 1107 flow [2023-11-24 21:57:14,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 142 transitions, 984 flow, removed 19 selfloop flow, removed 12 redundant places. [2023-11-24 21:57:14,872 INFO L231 Difference]: Finished difference. Result has 88 places, 93 transitions, 732 flow [2023-11-24 21:57:14,873 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=423, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=732, PETRI_PLACES=88, PETRI_TRANSITIONS=93} [2023-11-24 21:57:14,873 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 27 predicate places. [2023-11-24 21:57:14,874 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 93 transitions, 732 flow [2023-11-24 21:57:14,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.4) internal successors, (152), 5 states have internal predecessors, (152), 0 states have call successors, (0), 0 states 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:57:14,874 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:57:14,874 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:57:14,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-24 21:57:14,875 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 21:57:14,875 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:57:14,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1251808185, now seen corresponding path program 1 times [2023-11-24 21:57:14,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:57:14,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146079934] [2023-11-24 21:57:14,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:57:14,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:57:14,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:57:15,346 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:57:15,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:57:15,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146079934] [2023-11-24 21:57:15,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146079934] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:57:15,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:57:15,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-24 21:57:15,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93717467] [2023-11-24 21:57:15,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:57:15,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-24 21:57:15,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:57:15,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-24 21:57:15,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-24 21:57:15,608 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 56 [2023-11-24 21:57:15,609 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 93 transitions, 732 flow. Second operand has 9 states, 9 states have (on average 28.666666666666668) internal successors, (258), 9 states have internal predecessors, (258), 0 states have call successors, (0), 0 states 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:57:15,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:57:15,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 56 [2023-11-24 21:57:15,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:57:18,082 INFO L124 PetriNetUnfolderBase]: 6925/12558 cut-off events. [2023-11-24 21:57:18,082 INFO L125 PetriNetUnfolderBase]: For 35986/37023 co-relation queries the response was YES. [2023-11-24 21:57:18,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42128 conditions, 12558 events. 6925/12558 cut-off events. For 35986/37023 co-relation queries the response was YES. Maximal size of possible extension queue 797. Compared 107699 event pairs, 1631 based on Foata normal form. 695/12871 useless extension candidates. Maximal degree in co-relation 42094. Up to 7651 conditions per place. [2023-11-24 21:57:18,199 INFO L140 encePairwiseOnDemand]: 50/56 looper letters, 45 selfloop transitions, 9 changer transitions 33/121 dead transitions. [2023-11-24 21:57:18,200 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 121 transitions, 1007 flow [2023-11-24 21:57:18,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 21:57:18,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-24 21:57:18,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 240 transitions. [2023-11-24 21:57:18,202 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6122448979591837 [2023-11-24 21:57:18,202 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 240 transitions. [2023-11-24 21:57:18,203 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 240 transitions. [2023-11-24 21:57:18,203 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:57:18,203 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 240 transitions. [2023-11-24 21:57:18,204 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 34.285714285714285) internal successors, (240), 7 states have internal predecessors, (240), 0 states have call successors, (0), 0 states 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:57:18,206 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 56.0) internal successors, (448), 8 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:57:18,206 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 56.0) internal successors, (448), 8 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:57:18,207 INFO L175 Difference]: Start difference. First operand has 88 places, 93 transitions, 732 flow. Second operand 7 states and 240 transitions. [2023-11-24 21:57:18,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 121 transitions, 1007 flow [2023-11-24 21:57:18,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 121 transitions, 1001 flow, removed 3 selfloop flow, removed 0 redundant places. [2023-11-24 21:57:18,495 INFO L231 Difference]: Finished difference. Result has 93 places, 65 transitions, 449 flow [2023-11-24 21:57:18,496 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=724, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=449, PETRI_PLACES=93, PETRI_TRANSITIONS=65} [2023-11-24 21:57:18,497 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 32 predicate places. [2023-11-24 21:57:18,497 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 65 transitions, 449 flow [2023-11-24 21:57:18,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 28.666666666666668) internal successors, (258), 9 states have internal predecessors, (258), 0 states have call successors, (0), 0 states 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:57:18,497 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:57:18,498 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:57:18,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-24 21:57:18,498 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 21:57:18,498 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:57:18,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1951197042, now seen corresponding path program 1 times [2023-11-24 21:57:18,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:57:18,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295877760] [2023-11-24 21:57:18,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:57:18,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:57:18,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:57:18,662 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:57:18,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:57:18,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295877760] [2023-11-24 21:57:18,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295877760] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:57:18,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:57:18,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-24 21:57:18,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757775713] [2023-11-24 21:57:18,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:57:18,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-24 21:57:18,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:57:18,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-24 21:57:18,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-24 21:57:18,679 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 56 [2023-11-24 21:57:18,679 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 65 transitions, 449 flow. Second operand has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 0 states have call successors, (0), 0 states 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:57:18,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:57:18,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 56 [2023-11-24 21:57:18,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:57:20,979 INFO L124 PetriNetUnfolderBase]: 8011/14067 cut-off events. [2023-11-24 21:57:20,980 INFO L125 PetriNetUnfolderBase]: For 21351/22446 co-relation queries the response was YES. [2023-11-24 21:57:21,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39742 conditions, 14067 events. 8011/14067 cut-off events. For 21351/22446 co-relation queries the response was YES. Maximal size of possible extension queue 592. Compared 110885 event pairs, 1336 based on Foata normal form. 713/14450 useless extension candidates. Maximal degree in co-relation 39707. Up to 7303 conditions per place. [2023-11-24 21:57:21,097 INFO L140 encePairwiseOnDemand]: 50/56 looper letters, 54 selfloop transitions, 5 changer transitions 3/95 dead transitions. [2023-11-24 21:57:21,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 95 transitions, 698 flow [2023-11-24 21:57:21,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 21:57:21,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-24 21:57:21,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions. [2023-11-24 21:57:21,099 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7098214285714286 [2023-11-24 21:57:21,099 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 159 transitions. [2023-11-24 21:57:21,099 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 159 transitions. [2023-11-24 21:57:21,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:57:21,099 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 159 transitions. [2023-11-24 21:57:21,100 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 39.75) internal successors, (159), 4 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:57:21,101 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 56.0) internal successors, (280), 5 states have internal predecessors, (280), 0 states have call successors, (0), 0 states 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:57:21,101 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 56.0) internal successors, (280), 5 states have internal predecessors, (280), 0 states have call successors, (0), 0 states 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:57:21,102 INFO L175 Difference]: Start difference. First operand has 93 places, 65 transitions, 449 flow. Second operand 4 states and 159 transitions. [2023-11-24 21:57:21,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 95 transitions, 698 flow [2023-11-24 21:57:21,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 95 transitions, 643 flow, removed 3 selfloop flow, removed 9 redundant places. [2023-11-24 21:57:21,369 INFO L231 Difference]: Finished difference. Result has 85 places, 66 transitions, 415 flow [2023-11-24 21:57:21,369 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=404, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=415, PETRI_PLACES=85, PETRI_TRANSITIONS=66} [2023-11-24 21:57:21,370 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 24 predicate places. [2023-11-24 21:57:21,370 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 66 transitions, 415 flow [2023-11-24 21:57:21,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 0 states have call successors, (0), 0 states 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:57:21,370 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:57:21,370 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] [2023-11-24 21:57:21,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-24 21:57:21,371 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 21:57:21,371 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:57:21,371 INFO L85 PathProgramCache]: Analyzing trace with hash 760927909, now seen corresponding path program 1 times [2023-11-24 21:57:21,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:57:21,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204853188] [2023-11-24 21:57:21,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:57:21,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:57:21,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:57:21,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:57:21,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:57:21,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204853188] [2023-11-24 21:57:21,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204853188] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:57:21,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:57:21,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 21:57:21,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012470321] [2023-11-24 21:57:21,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:57:21,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 21:57:21,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:57:21,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 21:57:21,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-24 21:57:21,793 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 56 [2023-11-24 21:57:21,794 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 66 transitions, 415 flow. Second operand has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 0 states have call successors, (0), 0 states 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:57:21,794 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:57:21,794 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 56 [2023-11-24 21:57:21,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:57:23,231 INFO L124 PetriNetUnfolderBase]: 5297/9284 cut-off events. [2023-11-24 21:57:23,231 INFO L125 PetriNetUnfolderBase]: For 10079/10398 co-relation queries the response was YES. [2023-11-24 21:57:23,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26708 conditions, 9284 events. 5297/9284 cut-off events. For 10079/10398 co-relation queries the response was YES. Maximal size of possible extension queue 381. Compared 66910 event pairs, 818 based on Foata normal form. 501/9525 useless extension candidates. Maximal degree in co-relation 26674. Up to 2678 conditions per place. [2023-11-24 21:57:23,288 INFO L140 encePairwiseOnDemand]: 50/56 looper letters, 64 selfloop transitions, 8 changer transitions 1/105 dead transitions. [2023-11-24 21:57:23,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 105 transitions, 717 flow [2023-11-24 21:57:23,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 21:57:23,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-24 21:57:23,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 201 transitions. [2023-11-24 21:57:23,290 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7178571428571429 [2023-11-24 21:57:23,290 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 201 transitions. [2023-11-24 21:57:23,290 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 201 transitions. [2023-11-24 21:57:23,290 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:57:23,290 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 201 transitions. [2023-11-24 21:57:23,291 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 40.2) internal successors, (201), 5 states have internal predecessors, (201), 0 states have call successors, (0), 0 states 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:57:23,292 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 56.0) internal successors, (336), 6 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:57:23,292 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 56.0) internal successors, (336), 6 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:57:23,292 INFO L175 Difference]: Start difference. First operand has 85 places, 66 transitions, 415 flow. Second operand 5 states and 201 transitions. [2023-11-24 21:57:23,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 105 transitions, 717 flow [2023-11-24 21:57:23,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 105 transitions, 694 flow, removed 4 selfloop flow, removed 6 redundant places. [2023-11-24 21:57:23,325 INFO L231 Difference]: Finished difference. Result has 84 places, 67 transitions, 428 flow [2023-11-24 21:57:23,325 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=385, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=428, PETRI_PLACES=84, PETRI_TRANSITIONS=67} [2023-11-24 21:57:23,326 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 23 predicate places. [2023-11-24 21:57:23,326 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 67 transitions, 428 flow [2023-11-24 21:57:23,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 0 states have call successors, (0), 0 states 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:57:23,326 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:57:23,326 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:57:23,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-24 21:57:23,327 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 21:57:23,327 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:57:23,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1910445231, now seen corresponding path program 1 times [2023-11-24 21:57:23,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:57:23,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112555997] [2023-11-24 21:57:23,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:57:23,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:57:23,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:57:23,640 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:57:23,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:57:23,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112555997] [2023-11-24 21:57:23,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112555997] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:57:23,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:57:23,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 21:57:23,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612272766] [2023-11-24 21:57:23,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:57:23,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 21:57:23,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:57:23,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 21:57:23,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-24 21:57:23,648 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 56 [2023-11-24 21:57:23,650 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 67 transitions, 428 flow. Second operand has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 6 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:57:23,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:57:23,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 56 [2023-11-24 21:57:23,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:57:25,074 INFO L124 PetriNetUnfolderBase]: 4153/7044 cut-off events. [2023-11-24 21:57:25,074 INFO L125 PetriNetUnfolderBase]: For 11644/11907 co-relation queries the response was YES. [2023-11-24 21:57:25,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22218 conditions, 7044 events. 4153/7044 cut-off events. For 11644/11907 co-relation queries the response was YES. Maximal size of possible extension queue 365. Compared 48051 event pairs, 762 based on Foata normal form. 227/7015 useless extension candidates. Maximal degree in co-relation 22185. Up to 2678 conditions per place. [2023-11-24 21:57:25,119 INFO L140 encePairwiseOnDemand]: 50/56 looper letters, 55 selfloop transitions, 11 changer transitions 3/95 dead transitions. [2023-11-24 21:57:25,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 95 transitions, 646 flow [2023-11-24 21:57:25,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 21:57:25,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-24 21:57:25,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 225 transitions. [2023-11-24 21:57:25,121 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6696428571428571 [2023-11-24 21:57:25,121 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 225 transitions. [2023-11-24 21:57:25,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 225 transitions. [2023-11-24 21:57:25,122 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:57:25,122 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 225 transitions. [2023-11-24 21:57:25,123 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 37.5) internal successors, (225), 6 states have internal predecessors, (225), 0 states have call successors, (0), 0 states 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:57:25,124 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 56.0) internal successors, (392), 7 states have internal predecessors, (392), 0 states have call successors, (0), 0 states 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:57:25,124 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 56.0) internal successors, (392), 7 states have internal predecessors, (392), 0 states have call successors, (0), 0 states 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:57:25,125 INFO L175 Difference]: Start difference. First operand has 84 places, 67 transitions, 428 flow. Second operand 6 states and 225 transitions. [2023-11-24 21:57:25,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 95 transitions, 646 flow [2023-11-24 21:57:25,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 95 transitions, 582 flow, removed 19 selfloop flow, removed 8 redundant places. [2023-11-24 21:57:25,143 INFO L231 Difference]: Finished difference. Result has 80 places, 61 transitions, 357 flow [2023-11-24 21:57:25,144 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=357, PETRI_PLACES=80, PETRI_TRANSITIONS=61} [2023-11-24 21:57:25,144 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 19 predicate places. [2023-11-24 21:57:25,145 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 61 transitions, 357 flow [2023-11-24 21:57:25,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 6 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:57:25,145 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:57:25,145 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:57:25,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-24 21:57:25,146 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 21:57:25,146 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:57:25,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1439645114, now seen corresponding path program 1 times [2023-11-24 21:57:25,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:57:25,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172910588] [2023-11-24 21:57:25,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:57:25,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:57:25,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:57:26,933 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:57:26,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:57:26,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172910588] [2023-11-24 21:57:26,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172910588] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:57:26,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:57:26,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-24 21:57:26,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70964271] [2023-11-24 21:57:26,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:57:26,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-24 21:57:26,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:57:26,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-24 21:57:26,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-11-24 21:57:26,966 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 56 [2023-11-24 21:57:26,967 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 61 transitions, 357 flow. Second operand has 9 states, 9 states have (on average 26.444444444444443) internal successors, (238), 9 states have internal predecessors, (238), 0 states have call successors, (0), 0 states 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:57:26,967 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:57:26,967 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 56 [2023-11-24 21:57:26,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:57:28,642 INFO L124 PetriNetUnfolderBase]: 4731/8858 cut-off events. [2023-11-24 21:57:28,643 INFO L125 PetriNetUnfolderBase]: For 20282/21537 co-relation queries the response was YES. [2023-11-24 21:57:28,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27551 conditions, 8858 events. 4731/8858 cut-off events. For 20282/21537 co-relation queries the response was YES. Maximal size of possible extension queue 702. Compared 73791 event pairs, 1093 based on Foata normal form. 136/8293 useless extension candidates. Maximal degree in co-relation 27522. Up to 1828 conditions per place. [2023-11-24 21:57:28,714 INFO L140 encePairwiseOnDemand]: 41/56 looper letters, 77 selfloop transitions, 40 changer transitions 21/161 dead transitions. [2023-11-24 21:57:28,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 161 transitions, 1131 flow [2023-11-24 21:57:28,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-24 21:57:28,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-24 21:57:28,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 381 transitions. [2023-11-24 21:57:28,717 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6185064935064936 [2023-11-24 21:57:28,718 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 381 transitions. [2023-11-24 21:57:28,718 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 381 transitions. [2023-11-24 21:57:28,719 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:57:28,719 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 381 transitions. [2023-11-24 21:57:28,721 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 34.63636363636363) internal successors, (381), 11 states have internal predecessors, (381), 0 states have call successors, (0), 0 states 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:57:28,723 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 56.0) internal successors, (672), 12 states have internal predecessors, (672), 0 states have call successors, (0), 0 states 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:57:28,723 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 56.0) internal successors, (672), 12 states have internal predecessors, (672), 0 states have call successors, (0), 0 states 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:57:28,724 INFO L175 Difference]: Start difference. First operand has 80 places, 61 transitions, 357 flow. Second operand 11 states and 381 transitions. [2023-11-24 21:57:28,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 161 transitions, 1131 flow [2023-11-24 21:57:28,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 161 transitions, 1049 flow, removed 31 selfloop flow, removed 6 redundant places. [2023-11-24 21:57:28,940 INFO L231 Difference]: Finished difference. Result has 88 places, 91 transitions, 675 flow [2023-11-24 21:57:28,940 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=317, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=675, PETRI_PLACES=88, PETRI_TRANSITIONS=91} [2023-11-24 21:57:28,941 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 27 predicate places. [2023-11-24 21:57:28,941 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 91 transitions, 675 flow [2023-11-24 21:57:28,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 26.444444444444443) internal successors, (238), 9 states have internal predecessors, (238), 0 states have call successors, (0), 0 states 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:57:28,942 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:57:28,942 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:57:28,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-24 21:57:28,942 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 21:57:28,943 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:57:28,943 INFO L85 PathProgramCache]: Analyzing trace with hash -428536080, now seen corresponding path program 2 times [2023-11-24 21:57:28,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:57:28,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871980756] [2023-11-24 21:57:28,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:57:28,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:57:28,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:57:29,305 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:57:29,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:57:29,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871980756] [2023-11-24 21:57:29,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871980756] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:57:29,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:57:29,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-24 21:57:29,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067693356] [2023-11-24 21:57:29,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:57:29,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 21:57:29,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:57:29,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 21:57:29,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-24 21:57:29,319 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 56 [2023-11-24 21:57:29,320 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 91 transitions, 675 flow. Second operand has 6 states, 6 states have (on average 30.166666666666668) internal successors, (181), 6 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:57:29,320 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:57:29,320 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 56 [2023-11-24 21:57:29,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:57:30,924 INFO L124 PetriNetUnfolderBase]: 6432/12490 cut-off events. [2023-11-24 21:57:30,924 INFO L125 PetriNetUnfolderBase]: For 26199/28858 co-relation queries the response was YES. [2023-11-24 21:57:31,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39580 conditions, 12490 events. 6432/12490 cut-off events. For 26199/28858 co-relation queries the response was YES. Maximal size of possible extension queue 1137. Compared 116106 event pairs, 1612 based on Foata normal form. 492/11607 useless extension candidates. Maximal degree in co-relation 39547. Up to 4239 conditions per place. [2023-11-24 21:57:31,027 INFO L140 encePairwiseOnDemand]: 51/56 looper letters, 31 selfloop transitions, 1 changer transitions 64/132 dead transitions. [2023-11-24 21:57:31,027 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 132 transitions, 1065 flow [2023-11-24 21:57:31,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 21:57:31,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-24 21:57:31,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 211 transitions. [2023-11-24 21:57:31,029 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6279761904761905 [2023-11-24 21:57:31,029 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 211 transitions. [2023-11-24 21:57:31,029 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 211 transitions. [2023-11-24 21:57:31,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:57:31,030 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 211 transitions. [2023-11-24 21:57:31,031 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 35.166666666666664) internal successors, (211), 6 states have internal predecessors, (211), 0 states have call successors, (0), 0 states 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:57:31,032 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 56.0) internal successors, (392), 7 states have internal predecessors, (392), 0 states have call successors, (0), 0 states 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:57:31,032 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 56.0) internal successors, (392), 7 states have internal predecessors, (392), 0 states have call successors, (0), 0 states 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:57:31,032 INFO L175 Difference]: Start difference. First operand has 88 places, 91 transitions, 675 flow. Second operand 6 states and 211 transitions. [2023-11-24 21:57:31,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 132 transitions, 1065 flow [2023-11-24 21:57:31,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 132 transitions, 995 flow, removed 20 selfloop flow, removed 5 redundant places. [2023-11-24 21:57:31,594 INFO L231 Difference]: Finished difference. Result has 88 places, 63 transitions, 393 flow [2023-11-24 21:57:31,594 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=619, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=393, PETRI_PLACES=88, PETRI_TRANSITIONS=63} [2023-11-24 21:57:31,595 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 27 predicate places. [2023-11-24 21:57:31,595 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 63 transitions, 393 flow [2023-11-24 21:57:31,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 30.166666666666668) internal successors, (181), 6 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:57:31,595 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:57:31,596 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:57:31,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-24 21:57:31,596 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-24 21:57:31,596 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:57:31,596 INFO L85 PathProgramCache]: Analyzing trace with hash 853720208, now seen corresponding path program 3 times [2023-11-24 21:57:31,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:57:31,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72589308] [2023-11-24 21:57:31,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:57:31,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:57:31,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-24 21:57:31,675 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-24 21:57:31,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-24 21:57:31,775 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-24 21:57:31,775 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-24 21:57:31,776 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-11-24 21:57:31,779 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-11-24 21:57:31,779 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-11-24 21:57:31,779 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-11-24 21:57:31,780 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-11-24 21:57:31,780 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-11-24 21:57:31,780 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-11-24 21:57:31,780 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-11-24 21:57:31,781 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-11-24 21:57:31,781 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-11-24 21:57:31,781 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-11-24 21:57:31,781 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-11-24 21:57:31,781 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-11-24 21:57:31,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-24 21:57:31,782 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:57:31,789 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-24 21:57:31,789 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-24 21:57:31,855 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-24 21:57:31,858 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-24 21:57:31,863 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-24 21:57:31,873 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-24 21:57:31,874 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-24 21:57:31,897 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 09:57:31 BasicIcfg [2023-11-24 21:57:31,898 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-24 21:57:31,898 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-24 21:57:31,899 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-24 21:57:31,899 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-24 21:57:31,899 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 09:56:56" (3/4) ... [2023-11-24 21:57:31,901 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-24 21:57:31,902 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-24 21:57:31,903 INFO L158 Benchmark]: Toolchain (without parser) took 36956.04ms. Allocated memory was 130.0MB in the beginning and 8.5GB in the end (delta: 8.4GB). Free memory was 90.5MB in the beginning and 7.2GB in the end (delta: -7.1GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2023-11-24 21:57:31,904 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 102.8MB. Free memory was 77.0MB in the beginning and 76.9MB in the end (delta: 91.5kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-24 21:57:31,904 INFO L158 Benchmark]: CACSL2BoogieTranslator took 746.66ms. Allocated memory is still 130.0MB. Free memory was 90.0MB in the beginning and 66.4MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-24 21:57:31,905 INFO L158 Benchmark]: Boogie Procedure Inliner took 161.35ms. Allocated memory is still 130.0MB. Free memory was 66.4MB in the beginning and 100.3MB in the end (delta: -33.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-24 21:57:31,905 INFO L158 Benchmark]: Boogie Preprocessor took 66.23ms. Allocated memory is still 130.0MB. Free memory was 100.3MB in the beginning and 96.7MB in the end (delta: 3.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-24 21:57:31,905 INFO L158 Benchmark]: RCFGBuilder took 998.80ms. Allocated memory is still 130.0MB. Free memory was 96.7MB in the beginning and 46.3MB in the end (delta: 50.3MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2023-11-24 21:57:31,906 INFO L158 Benchmark]: TraceAbstraction took 34953.85ms. Allocated memory was 130.0MB in the beginning and 8.5GB in the end (delta: 8.4GB). Free memory was 45.7MB in the beginning and 7.2GB in the end (delta: -7.2GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2023-11-24 21:57:31,906 INFO L158 Benchmark]: Witness Printer took 4.33ms. Allocated memory is still 8.5GB. Free memory is still 7.2GB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-24 21:57:31,909 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 102.8MB. Free memory was 77.0MB in the beginning and 76.9MB in the end (delta: 91.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 746.66ms. Allocated memory is still 130.0MB. Free memory was 90.0MB in the beginning and 66.4MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 161.35ms. Allocated memory is still 130.0MB. Free memory was 66.4MB in the beginning and 100.3MB in the end (delta: -33.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.23ms. Allocated memory is still 130.0MB. Free memory was 100.3MB in the beginning and 96.7MB in the end (delta: 3.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 998.80ms. Allocated memory is still 130.0MB. Free memory was 96.7MB in the beginning and 46.3MB in the end (delta: 50.3MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * TraceAbstraction took 34953.85ms. Allocated memory was 130.0MB in the beginning and 8.5GB in the end (delta: 8.4GB). Free memory was 45.7MB in the beginning and 7.2GB in the end (delta: -7.2GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. * Witness Printer took 4.33ms. Allocated memory is still 8.5GB. Free memory is still 7.2GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p1_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L720] 0 _Bool a$flush_delayed; [L721] 0 int a$mem_tmp; [L722] 0 _Bool a$r_buff0_thd0; [L723] 0 _Bool a$r_buff0_thd1; [L724] 0 _Bool a$r_buff0_thd2; [L725] 0 _Bool a$r_buff0_thd3; [L726] 0 _Bool a$r_buff1_thd0; [L727] 0 _Bool a$r_buff1_thd1; [L728] 0 _Bool a$r_buff1_thd2; [L729] 0 _Bool a$r_buff1_thd3; [L730] 0 _Bool a$read_delayed; [L731] 0 int *a$read_delayed_var; [L732] 0 int a$w_buff0; [L733] 0 _Bool a$w_buff0_used; [L734] 0 int a$w_buff1; [L735] 0 _Bool a$w_buff1_used; [L736] 0 _Bool main$tmp_guard0; [L737] 0 _Bool main$tmp_guard1; [L739] 0 int x = 0; [L741] 0 int y = 0; [L743] 0 int z = 0; [L744] 0 _Bool weak$$choice0; [L745] 0 _Bool weak$$choice2; [L848] 0 pthread_t t281; [L849] FCALL, FORK 0 pthread_create(&t281, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t281={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L749] 1 a$w_buff1 = a$w_buff0 [L750] 1 a$w_buff0 = 1 [L751] 1 a$w_buff1_used = a$w_buff0_used [L752] 1 a$w_buff0_used = (_Bool)1 [L753] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L753] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L754] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L755] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L756] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L757] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L758] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L850] 0 pthread_t t282; [L851] FCALL, FORK 0 pthread_create(&t282, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t281={5:0}, t282={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L761] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L778] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L781] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L852] 0 pthread_t t283; [L784] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L787] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L853] FCALL, FORK 0 pthread_create(&t283, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t281={5:0}, t282={6:0}, t283={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L790] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L791] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L792] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L793] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L794] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L804] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L807] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L810] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L811] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L812] 3 a$flush_delayed = weak$$choice2 [L813] 3 a$mem_tmp = a [L814] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L815] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L816] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L817] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L818] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L819] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L820] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] 3 __unbuffered_p2_EBX = a [L822] 3 a = a$flush_delayed ? a$mem_tmp : a [L823] 3 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L826] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L827] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L828] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L829] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L830] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L764] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L765] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L766] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L767] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L768] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L771] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L833] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t281={5:0}, t282={6:0}, t283={3:0}, weak$$choice2=0, x=2, y=1, z=1] [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L860] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L861] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L862] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L863] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t281={5:0}, t282={6:0}, t283={3:0}, weak$$choice2=0, x=2, y=1, z=1] [L866] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t281={5:0}, t282={6:0}, t283={3:0}, weak$$choice2=0, x=2, y=1, z=1] [L868] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L17] 0 __assert_fail ("0", "mix011_power.oepc_pso.oepc_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 846]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 83 locations, 13 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 34.7s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 28.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1036 SdHoareTripleChecker+Valid, 4.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 890 mSDsluCounter, 343 SdHoareTripleChecker+Invalid, 3.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 262 mSDsCounter, 44 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2805 IncrementalHoareTripleChecker+Invalid, 2849 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 44 mSolverCounterUnsat, 81 mSDtfsCounter, 2805 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 95 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=732occurred in iteration=11, InterpolantAutomatonStates: 96, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 327 NumberOfCodeBlocks, 327 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 274 ConstructedInterpolants, 0 QuantifiedInterpolants, 2608 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-24 21:57:31,950 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c4cd8c4-4f20-4e49-9988-5a8403f7bb69/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c4cd8c4-4f20-4e49-9988-5a8403f7bb69/bin/uautomizer-verify-NlZe1sFDwI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c4cd8c4-4f20-4e49-9988-5a8403f7bb69/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_0c4cd8c4-4f20-4e49-9988-5a8403f7bb69/bin/uautomizer-verify-NlZe1sFDwI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c4cd8c4-4f20-4e49-9988-5a8403f7bb69/bin/uautomizer-verify-NlZe1sFDwI/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix011_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c4cd8c4-4f20-4e49-9988-5a8403f7bb69/bin/uautomizer-verify-NlZe1sFDwI/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c4cd8c4-4f20-4e49-9988-5a8403f7bb69/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 833fe1bfba6e9465d0762b8b4b281d00d9e54d53b8918b133a54714c1d863b1b --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-24 21:57:35,170 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-24 21:57:35,336 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c4cd8c4-4f20-4e49-9988-5a8403f7bb69/bin/uautomizer-verify-NlZe1sFDwI/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-24 21:57:35,349 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-24 21:57:35,353 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-24 21:57:35,410 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-24 21:57:35,411 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-24 21:57:35,412 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-24 21:57:35,413 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-24 21:57:35,420 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-24 21:57:35,421 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-24 21:57:35,421 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-24 21:57:35,422 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-24 21:57:35,424 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-24 21:57:35,425 INFO L153 SettingsManager]: * Use SBE=true [2023-11-24 21:57:35,426 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-24 21:57:35,426 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-24 21:57:35,427 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-24 21:57:35,427 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-24 21:57:35,429 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-24 21:57:35,429 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-24 21:57:35,430 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-24 21:57:35,431 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-24 21:57:35,431 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-24 21:57:35,432 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-24 21:57:35,432 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-24 21:57:35,433 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-24 21:57:35,434 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-24 21:57:35,434 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-24 21:57:35,435 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-24 21:57:35,437 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-24 21:57:35,438 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-24 21:57:35,438 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-24 21:57:35,438 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-24 21:57:35,439 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 21:57:35,439 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-24 21:57:35,440 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-24 21:57:35,441 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-24 21:57:35,441 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-24 21:57:35,441 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-24 21:57:35,442 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-24 21:57:35,442 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-24 21:57:35,443 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-24 21:57:35,443 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-24 21:57:35,443 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_0c4cd8c4-4f20-4e49-9988-5a8403f7bb69/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_0c4cd8c4-4f20-4e49-9988-5a8403f7bb69/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 -> 833fe1bfba6e9465d0762b8b4b281d00d9e54d53b8918b133a54714c1d863b1b [2023-11-24 21:57:35,938 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-24 21:57:35,968 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-24 21:57:35,972 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-24 21:57:35,974 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-24 21:57:35,974 INFO L274 PluginConnector]: CDTParser initialized [2023-11-24 21:57:35,976 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c4cd8c4-4f20-4e49-9988-5a8403f7bb69/bin/uautomizer-verify-NlZe1sFDwI/../../sv-benchmarks/c/pthread-wmm/mix011_power.oepc_pso.oepc_rmo.oepc.i [2023-11-24 21:57:39,523 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-24 21:57:39,938 INFO L384 CDTParser]: Found 1 translation units. [2023-11-24 21:57:39,939 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c4cd8c4-4f20-4e49-9988-5a8403f7bb69/sv-benchmarks/c/pthread-wmm/mix011_power.oepc_pso.oepc_rmo.oepc.i [2023-11-24 21:57:39,974 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c4cd8c4-4f20-4e49-9988-5a8403f7bb69/bin/uautomizer-verify-NlZe1sFDwI/data/13f91b7e9/b60eea7806a34a76b7fedb0a7e132655/FLAG605e1699b [2023-11-24 21:57:39,997 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c4cd8c4-4f20-4e49-9988-5a8403f7bb69/bin/uautomizer-verify-NlZe1sFDwI/data/13f91b7e9/b60eea7806a34a76b7fedb0a7e132655 [2023-11-24 21:57:40,003 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-24 21:57:40,005 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-24 21:57:40,009 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-24 21:57:40,009 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-24 21:57:40,015 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-24 21:57:40,015 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 09:57:39" (1/1) ... [2023-11-24 21:57:40,017 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3777f33e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:57:40, skipping insertion in model container [2023-11-24 21:57:40,021 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 09:57:39" (1/1) ... [2023-11-24 21:57:40,105 INFO L177 MainTranslator]: Built tables and reachable declarations