./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi006_power.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi006_power.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 35f6655b445fc5bf4a2ebfcafed490ee38fb52115875b19e3a717aa5f56b5e77 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 04:09:10,933 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 04:09:10,998 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-29 04:09:11,002 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 04:09:11,003 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 04:09:11,029 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 04:09:11,030 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 04:09:11,030 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 04:09:11,031 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 04:09:11,032 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 04:09:11,032 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 04:09:11,033 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 04:09:11,034 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 04:09:11,034 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 04:09:11,035 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 04:09:11,035 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 04:09:11,036 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 04:09:11,037 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 04:09:11,037 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 04:09:11,038 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 04:09:11,038 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 04:09:11,039 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 04:09:11,039 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 04:09:11,040 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 04:09:11,040 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 04:09:11,041 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 04:09:11,041 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 04:09:11,041 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 04:09:11,042 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 04:09:11,042 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 04:09:11,043 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 04:09:11,043 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 04:09:11,043 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:09:11,044 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 04:09:11,044 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 04:09:11,044 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 04:09:11,045 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 04:09:11,045 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 04:09:11,045 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 04:09:11,045 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 04:09:11,045 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 04:09:11,046 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_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 35f6655b445fc5bf4a2ebfcafed490ee38fb52115875b19e3a717aa5f56b5e77 [2023-11-29 04:09:11,265 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 04:09:11,286 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 04:09:11,289 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 04:09:11,290 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 04:09:11,291 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 04:09:11,292 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/pthread-wmm/rfi006_power.oepc.i [2023-11-29 04:09:14,014 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 04:09:14,282 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 04:09:14,283 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/sv-benchmarks/c/pthread-wmm/rfi006_power.oepc.i [2023-11-29 04:09:14,300 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya/data/f2436ee5a/89ff1665e97f42669148a76501408b7a/FLAG5de8c380e [2023-11-29 04:09:14,314 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya/data/f2436ee5a/89ff1665e97f42669148a76501408b7a [2023-11-29 04:09:14,317 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 04:09:14,318 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 04:09:14,320 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 04:09:14,320 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 04:09:14,326 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 04:09:14,327 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:09:14" (1/1) ... [2023-11-29 04:09:14,329 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cae07bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:09:14, skipping insertion in model container [2023-11-29 04:09:14,329 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:09:14" (1/1) ... [2023-11-29 04:09:14,377 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 04:09:14,704 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:09:14,715 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 04:09:14,775 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:09:14,806 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 04:09:14,806 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 04:09:14,812 INFO L206 MainTranslator]: Completed translation [2023-11-29 04:09:14,812 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:09:14 WrapperNode [2023-11-29 04:09:14,812 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 04:09:14,813 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 04:09:14,813 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 04:09:14,814 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 04:09:14,819 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:09:14" (1/1) ... [2023-11-29 04:09:14,837 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:09:14" (1/1) ... [2023-11-29 04:09:14,862 INFO L138 Inliner]: procedures = 176, calls = 76, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 139 [2023-11-29 04:09:14,863 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 04:09:14,863 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 04:09:14,863 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 04:09:14,864 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 04:09:14,873 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:09:14" (1/1) ... [2023-11-29 04:09:14,873 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:09:14" (1/1) ... [2023-11-29 04:09:14,877 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:09:14" (1/1) ... [2023-11-29 04:09:14,899 INFO L175 MemorySlicer]: Split 26 memory accesses to 5 slices as follows [2, 1, 21, 1, 1]. 81 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1, 0, 0]. The 10 writes are split as follows [0, 1, 7, 1, 1]. [2023-11-29 04:09:14,899 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:09:14" (1/1) ... [2023-11-29 04:09:14,900 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:09:14" (1/1) ... [2023-11-29 04:09:14,912 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:09:14" (1/1) ... [2023-11-29 04:09:14,915 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:09:14" (1/1) ... [2023-11-29 04:09:14,918 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:09:14" (1/1) ... [2023-11-29 04:09:14,921 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:09:14" (1/1) ... [2023-11-29 04:09:14,927 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 04:09:14,928 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 04:09:14,928 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 04:09:14,928 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 04:09:14,929 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:09:14" (1/1) ... [2023-11-29 04:09:14,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:09:14,942 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:09:14,954 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 04:09:14,960 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 04:09:14,989 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 04:09:14,989 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 04:09:14,989 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-29 04:09:14,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-29 04:09:14,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-11-29 04:09:14,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 04:09:14,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 04:09:14,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 04:09:14,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-29 04:09:14,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-29 04:09:14,991 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-29 04:09:14,991 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 04:09:14,991 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 04:09:14,991 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 04:09:14,992 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-29 04:09:14,992 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-29 04:09:14,992 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-29 04:09:14,992 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-29 04:09:14,993 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-29 04:09:14,993 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-29 04:09:14,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 04:09:14,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 04:09:14,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 04:09:14,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-29 04:09:14,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-29 04:09:14,994 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-29 04:09:14,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 04:09:14,995 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 04:09:14,996 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-29 04:09:15,149 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 04:09:15,151 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 04:09:15,621 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 04:09:16,217 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 04:09:16,217 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-29 04:09:16,218 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:09:16 BoogieIcfgContainer [2023-11-29 04:09:16,218 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 04:09:16,220 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 04:09:16,221 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 04:09:16,224 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 04:09:16,224 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 04:09:14" (1/3) ... [2023-11-29 04:09:16,224 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@244f8e68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:09:16, skipping insertion in model container [2023-11-29 04:09:16,225 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:09:14" (2/3) ... [2023-11-29 04:09:16,225 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@244f8e68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:09:16, skipping insertion in model container [2023-11-29 04:09:16,225 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:09:16" (3/3) ... [2023-11-29 04:09:16,226 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi006_power.oepc.i [2023-11-29 04:09:16,246 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 04:09:16,247 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 48 error locations. [2023-11-29 04:09:16,247 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 04:09:16,408 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-29 04:09:16,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 196 flow [2023-11-29 04:09:16,497 INFO L124 PetriNetUnfolderBase]: 2/89 cut-off events. [2023-11-29 04:09:16,498 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 04:09:16,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 89 events. 2/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 343 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 88. Up to 2 conditions per place. [2023-11-29 04:09:16,503 INFO L82 GeneralOperation]: Start removeDead. Operand has 100 places, 92 transitions, 196 flow [2023-11-29 04:09:16,509 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 97 places, 89 transitions, 187 flow [2023-11-29 04:09:16,519 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 04:09:16,525 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;@537c1ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 04:09:16,526 INFO L358 AbstractCegarLoop]: Starting to check reachability of 85 error locations. [2023-11-29 04:09:16,529 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 04:09:16,529 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-29 04:09:16,529 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 04:09:16,530 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:09:16,530 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 04:09:16,531 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-29 04:09:16,536 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:09:16,536 INFO L85 PathProgramCache]: Analyzing trace with hash 27433, now seen corresponding path program 1 times [2023-11-29 04:09:16,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:09:16,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813608284] [2023-11-29 04:09:16,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:09:16,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:09:16,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:09:16,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-29 04:09:16,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:09:16,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813608284] [2023-11-29 04:09:16,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813608284] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:09:16,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:09:16,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 04:09:16,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036527157] [2023-11-29 04:09:16,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:09:16,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:09:16,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:09:16,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:09:16,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:09:16,849 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 92 [2023-11-29 04:09:16,852 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 89 transitions, 187 flow. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:16,852 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:09:16,852 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 92 [2023-11-29 04:09:16,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:09:19,867 INFO L124 PetriNetUnfolderBase]: 9214/14346 cut-off events. [2023-11-29 04:09:19,867 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2023-11-29 04:09:19,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27439 conditions, 14346 events. 9214/14346 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 1466. Compared 119232 event pairs, 7964 based on Foata normal form. 500/7979 useless extension candidates. Maximal degree in co-relation 27425. Up to 11276 conditions per place. [2023-11-29 04:09:20,033 INFO L140 encePairwiseOnDemand]: 63/92 looper letters, 53 selfloop transitions, 2 changer transitions 0/78 dead transitions. [2023-11-29 04:09:20,034 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 78 transitions, 275 flow [2023-11-29 04:09:20,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:09:20,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:09:20,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 184 transitions. [2023-11-29 04:09:20,047 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2023-11-29 04:09:20,048 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 184 transitions. [2023-11-29 04:09:20,049 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 184 transitions. [2023-11-29 04:09:20,050 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:09:20,053 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 184 transitions. [2023-11-29 04:09:20,056 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:20,060 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 92.0) internal successors, (368), 4 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:20,061 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 92.0) internal successors, (368), 4 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:20,063 INFO L175 Difference]: Start difference. First operand has 97 places, 89 transitions, 187 flow. Second operand 3 states and 184 transitions. [2023-11-29 04:09:20,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 78 transitions, 275 flow [2023-11-29 04:09:20,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 78 transitions, 272 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-29 04:09:20,072 INFO L231 Difference]: Finished difference. Result has 70 places, 61 transitions, 132 flow [2023-11-29 04:09:20,074 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=132, PETRI_PLACES=70, PETRI_TRANSITIONS=61} [2023-11-29 04:09:20,078 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -27 predicate places. [2023-11-29 04:09:20,078 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 61 transitions, 132 flow [2023-11-29 04:09:20,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:20,079 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:09:20,079 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 04:09:20,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 04:09:20,080 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-29 04:09:20,081 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:09:20,081 INFO L85 PathProgramCache]: Analyzing trace with hash 27434, now seen corresponding path program 1 times [2023-11-29 04:09:20,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:09:20,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001896730] [2023-11-29 04:09:20,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:09:20,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:09:20,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:09:20,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:09:20,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:09:20,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001896730] [2023-11-29 04:09:20,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001896730] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:09:20,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:09:20,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 04:09:20,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124000365] [2023-11-29 04:09:20,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:09:20,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:09:20,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:09:20,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:09:20,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:09:20,212 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 92 [2023-11-29 04:09:20,212 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 61 transitions, 132 flow. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:20,212 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:09:20,213 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 92 [2023-11-29 04:09:20,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:09:22,556 INFO L124 PetriNetUnfolderBase]: 9214/14345 cut-off events. [2023-11-29 04:09:22,557 INFO L125 PetriNetUnfolderBase]: For 250/250 co-relation queries the response was YES. [2023-11-29 04:09:22,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27686 conditions, 14345 events. 9214/14345 cut-off events. For 250/250 co-relation queries the response was YES. Maximal size of possible extension queue 1466. Compared 119342 event pairs, 7964 based on Foata normal form. 1/7479 useless extension candidates. Maximal degree in co-relation 27675. Up to 11275 conditions per place. [2023-11-29 04:09:22,641 INFO L140 encePairwiseOnDemand]: 89/92 looper letters, 52 selfloop transitions, 2 changer transitions 0/77 dead transitions. [2023-11-29 04:09:22,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 77 transitions, 272 flow [2023-11-29 04:09:22,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:09:22,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:09:22,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 136 transitions. [2023-11-29 04:09:22,644 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4927536231884058 [2023-11-29 04:09:22,644 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 136 transitions. [2023-11-29 04:09:22,644 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 136 transitions. [2023-11-29 04:09:22,645 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:09:22,645 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 136 transitions. [2023-11-29 04:09:22,646 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:22,648 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 92.0) internal successors, (368), 4 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:22,648 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 92.0) internal successors, (368), 4 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:22,648 INFO L175 Difference]: Start difference. First operand has 70 places, 61 transitions, 132 flow. Second operand 3 states and 136 transitions. [2023-11-29 04:09:22,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 77 transitions, 272 flow [2023-11-29 04:09:22,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 77 transitions, 268 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:09:22,689 INFO L231 Difference]: Finished difference. Result has 69 places, 60 transitions, 130 flow [2023-11-29 04:09:22,689 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=69, PETRI_TRANSITIONS=60} [2023-11-29 04:09:22,690 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -28 predicate places. [2023-11-29 04:09:22,690 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 60 transitions, 130 flow [2023-11-29 04:09:22,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:22,691 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:09:22,691 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 04:09:22,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 04:09:22,691 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-29 04:09:22,692 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:09:22,692 INFO L85 PathProgramCache]: Analyzing trace with hash 818148755, now seen corresponding path program 1 times [2023-11-29 04:09:22,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:09:22,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893793626] [2023-11-29 04:09:22,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:09:22,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:09:22,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:09:22,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:09:22,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:09:22,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893793626] [2023-11-29 04:09:22,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893793626] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:09:22,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:09:22,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:09:22,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542799790] [2023-11-29 04:09:22,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:09:22,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:09:22,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:09:22,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:09:22,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:09:22,771 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 92 [2023-11-29 04:09:22,771 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 60 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:22,772 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:09:22,772 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 92 [2023-11-29 04:09:22,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:09:24,768 INFO L124 PetriNetUnfolderBase]: 9218/14343 cut-off events. [2023-11-29 04:09:24,768 INFO L125 PetriNetUnfolderBase]: For 250/250 co-relation queries the response was YES. [2023-11-29 04:09:24,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27693 conditions, 14343 events. 9218/14343 cut-off events. For 250/250 co-relation queries the response was YES. Maximal size of possible extension queue 1466. Compared 119954 event pairs, 6281 based on Foata normal form. 0/7485 useless extension candidates. Maximal degree in co-relation 27682. Up to 11278 conditions per place. [2023-11-29 04:09:24,854 INFO L140 encePairwiseOnDemand]: 89/92 looper letters, 53 selfloop transitions, 2 changer transitions 0/76 dead transitions. [2023-11-29 04:09:24,855 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 76 transitions, 272 flow [2023-11-29 04:09:24,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:09:24,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:09:24,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2023-11-29 04:09:24,856 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4855072463768116 [2023-11-29 04:09:24,857 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 134 transitions. [2023-11-29 04:09:24,857 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 134 transitions. [2023-11-29 04:09:24,857 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:09:24,857 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 134 transitions. [2023-11-29 04:09:24,858 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:24,859 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 92.0) internal successors, (368), 4 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:24,860 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 92.0) internal successors, (368), 4 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:24,860 INFO L175 Difference]: Start difference. First operand has 69 places, 60 transitions, 130 flow. Second operand 3 states and 134 transitions. [2023-11-29 04:09:24,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 76 transitions, 272 flow [2023-11-29 04:09:24,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 76 transitions, 268 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:09:24,874 INFO L231 Difference]: Finished difference. Result has 68 places, 59 transitions, 128 flow [2023-11-29 04:09:24,875 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=68, PETRI_TRANSITIONS=59} [2023-11-29 04:09:24,875 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -29 predicate places. [2023-11-29 04:09:24,876 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 59 transitions, 128 flow [2023-11-29 04:09:24,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:24,876 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:09:24,876 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 04:09:24,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 04:09:24,877 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-29 04:09:24,877 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:09:24,877 INFO L85 PathProgramCache]: Analyzing trace with hash 818148756, now seen corresponding path program 1 times [2023-11-29 04:09:24,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:09:24,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792948824] [2023-11-29 04:09:24,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:09:24,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:09:24,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:09:24,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:09:24,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:09:24,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792948824] [2023-11-29 04:09:24,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792948824] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:09:24,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:09:24,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:09:24,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020815348] [2023-11-29 04:09:24,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:09:24,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:09:24,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:09:24,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:09:24,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:09:24,959 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 92 [2023-11-29 04:09:24,959 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 59 transitions, 128 flow. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:24,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:09:24,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 92 [2023-11-29 04:09:24,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:09:26,832 INFO L124 PetriNetUnfolderBase]: 9214/14335 cut-off events. [2023-11-29 04:09:26,833 INFO L125 PetriNetUnfolderBase]: For 254/254 co-relation queries the response was YES. [2023-11-29 04:09:26,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27680 conditions, 14335 events. 9214/14335 cut-off events. For 254/254 co-relation queries the response was YES. Maximal size of possible extension queue 1466. Compared 119980 event pairs, 5720 based on Foata normal form. 5/7485 useless extension candidates. Maximal degree in co-relation 27670. Up to 11269 conditions per place. [2023-11-29 04:09:26,911 INFO L140 encePairwiseOnDemand]: 89/92 looper letters, 52 selfloop transitions, 2 changer transitions 0/75 dead transitions. [2023-11-29 04:09:26,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 75 transitions, 268 flow [2023-11-29 04:09:26,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:09:26,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:09:26,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 136 transitions. [2023-11-29 04:09:26,913 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4927536231884058 [2023-11-29 04:09:26,913 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 136 transitions. [2023-11-29 04:09:26,914 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 136 transitions. [2023-11-29 04:09:26,914 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:09:26,914 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 136 transitions. [2023-11-29 04:09:26,915 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:26,916 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 92.0) internal successors, (368), 4 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:26,917 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 92.0) internal successors, (368), 4 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:26,917 INFO L175 Difference]: Start difference. First operand has 68 places, 59 transitions, 128 flow. Second operand 3 states and 136 transitions. [2023-11-29 04:09:26,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 75 transitions, 268 flow [2023-11-29 04:09:26,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 75 transitions, 264 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:09:26,924 INFO L231 Difference]: Finished difference. Result has 67 places, 58 transitions, 126 flow [2023-11-29 04:09:26,925 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=67, PETRI_TRANSITIONS=58} [2023-11-29 04:09:26,926 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -30 predicate places. [2023-11-29 04:09:26,926 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 58 transitions, 126 flow [2023-11-29 04:09:26,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:26,926 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:09:26,927 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 04:09:26,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 04:09:26,927 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-29 04:09:26,927 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:09:26,928 INFO L85 PathProgramCache]: Analyzing trace with hash 818151422, now seen corresponding path program 1 times [2023-11-29 04:09:26,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:09:26,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15120138] [2023-11-29 04:09:26,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:09:26,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:09:26,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:09:27,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:09:27,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:09:27,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15120138] [2023-11-29 04:09:27,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15120138] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:09:27,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:09:27,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:09:27,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658623874] [2023-11-29 04:09:27,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:09:27,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:09:27,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:09:27,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:09:27,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:09:27,047 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 92 [2023-11-29 04:09:27,048 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 58 transitions, 126 flow. Second operand has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:27,048 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:09:27,048 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 92 [2023-11-29 04:09:27,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:09:28,519 INFO L124 PetriNetUnfolderBase]: 4498/7558 cut-off events. [2023-11-29 04:09:28,520 INFO L125 PetriNetUnfolderBase]: For 115/115 co-relation queries the response was YES. [2023-11-29 04:09:28,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14401 conditions, 7558 events. 4498/7558 cut-off events. For 115/115 co-relation queries the response was YES. Maximal size of possible extension queue 692. Compared 62007 event pairs, 3059 based on Foata normal form. 0/4933 useless extension candidates. Maximal degree in co-relation 14390. Up to 4121 conditions per place. [2023-11-29 04:09:28,558 INFO L140 encePairwiseOnDemand]: 79/92 looper letters, 55 selfloop transitions, 6 changer transitions 0/81 dead transitions. [2023-11-29 04:09:28,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 81 transitions, 294 flow [2023-11-29 04:09:28,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:09:28,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 04:09:28,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 181 transitions. [2023-11-29 04:09:28,560 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49184782608695654 [2023-11-29 04:09:28,560 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 181 transitions. [2023-11-29 04:09:28,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 181 transitions. [2023-11-29 04:09:28,561 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:09:28,561 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 181 transitions. [2023-11-29 04:09:28,562 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 45.25) internal successors, (181), 4 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-29 04:09:28,563 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 92.0) internal successors, (460), 5 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:28,563 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 92.0) internal successors, (460), 5 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:28,563 INFO L175 Difference]: Start difference. First operand has 67 places, 58 transitions, 126 flow. Second operand 4 states and 181 transitions. [2023-11-29 04:09:28,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 81 transitions, 294 flow [2023-11-29 04:09:28,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 81 transitions, 290 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:09:28,567 INFO L231 Difference]: Finished difference. Result has 69 places, 60 transitions, 178 flow [2023-11-29 04:09:28,567 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=178, PETRI_PLACES=69, PETRI_TRANSITIONS=60} [2023-11-29 04:09:28,568 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -28 predicate places. [2023-11-29 04:09:28,568 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 60 transitions, 178 flow [2023-11-29 04:09:28,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:28,569 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:09:28,569 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 04:09:28,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 04:09:28,569 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-29 04:09:28,569 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:09:28,569 INFO L85 PathProgramCache]: Analyzing trace with hash 818151423, now seen corresponding path program 1 times [2023-11-29 04:09:28,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:09:28,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999212215] [2023-11-29 04:09:28,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:09:28,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:09:28,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:09:28,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:09:28,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:09:28,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999212215] [2023-11-29 04:09:28,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999212215] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:09:28,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:09:28,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:09:28,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288506037] [2023-11-29 04:09:28,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:09:28,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:09:28,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:09:28,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:09:28,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:09:28,683 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 92 [2023-11-29 04:09:28,684 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 60 transitions, 178 flow. Second operand has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:28,684 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:09:28,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 92 [2023-11-29 04:09:28,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:09:29,142 INFO L124 PetriNetUnfolderBase]: 1304/2453 cut-off events. [2023-11-29 04:09:29,142 INFO L125 PetriNetUnfolderBase]: For 1077/1077 co-relation queries the response was YES. [2023-11-29 04:09:29,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5923 conditions, 2453 events. 1304/2453 cut-off events. For 1077/1077 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 18522 event pairs, 896 based on Foata normal form. 700/3018 useless extension candidates. Maximal degree in co-relation 5909. Up to 1052 conditions per place. [2023-11-29 04:09:29,153 INFO L140 encePairwiseOnDemand]: 83/92 looper letters, 37 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2023-11-29 04:09:29,153 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 60 transitions, 264 flow [2023-11-29 04:09:29,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:09:29,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 04:09:29,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions. [2023-11-29 04:09:29,155 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4320652173913043 [2023-11-29 04:09:29,155 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 159 transitions. [2023-11-29 04:09:29,155 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 159 transitions. [2023-11-29 04:09:29,155 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:09:29,155 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 159 transitions. [2023-11-29 04:09:29,156 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-29 04:09:29,157 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 92.0) internal successors, (460), 5 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:29,158 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 92.0) internal successors, (460), 5 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:29,158 INFO L175 Difference]: Start difference. First operand has 69 places, 60 transitions, 178 flow. Second operand 4 states and 159 transitions. [2023-11-29 04:09:29,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 60 transitions, 264 flow [2023-11-29 04:09:29,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 60 transitions, 262 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 04:09:29,161 INFO L231 Difference]: Finished difference. Result has 64 places, 53 transitions, 166 flow [2023-11-29 04:09:29,161 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=166, PETRI_PLACES=64, PETRI_TRANSITIONS=53} [2023-11-29 04:09:29,162 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -33 predicate places. [2023-11-29 04:09:29,162 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 53 transitions, 166 flow [2023-11-29 04:09:29,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:29,162 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:09:29,163 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:09:29,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 04:09:29,163 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-29 04:09:29,163 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:09:29,163 INFO L85 PathProgramCache]: Analyzing trace with hash -468954384, now seen corresponding path program 1 times [2023-11-29 04:09:29,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:09:29,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147710130] [2023-11-29 04:09:29,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:09:29,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:09:29,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:09:29,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:09:29,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:09:29,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147710130] [2023-11-29 04:09:29,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147710130] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:09:29,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:09:29,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:09:29,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83512224] [2023-11-29 04:09:29,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:09:29,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:09:29,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:09:29,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:09:29,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:09:29,218 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 92 [2023-11-29 04:09:29,218 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 53 transitions, 166 flow. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:29,218 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:09:29,218 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 92 [2023-11-29 04:09:29,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:09:29,643 INFO L124 PetriNetUnfolderBase]: 1316/2446 cut-off events. [2023-11-29 04:09:29,644 INFO L125 PetriNetUnfolderBase]: For 987/987 co-relation queries the response was YES. [2023-11-29 04:09:29,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5980 conditions, 2446 events. 1316/2446 cut-off events. For 987/987 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 18302 event pairs, 878 based on Foata normal form. 0/2327 useless extension candidates. Maximal degree in co-relation 5965. Up to 1077 conditions per place. [2023-11-29 04:09:29,654 INFO L140 encePairwiseOnDemand]: 89/92 looper letters, 38 selfloop transitions, 2 changer transitions 0/59 dead transitions. [2023-11-29 04:09:29,655 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 59 transitions, 266 flow [2023-11-29 04:09:29,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:09:29,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:09:29,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 115 transitions. [2023-11-29 04:09:29,656 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2023-11-29 04:09:29,656 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 115 transitions. [2023-11-29 04:09:29,656 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 115 transitions. [2023-11-29 04:09:29,657 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:09:29,657 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 115 transitions. [2023-11-29 04:09:29,657 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:29,658 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 92.0) internal successors, (368), 4 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:29,658 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 92.0) internal successors, (368), 4 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:29,658 INFO L175 Difference]: Start difference. First operand has 64 places, 53 transitions, 166 flow. Second operand 3 states and 115 transitions. [2023-11-29 04:09:29,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 59 transitions, 266 flow [2023-11-29 04:09:29,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 59 transitions, 263 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:09:29,661 INFO L231 Difference]: Finished difference. Result has 63 places, 52 transitions, 165 flow [2023-11-29 04:09:29,661 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=165, PETRI_PLACES=63, PETRI_TRANSITIONS=52} [2023-11-29 04:09:29,662 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -34 predicate places. [2023-11-29 04:09:29,662 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 52 transitions, 165 flow [2023-11-29 04:09:29,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:29,662 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:09:29,663 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:09:29,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 04:09:29,663 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-29 04:09:29,663 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:09:29,663 INFO L85 PathProgramCache]: Analyzing trace with hash -468954383, now seen corresponding path program 1 times [2023-11-29 04:09:29,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:09:29,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927411014] [2023-11-29 04:09:29,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:09:29,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:09:29,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:09:29,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:09:29,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:09:29,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927411014] [2023-11-29 04:09:29,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927411014] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:09:29,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:09:29,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:09:29,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75358556] [2023-11-29 04:09:29,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:09:29,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:09:29,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:09:29,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:09:29,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:09:29,733 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 92 [2023-11-29 04:09:29,734 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 52 transitions, 165 flow. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:29,734 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:09:29,734 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 92 [2023-11-29 04:09:29,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:09:30,208 INFO L124 PetriNetUnfolderBase]: 1304/2425 cut-off events. [2023-11-29 04:09:30,208 INFO L125 PetriNetUnfolderBase]: For 987/987 co-relation queries the response was YES. [2023-11-29 04:09:30,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5976 conditions, 2425 events. 1304/2425 cut-off events. For 987/987 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 18148 event pairs, 872 based on Foata normal form. 9/2321 useless extension candidates. Maximal degree in co-relation 5962. Up to 1077 conditions per place. [2023-11-29 04:09:30,223 INFO L140 encePairwiseOnDemand]: 89/92 looper letters, 37 selfloop transitions, 2 changer transitions 0/58 dead transitions. [2023-11-29 04:09:30,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 58 transitions, 263 flow [2023-11-29 04:09:30,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:09:30,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:09:30,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2023-11-29 04:09:30,225 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42391304347826086 [2023-11-29 04:09:30,225 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 117 transitions. [2023-11-29 04:09:30,225 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 117 transitions. [2023-11-29 04:09:30,225 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:09:30,225 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 117 transitions. [2023-11-29 04:09:30,226 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-29 04:09:30,226 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 92.0) internal successors, (368), 4 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:30,227 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 92.0) internal successors, (368), 4 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:30,227 INFO L175 Difference]: Start difference. First operand has 63 places, 52 transitions, 165 flow. Second operand 3 states and 117 transitions. [2023-11-29 04:09:30,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 58 transitions, 263 flow [2023-11-29 04:09:30,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 58 transitions, 259 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:09:30,230 INFO L231 Difference]: Finished difference. Result has 62 places, 51 transitions, 163 flow [2023-11-29 04:09:30,230 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=163, PETRI_PLACES=62, PETRI_TRANSITIONS=51} [2023-11-29 04:09:30,230 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -35 predicate places. [2023-11-29 04:09:30,231 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 51 transitions, 163 flow [2023-11-29 04:09:30,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:30,231 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:09:30,231 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:09:30,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 04:09:30,231 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-29 04:09:30,232 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:09:30,232 INFO L85 PathProgramCache]: Analyzing trace with hash 962699766, now seen corresponding path program 1 times [2023-11-29 04:09:30,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:09:30,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505039747] [2023-11-29 04:09:30,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:09:30,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:09:30,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:09:30,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:09:30,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:09:30,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505039747] [2023-11-29 04:09:30,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505039747] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:09:30,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:09:30,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 04:09:30,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179189557] [2023-11-29 04:09:30,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:09:30,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:09:30,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:09:30,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:09:30,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:09:30,331 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 92 [2023-11-29 04:09:30,331 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 163 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-29 04:09:30,331 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:09:30,331 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 92 [2023-11-29 04:09:30,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:09:30,781 INFO L124 PetriNetUnfolderBase]: 1246/2578 cut-off events. [2023-11-29 04:09:30,782 INFO L125 PetriNetUnfolderBase]: For 834/842 co-relation queries the response was YES. [2023-11-29 04:09:30,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6003 conditions, 2578 events. 1246/2578 cut-off events. For 834/842 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 20675 event pairs, 432 based on Foata normal form. 0/2457 useless extension candidates. Maximal degree in co-relation 5989. Up to 1359 conditions per place. [2023-11-29 04:09:30,792 INFO L140 encePairwiseOnDemand]: 88/92 looper letters, 53 selfloop transitions, 3 changer transitions 0/75 dead transitions. [2023-11-29 04:09:30,792 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 75 transitions, 369 flow [2023-11-29 04:09:30,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:09:30,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:09:30,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 135 transitions. [2023-11-29 04:09:30,793 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4891304347826087 [2023-11-29 04:09:30,793 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 135 transitions. [2023-11-29 04:09:30,794 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 135 transitions. [2023-11-29 04:09:30,794 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:09:30,794 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 135 transitions. [2023-11-29 04:09:30,794 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:30,795 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 92.0) internal successors, (368), 4 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:30,795 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 92.0) internal successors, (368), 4 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:30,795 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 163 flow. Second operand 3 states and 135 transitions. [2023-11-29 04:09:30,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 75 transitions, 369 flow [2023-11-29 04:09:30,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 75 transitions, 361 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:09:30,798 INFO L231 Difference]: Finished difference. Result has 63 places, 51 transitions, 172 flow [2023-11-29 04:09:30,798 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=172, PETRI_PLACES=63, PETRI_TRANSITIONS=51} [2023-11-29 04:09:30,798 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -34 predicate places. [2023-11-29 04:09:30,799 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 51 transitions, 172 flow [2023-11-29 04:09:30,799 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-29 04:09:30,799 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:09:30,799 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:09:30,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 04:09:30,799 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-29 04:09:30,799 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:09:30,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1736571588, now seen corresponding path program 1 times [2023-11-29 04:09:30,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:09:30,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480050720] [2023-11-29 04:09:30,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:09:30,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:09:30,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:09:30,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:09:30,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:09:30,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480050720] [2023-11-29 04:09:30,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480050720] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:09:30,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:09:30,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:09:30,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353009315] [2023-11-29 04:09:30,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:09:30,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:09:30,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:09:30,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:09:30,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:09:30,920 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 92 [2023-11-29 04:09:30,920 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 51 transitions, 172 flow. Second operand has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:30,921 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:09:30,921 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 92 [2023-11-29 04:09:30,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:09:31,409 INFO L124 PetriNetUnfolderBase]: 1280/2718 cut-off events. [2023-11-29 04:09:31,409 INFO L125 PetriNetUnfolderBase]: For 1115/1123 co-relation queries the response was YES. [2023-11-29 04:09:31,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6606 conditions, 2718 events. 1280/2718 cut-off events. For 1115/1123 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 22388 event pairs, 304 based on Foata normal form. 0/2670 useless extension candidates. Maximal degree in co-relation 6590. Up to 972 conditions per place. [2023-11-29 04:09:31,419 INFO L140 encePairwiseOnDemand]: 85/92 looper letters, 45 selfloop transitions, 8 changer transitions 0/72 dead transitions. [2023-11-29 04:09:31,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 72 transitions, 332 flow [2023-11-29 04:09:31,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:09:31,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 04:09:31,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 166 transitions. [2023-11-29 04:09:31,420 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45108695652173914 [2023-11-29 04:09:31,420 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 166 transitions. [2023-11-29 04:09:31,420 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 166 transitions. [2023-11-29 04:09:31,420 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:09:31,421 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 166 transitions. [2023-11-29 04:09:31,421 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:31,422 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 92.0) internal successors, (460), 5 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:31,422 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 92.0) internal successors, (460), 5 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:31,422 INFO L175 Difference]: Start difference. First operand has 63 places, 51 transitions, 172 flow. Second operand 4 states and 166 transitions. [2023-11-29 04:09:31,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 72 transitions, 332 flow [2023-11-29 04:09:31,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 72 transitions, 326 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:09:31,425 INFO L231 Difference]: Finished difference. Result has 63 places, 51 transitions, 184 flow [2023-11-29 04:09:31,425 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=184, PETRI_PLACES=63, PETRI_TRANSITIONS=51} [2023-11-29 04:09:31,426 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -34 predicate places. [2023-11-29 04:09:31,426 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 51 transitions, 184 flow [2023-11-29 04:09:31,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:31,426 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:09:31,426 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:09:31,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 04:09:31,427 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-29 04:09:31,427 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:09:31,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1736571589, now seen corresponding path program 1 times [2023-11-29 04:09:31,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:09:31,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098107186] [2023-11-29 04:09:31,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:09:31,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:09:31,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:09:31,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:09:31,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:09:31,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098107186] [2023-11-29 04:09:31,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098107186] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:09:31,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:09:31,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:09:31,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086027428] [2023-11-29 04:09:31,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:09:31,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:09:31,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:09:31,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:09:31,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:09:31,590 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 92 [2023-11-29 04:09:31,590 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 51 transitions, 184 flow. Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:31,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:09:31,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 92 [2023-11-29 04:09:31,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:09:32,178 INFO L124 PetriNetUnfolderBase]: 1923/3804 cut-off events. [2023-11-29 04:09:32,178 INFO L125 PetriNetUnfolderBase]: For 1919/1929 co-relation queries the response was YES. [2023-11-29 04:09:32,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9567 conditions, 3804 events. 1923/3804 cut-off events. For 1919/1929 co-relation queries the response was YES. Maximal size of possible extension queue 356. Compared 32092 event pairs, 927 based on Foata normal form. 24/3759 useless extension candidates. Maximal degree in co-relation 9551. Up to 1666 conditions per place. [2023-11-29 04:09:32,203 INFO L140 encePairwiseOnDemand]: 84/92 looper letters, 56 selfloop transitions, 11 changer transitions 0/86 dead transitions. [2023-11-29 04:09:32,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 86 transitions, 449 flow [2023-11-29 04:09:32,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 04:09:32,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 04:09:32,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 200 transitions. [2023-11-29 04:09:32,204 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43478260869565216 [2023-11-29 04:09:32,204 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 200 transitions. [2023-11-29 04:09:32,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 200 transitions. [2023-11-29 04:09:32,204 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:09:32,204 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 200 transitions. [2023-11-29 04:09:32,205 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 40.0) internal successors, (200), 5 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:32,206 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 92.0) internal successors, (552), 6 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:32,206 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 92.0) internal successors, (552), 6 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:32,206 INFO L175 Difference]: Start difference. First operand has 63 places, 51 transitions, 184 flow. Second operand 5 states and 200 transitions. [2023-11-29 04:09:32,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 86 transitions, 449 flow [2023-11-29 04:09:32,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 86 transitions, 438 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 04:09:32,209 INFO L231 Difference]: Finished difference. Result has 68 places, 58 transitions, 245 flow [2023-11-29 04:09:32,209 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=245, PETRI_PLACES=68, PETRI_TRANSITIONS=58} [2023-11-29 04:09:32,210 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -29 predicate places. [2023-11-29 04:09:32,210 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 58 transitions, 245 flow [2023-11-29 04:09:32,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:32,210 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:09:32,210 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:09:32,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 04:09:32,211 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-29 04:09:32,211 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:09:32,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1200168583, now seen corresponding path program 2 times [2023-11-29 04:09:32,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:09:32,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943540435] [2023-11-29 04:09:32,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:09:32,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:09:32,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:09:32,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:09:32,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:09:32,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943540435] [2023-11-29 04:09:32,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943540435] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:09:32,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:09:32,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:09:32,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521996634] [2023-11-29 04:09:32,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:09:32,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 04:09:32,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:09:32,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 04:09:32,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:09:32,440 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 92 [2023-11-29 04:09:32,441 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 58 transitions, 245 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-29 04:09:32,441 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:09:32,441 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 92 [2023-11-29 04:09:32,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:09:33,038 INFO L124 PetriNetUnfolderBase]: 1877/3721 cut-off events. [2023-11-29 04:09:33,038 INFO L125 PetriNetUnfolderBase]: For 3254/3290 co-relation queries the response was YES. [2023-11-29 04:09:33,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10043 conditions, 3721 events. 1877/3721 cut-off events. For 3254/3290 co-relation queries the response was YES. Maximal size of possible extension queue 349. Compared 31213 event pairs, 1071 based on Foata normal form. 27/3677 useless extension candidates. Maximal degree in co-relation 10024. Up to 2345 conditions per place. [2023-11-29 04:09:33,056 INFO L140 encePairwiseOnDemand]: 84/92 looper letters, 60 selfloop transitions, 10 changer transitions 0/89 dead transitions. [2023-11-29 04:09:33,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 89 transitions, 512 flow [2023-11-29 04:09:33,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 04:09:33,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 04:09:33,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 198 transitions. [2023-11-29 04:09:33,058 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43043478260869567 [2023-11-29 04:09:33,058 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 198 transitions. [2023-11-29 04:09:33,058 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 198 transitions. [2023-11-29 04:09:33,058 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:09:33,058 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 198 transitions. [2023-11-29 04:09:33,059 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 39.6) internal successors, (198), 5 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:33,060 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 92.0) internal successors, (552), 6 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:33,060 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 92.0) internal successors, (552), 6 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:33,060 INFO L175 Difference]: Start difference. First operand has 68 places, 58 transitions, 245 flow. Second operand 5 states and 198 transitions. [2023-11-29 04:09:33,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 89 transitions, 512 flow [2023-11-29 04:09:33,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 89 transitions, 492 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-11-29 04:09:33,064 INFO L231 Difference]: Finished difference. Result has 70 places, 61 transitions, 286 flow [2023-11-29 04:09:33,064 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=286, PETRI_PLACES=70, PETRI_TRANSITIONS=61} [2023-11-29 04:09:33,064 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -27 predicate places. [2023-11-29 04:09:33,064 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 61 transitions, 286 flow [2023-11-29 04:09:33,065 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-29 04:09:33,065 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:09:33,065 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-29 04:09:33,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 04:09:33,065 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-29 04:09:33,065 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:09:33,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1932629857, now seen corresponding path program 1 times [2023-11-29 04:09:33,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:09:33,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762273455] [2023-11-29 04:09:33,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:09:33,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:09:33,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:09:33,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:09:33,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:09:33,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762273455] [2023-11-29 04:09:33,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762273455] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:09:33,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:09:33,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 04:09:33,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199675268] [2023-11-29 04:09:33,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:09:33,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 04:09:33,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:09:33,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 04:09:33,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-29 04:09:33,738 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 92 [2023-11-29 04:09:33,738 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 61 transitions, 286 flow. Second operand has 8 states, 8 states have (on average 25.75) internal successors, (206), 8 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:33,738 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:09:33,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 92 [2023-11-29 04:09:33,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:09:34,470 INFO L124 PetriNetUnfolderBase]: 2058/3953 cut-off events. [2023-11-29 04:09:34,470 INFO L125 PetriNetUnfolderBase]: For 4427/4463 co-relation queries the response was YES. [2023-11-29 04:09:34,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10803 conditions, 3953 events. 2058/3953 cut-off events. For 4427/4463 co-relation queries the response was YES. Maximal size of possible extension queue 381. Compared 33079 event pairs, 1121 based on Foata normal form. 7/3770 useless extension candidates. Maximal degree in co-relation 10783. Up to 1486 conditions per place. [2023-11-29 04:09:34,487 INFO L140 encePairwiseOnDemand]: 85/92 looper letters, 81 selfloop transitions, 12 changer transitions 0/110 dead transitions. [2023-11-29 04:09:34,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 110 transitions, 688 flow [2023-11-29 04:09:34,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 04:09:34,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 04:09:34,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 244 transitions. [2023-11-29 04:09:34,489 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37888198757763975 [2023-11-29 04:09:34,490 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 244 transitions. [2023-11-29 04:09:34,490 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 244 transitions. [2023-11-29 04:09:34,490 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:09:34,490 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 244 transitions. [2023-11-29 04:09:34,491 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 34.857142857142854) internal successors, (244), 7 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:34,492 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 92.0) internal successors, (736), 8 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:34,492 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 92.0) internal successors, (736), 8 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:34,492 INFO L175 Difference]: Start difference. First operand has 70 places, 61 transitions, 286 flow. Second operand 7 states and 244 transitions. [2023-11-29 04:09:34,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 110 transitions, 688 flow [2023-11-29 04:09:34,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 110 transitions, 679 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:09:34,496 INFO L231 Difference]: Finished difference. Result has 78 places, 68 transitions, 383 flow [2023-11-29 04:09:34,496 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=281, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=383, PETRI_PLACES=78, PETRI_TRANSITIONS=68} [2023-11-29 04:09:34,497 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -19 predicate places. [2023-11-29 04:09:34,497 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 68 transitions, 383 flow [2023-11-29 04:09:34,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 25.75) internal successors, (206), 8 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:34,498 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:09:34,498 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-29 04:09:34,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 04:09:34,498 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-29 04:09:34,498 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:09:34,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1932630955, now seen corresponding path program 1 times [2023-11-29 04:09:34,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:09:34,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615159055] [2023-11-29 04:09:34,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:09:34,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:09:34,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:09:34,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:09:34,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:09:34,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615159055] [2023-11-29 04:09:34,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615159055] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:09:34,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:09:34,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:09:34,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632171399] [2023-11-29 04:09:34,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:09:34,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:09:34,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:09:34,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:09:34,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:09:34,664 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 92 [2023-11-29 04:09:34,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 68 transitions, 383 flow. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:34,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:09:34,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 92 [2023-11-29 04:09:34,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:09:35,614 INFO L124 PetriNetUnfolderBase]: 4078/6882 cut-off events. [2023-11-29 04:09:35,614 INFO L125 PetriNetUnfolderBase]: For 8950/9106 co-relation queries the response was YES. [2023-11-29 04:09:35,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18884 conditions, 6882 events. 4078/6882 cut-off events. For 8950/9106 co-relation queries the response was YES. Maximal size of possible extension queue 452. Compared 50956 event pairs, 612 based on Foata normal form. 153/6953 useless extension candidates. Maximal degree in co-relation 18860. Up to 4933 conditions per place. [2023-11-29 04:09:35,647 INFO L140 encePairwiseOnDemand]: 86/92 looper letters, 81 selfloop transitions, 5 changer transitions 2/103 dead transitions. [2023-11-29 04:09:35,647 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 103 transitions, 778 flow [2023-11-29 04:09:35,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:09:35,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 04:09:35,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2023-11-29 04:09:35,648 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41032608695652173 [2023-11-29 04:09:35,648 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 151 transitions. [2023-11-29 04:09:35,648 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 151 transitions. [2023-11-29 04:09:35,649 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:09:35,649 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 151 transitions. [2023-11-29 04:09:35,649 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:35,650 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 92.0) internal successors, (460), 5 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:35,650 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 92.0) internal successors, (460), 5 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:35,650 INFO L175 Difference]: Start difference. First operand has 78 places, 68 transitions, 383 flow. Second operand 4 states and 151 transitions. [2023-11-29 04:09:35,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 103 transitions, 778 flow [2023-11-29 04:09:35,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 103 transitions, 768 flow, removed 5 selfloop flow, removed 0 redundant places. [2023-11-29 04:09:35,656 INFO L231 Difference]: Finished difference. Result has 83 places, 70 transitions, 399 flow [2023-11-29 04:09:35,657 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=377, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=399, PETRI_PLACES=83, PETRI_TRANSITIONS=70} [2023-11-29 04:09:35,657 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -14 predicate places. [2023-11-29 04:09:35,657 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 70 transitions, 399 flow [2023-11-29 04:09:35,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:35,657 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:09:35,658 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-29 04:09:35,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 04:09:35,658 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-29 04:09:35,658 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:09:35,658 INFO L85 PathProgramCache]: Analyzing trace with hash -548766349, now seen corresponding path program 1 times [2023-11-29 04:09:35,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:09:35,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887847379] [2023-11-29 04:09:35,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:09:35,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:09:35,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:09:35,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:09:35,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:09:35,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887847379] [2023-11-29 04:09:35,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887847379] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:09:35,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:09:35,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:09:35,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504984791] [2023-11-29 04:09:35,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:09:35,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:09:35,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:09:35,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:09:35,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:09:35,862 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 92 [2023-11-29 04:09:35,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 70 transitions, 399 flow. Second operand has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:35,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:09:35,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 92 [2023-11-29 04:09:35,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:09:36,418 INFO L124 PetriNetUnfolderBase]: 2146/3692 cut-off events. [2023-11-29 04:09:36,418 INFO L125 PetriNetUnfolderBase]: For 5263/5333 co-relation queries the response was YES. [2023-11-29 04:09:36,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10739 conditions, 3692 events. 2146/3692 cut-off events. For 5263/5333 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 23626 event pairs, 169 based on Foata normal form. 133/3800 useless extension candidates. Maximal degree in co-relation 10711. Up to 2013 conditions per place. [2023-11-29 04:09:36,434 INFO L140 encePairwiseOnDemand]: 86/92 looper letters, 88 selfloop transitions, 8 changer transitions 2/113 dead transitions. [2023-11-29 04:09:36,435 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 113 transitions, 858 flow [2023-11-29 04:09:36,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 04:09:36,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 04:09:36,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 188 transitions. [2023-11-29 04:09:36,436 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40869565217391307 [2023-11-29 04:09:36,436 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 188 transitions. [2023-11-29 04:09:36,436 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 188 transitions. [2023-11-29 04:09:36,436 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:09:36,436 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 188 transitions. [2023-11-29 04:09:36,437 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 37.6) internal successors, (188), 5 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:36,438 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 92.0) internal successors, (552), 6 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:36,438 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 92.0) internal successors, (552), 6 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:36,438 INFO L175 Difference]: Start difference. First operand has 83 places, 70 transitions, 399 flow. Second operand 5 states and 188 transitions. [2023-11-29 04:09:36,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 113 transitions, 858 flow [2023-11-29 04:09:36,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 113 transitions, 801 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-11-29 04:09:36,444 INFO L231 Difference]: Finished difference. Result has 85 places, 71 transitions, 394 flow [2023-11-29 04:09:36,444 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=394, PETRI_PLACES=85, PETRI_TRANSITIONS=71} [2023-11-29 04:09:36,444 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -12 predicate places. [2023-11-29 04:09:36,444 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 71 transitions, 394 flow [2023-11-29 04:09:36,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:36,445 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:09:36,445 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:09:36,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 04:09:36,445 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-29 04:09:36,445 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:09:36,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1388305721, now seen corresponding path program 1 times [2023-11-29 04:09:36,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:09:36,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181279828] [2023-11-29 04:09:36,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:09:36,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:09:36,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:09:37,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:09:37,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:09:37,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181279828] [2023-11-29 04:09:37,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181279828] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:09:37,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:09:37,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 04:09:37,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174178661] [2023-11-29 04:09:37,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:09:37,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 04:09:37,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:09:37,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 04:09:37,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-11-29 04:09:37,598 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 92 [2023-11-29 04:09:37,598 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 71 transitions, 394 flow. Second operand has 10 states, 10 states have (on average 24.8) internal successors, (248), 10 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:37,598 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:09:37,598 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 92 [2023-11-29 04:09:37,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:09:38,299 INFO L124 PetriNetUnfolderBase]: 1697/3287 cut-off events. [2023-11-29 04:09:38,299 INFO L125 PetriNetUnfolderBase]: For 3294/3414 co-relation queries the response was YES. [2023-11-29 04:09:38,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9167 conditions, 3287 events. 1697/3287 cut-off events. For 3294/3414 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 22847 event pairs, 459 based on Foata normal form. 93/3265 useless extension candidates. Maximal degree in co-relation 9138. Up to 1267 conditions per place. [2023-11-29 04:09:38,321 INFO L140 encePairwiseOnDemand]: 83/92 looper letters, 49 selfloop transitions, 19 changer transitions 4/94 dead transitions. [2023-11-29 04:09:38,321 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 94 transitions, 638 flow [2023-11-29 04:09:38,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 04:09:38,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 04:09:38,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 215 transitions. [2023-11-29 04:09:38,323 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3338509316770186 [2023-11-29 04:09:38,324 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 215 transitions. [2023-11-29 04:09:38,324 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 215 transitions. [2023-11-29 04:09:38,324 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:09:38,324 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 215 transitions. [2023-11-29 04:09:38,325 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 30.714285714285715) internal successors, (215), 7 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:38,326 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 92.0) internal successors, (736), 8 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:38,327 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 92.0) internal successors, (736), 8 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:38,327 INFO L175 Difference]: Start difference. First operand has 85 places, 71 transitions, 394 flow. Second operand 7 states and 215 transitions. [2023-11-29 04:09:38,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 94 transitions, 638 flow [2023-11-29 04:09:38,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 94 transitions, 610 flow, removed 5 selfloop flow, removed 5 redundant places. [2023-11-29 04:09:38,334 INFO L231 Difference]: Finished difference. Result has 86 places, 72 transitions, 439 flow [2023-11-29 04:09:38,334 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=365, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=439, PETRI_PLACES=86, PETRI_TRANSITIONS=72} [2023-11-29 04:09:38,335 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -11 predicate places. [2023-11-29 04:09:38,335 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 72 transitions, 439 flow [2023-11-29 04:09:38,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 24.8) internal successors, (248), 10 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:38,335 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:09:38,335 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:09:38,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 04:09:38,336 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-29 04:09:38,336 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:09:38,336 INFO L85 PathProgramCache]: Analyzing trace with hash 604385551, now seen corresponding path program 1 times [2023-11-29 04:09:38,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:09:38,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168299684] [2023-11-29 04:09:38,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:09:38,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:09:38,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:09:38,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:09:38,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:09:38,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168299684] [2023-11-29 04:09:38,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168299684] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:09:38,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:09:38,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 04:09:38,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959038206] [2023-11-29 04:09:38,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:09:38,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 04:09:38,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:09:38,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 04:09:38,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:09:38,578 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 92 [2023-11-29 04:09:38,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 72 transitions, 439 flow. Second operand has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:38,579 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:09:38,579 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 92 [2023-11-29 04:09:38,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:09:39,085 INFO L124 PetriNetUnfolderBase]: 1432/2401 cut-off events. [2023-11-29 04:09:39,085 INFO L125 PetriNetUnfolderBase]: For 4303/4336 co-relation queries the response was YES. [2023-11-29 04:09:39,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7566 conditions, 2401 events. 1432/2401 cut-off events. For 4303/4336 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 13203 event pairs, 85 based on Foata normal form. 136/2528 useless extension candidates. Maximal degree in co-relation 7552. Up to 876 conditions per place. [2023-11-29 04:09:39,097 INFO L140 encePairwiseOnDemand]: 86/92 looper letters, 74 selfloop transitions, 11 changer transitions 5/104 dead transitions. [2023-11-29 04:09:39,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 104 transitions, 833 flow [2023-11-29 04:09:39,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 04:09:39,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 04:09:39,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 204 transitions. [2023-11-29 04:09:39,099 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3695652173913043 [2023-11-29 04:09:39,099 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 204 transitions. [2023-11-29 04:09:39,099 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 204 transitions. [2023-11-29 04:09:39,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:09:39,099 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 204 transitions. [2023-11-29 04:09:39,100 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 34.0) internal successors, (204), 6 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:39,101 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 92.0) internal successors, (644), 7 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:39,101 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 92.0) internal successors, (644), 7 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:39,101 INFO L175 Difference]: Start difference. First operand has 86 places, 72 transitions, 439 flow. Second operand 6 states and 204 transitions. [2023-11-29 04:09:39,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 104 transitions, 833 flow [2023-11-29 04:09:39,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 104 transitions, 756 flow, removed 5 selfloop flow, removed 7 redundant places. [2023-11-29 04:09:39,106 INFO L231 Difference]: Finished difference. Result has 80 places, 59 transitions, 340 flow [2023-11-29 04:09:39,106 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=340, PETRI_PLACES=80, PETRI_TRANSITIONS=59} [2023-11-29 04:09:39,107 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -17 predicate places. [2023-11-29 04:09:39,107 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 59 transitions, 340 flow [2023-11-29 04:09:39,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:39,107 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:09:39,107 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:09:39,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-29 04:09:39,107 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-29 04:09:39,108 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:09:39,108 INFO L85 PathProgramCache]: Analyzing trace with hash -587952882, now seen corresponding path program 1 times [2023-11-29 04:09:39,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:09:39,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879002228] [2023-11-29 04:09:39,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:09:39,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:09:39,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:09:39,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:09:39,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:09:39,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879002228] [2023-11-29 04:09:39,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879002228] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:09:39,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:09:39,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 04:09:39,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382241022] [2023-11-29 04:09:39,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:09:39,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:09:39,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:09:39,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:09:39,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:09:39,324 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 92 [2023-11-29 04:09:39,324 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 59 transitions, 340 flow. Second operand has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:39,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:09:39,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 92 [2023-11-29 04:09:39,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:09:39,867 INFO L124 PetriNetUnfolderBase]: 1648/3246 cut-off events. [2023-11-29 04:09:39,867 INFO L125 PetriNetUnfolderBase]: For 4223/4272 co-relation queries the response was YES. [2023-11-29 04:09:39,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9216 conditions, 3246 events. 1648/3246 cut-off events. For 4223/4272 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 23220 event pairs, 664 based on Foata normal form. 19/3106 useless extension candidates. Maximal degree in co-relation 9202. Up to 1342 conditions per place. [2023-11-29 04:09:39,889 INFO L140 encePairwiseOnDemand]: 87/92 looper letters, 42 selfloop transitions, 2 changer transitions 21/87 dead transitions. [2023-11-29 04:09:39,890 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 87 transitions, 596 flow [2023-11-29 04:09:39,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 04:09:39,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 04:09:39,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 174 transitions. [2023-11-29 04:09:39,891 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3782608695652174 [2023-11-29 04:09:39,891 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 174 transitions. [2023-11-29 04:09:39,891 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 174 transitions. [2023-11-29 04:09:39,891 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:09:39,892 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 174 transitions. [2023-11-29 04:09:39,892 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 34.8) internal successors, (174), 5 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:39,893 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 92.0) internal successors, (552), 6 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:39,893 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 92.0) internal successors, (552), 6 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:39,894 INFO L175 Difference]: Start difference. First operand has 80 places, 59 transitions, 340 flow. Second operand 5 states and 174 transitions. [2023-11-29 04:09:39,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 87 transitions, 596 flow [2023-11-29 04:09:39,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 87 transitions, 521 flow, removed 14 selfloop flow, removed 11 redundant places. [2023-11-29 04:09:39,912 INFO L231 Difference]: Finished difference. Result has 71 places, 55 transitions, 252 flow [2023-11-29 04:09:39,912 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=252, PETRI_PLACES=71, PETRI_TRANSITIONS=55} [2023-11-29 04:09:39,913 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -26 predicate places. [2023-11-29 04:09:39,913 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 55 transitions, 252 flow [2023-11-29 04:09:39,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:39,913 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:09:39,913 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:09:39,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-29 04:09:39,914 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-29 04:09:39,914 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:09:39,914 INFO L85 PathProgramCache]: Analyzing trace with hash -966252436, now seen corresponding path program 2 times [2023-11-29 04:09:39,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:09:39,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255861730] [2023-11-29 04:09:39,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:09:39,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:09:39,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 04:09:39,989 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 04:09:40,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 04:09:40,092 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 04:09:40,092 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 04:09:40,093 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (84 of 85 remaining) [2023-11-29 04:09:40,095 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 85 remaining) [2023-11-29 04:09:40,095 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 85 remaining) [2023-11-29 04:09:40,096 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 85 remaining) [2023-11-29 04:09:40,096 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 85 remaining) [2023-11-29 04:09:40,096 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 85 remaining) [2023-11-29 04:09:40,096 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 85 remaining) [2023-11-29 04:09:40,096 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 85 remaining) [2023-11-29 04:09:40,096 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 85 remaining) [2023-11-29 04:09:40,097 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 85 remaining) [2023-11-29 04:09:40,097 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 85 remaining) [2023-11-29 04:09:40,097 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 85 remaining) [2023-11-29 04:09:40,097 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 85 remaining) [2023-11-29 04:09:40,097 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 85 remaining) [2023-11-29 04:09:40,097 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 85 remaining) [2023-11-29 04:09:40,097 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 85 remaining) [2023-11-29 04:09:40,097 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 85 remaining) [2023-11-29 04:09:40,098 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 85 remaining) [2023-11-29 04:09:40,098 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 85 remaining) [2023-11-29 04:09:40,098 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 85 remaining) [2023-11-29 04:09:40,098 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 85 remaining) [2023-11-29 04:09:40,098 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 85 remaining) [2023-11-29 04:09:40,098 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 85 remaining) [2023-11-29 04:09:40,098 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 85 remaining) [2023-11-29 04:09:40,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 85 remaining) [2023-11-29 04:09:40,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 85 remaining) [2023-11-29 04:09:40,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 85 remaining) [2023-11-29 04:09:40,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 85 remaining) [2023-11-29 04:09:40,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 85 remaining) [2023-11-29 04:09:40,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 85 remaining) [2023-11-29 04:09:40,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 85 remaining) [2023-11-29 04:09:40,100 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 85 remaining) [2023-11-29 04:09:40,100 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 85 remaining) [2023-11-29 04:09:40,100 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 85 remaining) [2023-11-29 04:09:40,100 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 85 remaining) [2023-11-29 04:09:40,100 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 85 remaining) [2023-11-29 04:09:40,100 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 85 remaining) [2023-11-29 04:09:40,100 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 85 remaining) [2023-11-29 04:09:40,100 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 85 remaining) [2023-11-29 04:09:40,101 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 85 remaining) [2023-11-29 04:09:40,101 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 85 remaining) [2023-11-29 04:09:40,101 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 85 remaining) [2023-11-29 04:09:40,101 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 85 remaining) [2023-11-29 04:09:40,101 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 85 remaining) [2023-11-29 04:09:40,101 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 85 remaining) [2023-11-29 04:09:40,101 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 85 remaining) [2023-11-29 04:09:40,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 85 remaining) [2023-11-29 04:09:40,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (37 of 85 remaining) [2023-11-29 04:09:40,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (36 of 85 remaining) [2023-11-29 04:09:40,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (35 of 85 remaining) [2023-11-29 04:09:40,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (34 of 85 remaining) [2023-11-29 04:09:40,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 85 remaining) [2023-11-29 04:09:40,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 85 remaining) [2023-11-29 04:09:40,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 85 remaining) [2023-11-29 04:09:40,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 85 remaining) [2023-11-29 04:09:40,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 85 remaining) [2023-11-29 04:09:40,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 85 remaining) [2023-11-29 04:09:40,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 85 remaining) [2023-11-29 04:09:40,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 85 remaining) [2023-11-29 04:09:40,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 85 remaining) [2023-11-29 04:09:40,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 85 remaining) [2023-11-29 04:09:40,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 85 remaining) [2023-11-29 04:09:40,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 85 remaining) [2023-11-29 04:09:40,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 85 remaining) [2023-11-29 04:09:40,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 85 remaining) [2023-11-29 04:09:40,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 85 remaining) [2023-11-29 04:09:40,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 85 remaining) [2023-11-29 04:09:40,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 85 remaining) [2023-11-29 04:09:40,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 85 remaining) [2023-11-29 04:09:40,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 85 remaining) [2023-11-29 04:09:40,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 85 remaining) [2023-11-29 04:09:40,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 85 remaining) [2023-11-29 04:09:40,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 85 remaining) [2023-11-29 04:09:40,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 85 remaining) [2023-11-29 04:09:40,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 85 remaining) [2023-11-29 04:09:40,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 85 remaining) [2023-11-29 04:09:40,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 85 remaining) [2023-11-29 04:09:40,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 85 remaining) [2023-11-29 04:09:40,106 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 85 remaining) [2023-11-29 04:09:40,106 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 85 remaining) [2023-11-29 04:09:40,106 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 85 remaining) [2023-11-29 04:09:40,106 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 85 remaining) [2023-11-29 04:09:40,106 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 85 remaining) [2023-11-29 04:09:40,106 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 85 remaining) [2023-11-29 04:09:40,106 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 85 remaining) [2023-11-29 04:09:40,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-29 04:09:40,107 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:09:40,114 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-29 04:09:40,114 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 04:09:40,180 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre30 could not be translated [2023-11-29 04:09:40,183 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre32 could not be translated [2023-11-29 04:09:40,188 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre34 could not be translated [2023-11-29 04:09:40,212 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 04:09:40 BasicIcfg [2023-11-29 04:09:40,213 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 04:09:40,213 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 04:09:40,213 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 04:09:40,213 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 04:09:40,214 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:09:16" (3/4) ... [2023-11-29 04:09:40,215 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 04:09:40,216 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 04:09:40,217 INFO L158 Benchmark]: Toolchain (without parser) took 25898.87ms. Allocated memory was 165.7MB in the beginning and 2.5GB in the end (delta: 2.4GB). Free memory was 132.4MB in the beginning and 1.4GB in the end (delta: -1.2GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2023-11-29 04:09:40,217 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 117.4MB. Free memory is still 72.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 04:09:40,218 INFO L158 Benchmark]: CACSL2BoogieTranslator took 493.09ms. Allocated memory is still 165.7MB. Free memory was 132.4MB in the beginning and 107.3MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-11-29 04:09:40,218 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.50ms. Allocated memory is still 165.7MB. Free memory was 107.3MB in the beginning and 104.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 04:09:40,218 INFO L158 Benchmark]: Boogie Preprocessor took 63.60ms. Allocated memory is still 165.7MB. Free memory was 104.5MB in the beginning and 99.8MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 04:09:40,219 INFO L158 Benchmark]: RCFGBuilder took 1290.35ms. Allocated memory was 165.7MB in the beginning and 201.3MB in the end (delta: 35.7MB). Free memory was 99.8MB in the beginning and 91.7MB in the end (delta: 8.1MB). Peak memory consumption was 45.5MB. Max. memory is 16.1GB. [2023-11-29 04:09:40,219 INFO L158 Benchmark]: TraceAbstraction took 23992.16ms. Allocated memory was 201.3MB in the beginning and 2.5GB in the end (delta: 2.3GB). Free memory was 90.7MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2023-11-29 04:09:40,219 INFO L158 Benchmark]: Witness Printer took 3.35ms. Allocated memory is still 2.5GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 04:09:40,221 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.20ms. Allocated memory is still 117.4MB. Free memory is still 72.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 493.09ms. Allocated memory is still 165.7MB. Free memory was 132.4MB in the beginning and 107.3MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.50ms. Allocated memory is still 165.7MB. Free memory was 107.3MB in the beginning and 104.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.60ms. Allocated memory is still 165.7MB. Free memory was 104.5MB in the beginning and 99.8MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1290.35ms. Allocated memory was 165.7MB in the beginning and 201.3MB in the end (delta: 35.7MB). Free memory was 99.8MB in the beginning and 91.7MB in the end (delta: 8.1MB). Peak memory consumption was 45.5MB. Max. memory is 16.1GB. * TraceAbstraction took 23992.16ms. Allocated memory was 201.3MB in the beginning and 2.5GB in the end (delta: 2.3GB). Free memory was 90.7MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. * Witness Printer took 3.35ms. Allocated memory is still 2.5GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre30 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre32 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre34 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p1_EAX = 0; [L732] 0 int __unbuffered_p1_EBX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L736] 0 int x = 0; [L737] 0 _Bool x$flush_delayed; [L738] 0 int x$mem_tmp; [L739] 0 _Bool x$r_buff0_thd0; [L740] 0 _Bool x$r_buff0_thd1; [L741] 0 _Bool x$r_buff0_thd2; [L742] 0 _Bool x$r_buff0_thd3; [L743] 0 _Bool x$r_buff1_thd0; [L744] 0 _Bool x$r_buff1_thd1; [L745] 0 _Bool x$r_buff1_thd2; [L746] 0 _Bool x$r_buff1_thd3; [L747] 0 _Bool x$read_delayed; [L748] 0 int *x$read_delayed_var; [L749] 0 int x$w_buff0; [L750] 0 _Bool x$w_buff0_used; [L751] 0 int x$w_buff1; [L752] 0 _Bool x$w_buff1_used; [L754] 0 int y = 0; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L848] 0 pthread_t t1681; [L849] FCALL, FORK 0 pthread_create(&t1681, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1681={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L850] 0 pthread_t t1682; [L851] FCALL, FORK 0 pthread_create(&t1682, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1681={6:0}, t1682={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L761] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 1 x$flush_delayed = weak$$choice2 [L764] EXPR 1 \read(x) [L764] 1 x$mem_tmp = x [L765] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L766] EXPR 1 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L766] EXPR 1 \read(x) [L766] EXPR 1 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L766] 1 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L767] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)))) [L768] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)))) [L769] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L770] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L771] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L772] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x$r_buff1_thd1 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L773] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L774] 1 __unbuffered_p0_EAX$read_delayed_var = &x [L775] EXPR 1 \read(x) [L775] 1 __unbuffered_p0_EAX = x [L776] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L776] EXPR 1 \read(x) [L776] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L776] 1 x = x$flush_delayed ? x$mem_tmp : x [L777] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L780] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L792] 2 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L795] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L798] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L799] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L800] 2 x$flush_delayed = weak$$choice2 [L801] EXPR 2 \read(x) [L801] 2 x$mem_tmp = x [L802] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L802] EXPR 2 \read(x) [L802] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L802] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L803] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L804] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L805] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L806] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L807] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L808] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L809] EXPR 2 \read(x) [L809] 2 __unbuffered_p1_EBX = x [L810] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L810] EXPR 2 \read(x) [L810] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L810] 2 x = x$flush_delayed ? x$mem_tmp : x [L811] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L852] 0 pthread_t t1683; [L853] FCALL, FORK 0 pthread_create(&t1683, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1681={6:0}, t1682={7:0}, t1683={5:0}, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L823] 3 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L826] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L826] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L826] EXPR 3 \read(x) [L826] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L826] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L826] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L827] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L828] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L829] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L830] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L785] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L816] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L833] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1681={6:0}, t1682={7:0}, t1683={5:0}, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L859] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L859] EXPR 0 \read(x) [L859] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L859] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L859] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L860] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L861] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L862] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L863] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1681={6:0}, t1682={7:0}, t1683={5:0}, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L866] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L867] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L867] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L867] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L867] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L867] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L867] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L868] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1681={6:0}, t1682={7:0}, t1683={5:0}, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L870] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L18] 0 __assert_fail ("0", "rfi006_power.oepc.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 846]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed 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. - 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: 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 149 locations, 85 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: 23.7s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 19.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1144 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 958 mSDsluCounter, 91 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 46 mSDsCounter, 112 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2278 IncrementalHoareTripleChecker+Invalid, 2390 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 112 mSolverCounterUnsat, 45 mSDtfsCounter, 2278 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 72 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=439occurred in iteration=16, InterpolantAutomatonStates: 77, 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.4s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 280 NumberOfCodeBlocks, 280 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 229 ConstructedInterpolants, 0 QuantifiedInterpolants, 1778 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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-29 04:09:40,243 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya/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-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi006_power.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 35f6655b445fc5bf4a2ebfcafed490ee38fb52115875b19e3a717aa5f56b5e77 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 04:09:42,251 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 04:09:42,324 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-29 04:09:42,330 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 04:09:42,330 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 04:09:42,357 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 04:09:42,358 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 04:09:42,359 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 04:09:42,359 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 04:09:42,360 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 04:09:42,361 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 04:09:42,361 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 04:09:42,362 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 04:09:42,363 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 04:09:42,363 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 04:09:42,364 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 04:09:42,365 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 04:09:42,365 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 04:09:42,366 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 04:09:42,366 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 04:09:42,367 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 04:09:42,367 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 04:09:42,368 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 04:09:42,368 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 04:09:42,369 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 04:09:42,369 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 04:09:42,369 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 04:09:42,370 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 04:09:42,370 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 04:09:42,370 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 04:09:42,371 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 04:09:42,371 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 04:09:42,371 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 04:09:42,372 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 04:09:42,372 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:09:42,372 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 04:09:42,372 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 04:09:42,373 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 04:09:42,373 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 04:09:42,373 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 04:09:42,373 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 04:09:42,374 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 04:09:42,374 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 04:09:42,374 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 04:09:42,374 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_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 35f6655b445fc5bf4a2ebfcafed490ee38fb52115875b19e3a717aa5f56b5e77 [2023-11-29 04:09:42,657 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 04:09:42,677 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 04:09:42,680 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 04:09:42,681 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 04:09:42,681 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 04:09:42,683 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/pthread-wmm/rfi006_power.oepc.i [2023-11-29 04:09:45,515 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 04:09:45,767 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 04:09:45,768 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/sv-benchmarks/c/pthread-wmm/rfi006_power.oepc.i [2023-11-29 04:09:45,784 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya/data/43dd64865/eca57fd2b7ac4c228aed8087210ded79/FLAG04a0b42f8 [2023-11-29 04:09:45,798 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya/data/43dd64865/eca57fd2b7ac4c228aed8087210ded79 [2023-11-29 04:09:45,801 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 04:09:45,802 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 04:09:45,804 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 04:09:45,804 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 04:09:45,809 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 04:09:45,810 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:09:45" (1/1) ... [2023-11-29 04:09:45,811 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6eb89f82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:09:45, skipping insertion in model container [2023-11-29 04:09:45,811 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:09:45" (1/1) ... [2023-11-29 04:09:45,864 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 04:09:46,258 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:09:46,273 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 04:09:46,334 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:09:46,368 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 04:09:46,368 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 04:09:46,374 INFO L206 MainTranslator]: Completed translation [2023-11-29 04:09:46,375 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:09:46 WrapperNode [2023-11-29 04:09:46,375 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 04:09:46,376 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 04:09:46,376 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 04:09:46,376 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 04:09:46,383 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:09:46" (1/1) ... [2023-11-29 04:09:46,406 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:09:46" (1/1) ... [2023-11-29 04:09:46,431 INFO L138 Inliner]: procedures = 180, calls = 76, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 140 [2023-11-29 04:09:46,432 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 04:09:46,433 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 04:09:46,433 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 04:09:46,433 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 04:09:46,442 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:09:46" (1/1) ... [2023-11-29 04:09:46,442 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:09:46" (1/1) ... [2023-11-29 04:09:46,447 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:09:46" (1/1) ... [2023-11-29 04:09:46,472 INFO L175 MemorySlicer]: Split 26 memory accesses to 5 slices as follows [2, 1, 1, 1, 21]. 81 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 0, 0, 1]. The 10 writes are split as follows [0, 1, 1, 1, 7]. [2023-11-29 04:09:46,472 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:09:46" (1/1) ... [2023-11-29 04:09:46,472 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:09:46" (1/1) ... [2023-11-29 04:09:46,487 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:09:46" (1/1) ... [2023-11-29 04:09:46,490 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:09:46" (1/1) ... [2023-11-29 04:09:46,494 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:09:46" (1/1) ... [2023-11-29 04:09:46,497 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:09:46" (1/1) ... [2023-11-29 04:09:46,503 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 04:09:46,504 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 04:09:46,505 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 04:09:46,505 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 04:09:46,506 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:09:46" (1/1) ... [2023-11-29 04:09:46,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:09:46,521 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:09:46,531 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 04:09:46,547 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 04:09:46,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-11-29 04:09:46,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-11-29 04:09:46,576 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-11-29 04:09:46,576 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2023-11-29 04:09:46,576 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2023-11-29 04:09:46,576 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-29 04:09:46,576 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 04:09:46,576 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 04:09:46,577 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 04:09:46,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-29 04:09:46,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-29 04:09:46,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-29 04:09:46,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-11-29 04:09:46,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2023-11-29 04:09:46,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 04:09:46,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-29 04:09:46,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-29 04:09:46,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-11-29 04:09:46,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2023-11-29 04:09:46,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2023-11-29 04:09:46,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2023-11-29 04:09:46,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2023-11-29 04:09:46,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2023-11-29 04:09:46,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2023-11-29 04:09:46,580 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-29 04:09:46,580 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-29 04:09:46,580 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-29 04:09:46,581 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-29 04:09:46,581 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-29 04:09:46,581 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-29 04:09:46,581 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-29 04:09:46,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 04:09:46,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 04:09:46,583 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-29 04:09:46,770 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 04:09:46,772 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 04:09:47,386 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 04:09:48,068 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 04:09:48,069 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-29 04:09:48,069 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:09:48 BoogieIcfgContainer [2023-11-29 04:09:48,069 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 04:09:48,072 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 04:09:48,072 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 04:09:48,075 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 04:09:48,075 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 04:09:45" (1/3) ... [2023-11-29 04:09:48,076 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3442357b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:09:48, skipping insertion in model container [2023-11-29 04:09:48,076 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:09:46" (2/3) ... [2023-11-29 04:09:48,076 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3442357b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:09:48, skipping insertion in model container [2023-11-29 04:09:48,076 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:09:48" (3/3) ... [2023-11-29 04:09:48,078 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi006_power.oepc.i [2023-11-29 04:09:48,096 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 04:09:48,096 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 48 error locations. [2023-11-29 04:09:48,096 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 04:09:48,260 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-29 04:09:48,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 196 flow [2023-11-29 04:09:48,352 INFO L124 PetriNetUnfolderBase]: 2/89 cut-off events. [2023-11-29 04:09:48,352 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 04:09:48,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 89 events. 2/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 343 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 88. Up to 2 conditions per place. [2023-11-29 04:09:48,357 INFO L82 GeneralOperation]: Start removeDead. Operand has 100 places, 92 transitions, 196 flow [2023-11-29 04:09:48,363 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 97 places, 89 transitions, 187 flow [2023-11-29 04:09:48,373 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 04:09:48,380 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;@3752de39, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 04:09:48,380 INFO L358 AbstractCegarLoop]: Starting to check reachability of 85 error locations. [2023-11-29 04:09:48,384 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 04:09:48,384 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-29 04:09:48,384 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 04:09:48,384 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:09:48,385 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 04:09:48,386 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-29 04:09:48,391 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:09:48,391 INFO L85 PathProgramCache]: Analyzing trace with hash 27497, now seen corresponding path program 1 times [2023-11-29 04:09:48,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:09:48,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [208017749] [2023-11-29 04:09:48,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:09:48,405 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:09:48,405 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:09:48,406 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:09:48,411 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-29 04:09:48,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:09:48,600 INFO L262 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 04:09:48,604 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:09:48,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 04:09:48,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:09:48,683 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:09:48,684 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:09:48,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [208017749] [2023-11-29 04:09:48,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [208017749] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:09:48,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:09:48,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 04:09:48,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657096354] [2023-11-29 04:09:48,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:09:48,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:09:48,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:09:48,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:09:48,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:09:48,761 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 92 [2023-11-29 04:09:48,764 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 89 transitions, 187 flow. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:48,764 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:09:48,764 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 92 [2023-11-29 04:09:48,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:09:52,257 INFO L124 PetriNetUnfolderBase]: 9214/14346 cut-off events. [2023-11-29 04:09:52,257 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2023-11-29 04:09:52,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27439 conditions, 14346 events. 9214/14346 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 1466. Compared 119232 event pairs, 7964 based on Foata normal form. 500/7979 useless extension candidates. Maximal degree in co-relation 27425. Up to 11276 conditions per place. [2023-11-29 04:09:52,386 INFO L140 encePairwiseOnDemand]: 63/92 looper letters, 53 selfloop transitions, 2 changer transitions 0/78 dead transitions. [2023-11-29 04:09:52,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 78 transitions, 275 flow [2023-11-29 04:09:52,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:09:52,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:09:52,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 184 transitions. [2023-11-29 04:09:52,397 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2023-11-29 04:09:52,398 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 184 transitions. [2023-11-29 04:09:52,398 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 184 transitions. [2023-11-29 04:09:52,400 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:09:52,402 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 184 transitions. [2023-11-29 04:09:52,404 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:52,408 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 92.0) internal successors, (368), 4 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:52,408 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 92.0) internal successors, (368), 4 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:52,410 INFO L175 Difference]: Start difference. First operand has 97 places, 89 transitions, 187 flow. Second operand 3 states and 184 transitions. [2023-11-29 04:09:52,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 78 transitions, 275 flow [2023-11-29 04:09:52,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 78 transitions, 272 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-29 04:09:52,419 INFO L231 Difference]: Finished difference. Result has 70 places, 61 transitions, 132 flow [2023-11-29 04:09:52,420 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=132, PETRI_PLACES=70, PETRI_TRANSITIONS=61} [2023-11-29 04:09:52,423 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -27 predicate places. [2023-11-29 04:09:52,423 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 61 transitions, 132 flow [2023-11-29 04:09:52,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:52,424 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:09:52,424 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 04:09:52,428 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-11-29 04:09:52,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:09:52,625 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-29 04:09:52,626 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:09:52,626 INFO L85 PathProgramCache]: Analyzing trace with hash 27498, now seen corresponding path program 1 times [2023-11-29 04:09:52,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:09:52,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [406424339] [2023-11-29 04:09:52,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:09:52,627 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:09:52,628 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:09:52,629 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:09:52,630 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-29 04:09:52,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:09:52,757 INFO L262 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 04:09:52,758 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:09:52,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 04:09:52,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:09:52,782 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:09:52,782 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:09:52,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [406424339] [2023-11-29 04:09:52,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [406424339] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:09:52,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:09:52,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 04:09:52,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997699051] [2023-11-29 04:09:52,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:09:52,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:09:52,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:09:52,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:09:52,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:09:52,814 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 92 [2023-11-29 04:09:52,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 61 transitions, 132 flow. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:52,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:09:52,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 92 [2023-11-29 04:09:52,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:09:55,326 INFO L124 PetriNetUnfolderBase]: 9214/14345 cut-off events. [2023-11-29 04:09:55,326 INFO L125 PetriNetUnfolderBase]: For 250/250 co-relation queries the response was YES. [2023-11-29 04:09:55,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27686 conditions, 14345 events. 9214/14345 cut-off events. For 250/250 co-relation queries the response was YES. Maximal size of possible extension queue 1466. Compared 119342 event pairs, 7964 based on Foata normal form. 1/7479 useless extension candidates. Maximal degree in co-relation 27675. Up to 11275 conditions per place. [2023-11-29 04:09:55,452 INFO L140 encePairwiseOnDemand]: 89/92 looper letters, 52 selfloop transitions, 2 changer transitions 0/77 dead transitions. [2023-11-29 04:09:55,452 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 77 transitions, 272 flow [2023-11-29 04:09:55,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:09:55,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:09:55,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 136 transitions. [2023-11-29 04:09:55,454 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4927536231884058 [2023-11-29 04:09:55,454 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 136 transitions. [2023-11-29 04:09:55,454 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 136 transitions. [2023-11-29 04:09:55,455 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:09:55,455 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 136 transitions. [2023-11-29 04:09:55,456 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:55,458 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 92.0) internal successors, (368), 4 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:55,459 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 92.0) internal successors, (368), 4 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:55,459 INFO L175 Difference]: Start difference. First operand has 70 places, 61 transitions, 132 flow. Second operand 3 states and 136 transitions. [2023-11-29 04:09:55,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 77 transitions, 272 flow [2023-11-29 04:09:55,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 77 transitions, 268 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:09:55,484 INFO L231 Difference]: Finished difference. Result has 69 places, 60 transitions, 130 flow [2023-11-29 04:09:55,484 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=69, PETRI_TRANSITIONS=60} [2023-11-29 04:09:55,485 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -28 predicate places. [2023-11-29 04:09:55,485 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 60 transitions, 130 flow [2023-11-29 04:09:55,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:55,486 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:09:55,486 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 04:09:55,488 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-11-29 04:09:55,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:09:55,687 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-29 04:09:55,687 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:09:55,687 INFO L85 PathProgramCache]: Analyzing trace with hash 820057365, now seen corresponding path program 1 times [2023-11-29 04:09:55,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:09:55,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [381263698] [2023-11-29 04:09:55,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:09:55,689 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:09:55,689 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:09:55,690 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:09:55,690 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-29 04:09:55,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:09:55,806 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 04:09:55,807 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:09:55,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 04:09:55,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:09:55,820 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:09:55,820 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:09:55,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [381263698] [2023-11-29 04:09:55,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [381263698] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:09:55,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:09:55,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:09:55,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061472263] [2023-11-29 04:09:55,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:09:55,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:09:55,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:09:55,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:09:55,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:09:55,852 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 92 [2023-11-29 04:09:55,853 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 60 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:55,853 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:09:55,853 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 92 [2023-11-29 04:09:55,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:09:58,085 INFO L124 PetriNetUnfolderBase]: 9218/14296 cut-off events. [2023-11-29 04:09:58,085 INFO L125 PetriNetUnfolderBase]: For 250/250 co-relation queries the response was YES. [2023-11-29 04:09:58,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27646 conditions, 14296 events. 9218/14296 cut-off events. For 250/250 co-relation queries the response was YES. Maximal size of possible extension queue 1466. Compared 118615 event pairs, 8014 based on Foata normal form. 0/7438 useless extension candidates. Maximal degree in co-relation 27635. Up to 11278 conditions per place. [2023-11-29 04:09:58,258 INFO L140 encePairwiseOnDemand]: 89/92 looper letters, 53 selfloop transitions, 2 changer transitions 0/76 dead transitions. [2023-11-29 04:09:58,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 76 transitions, 272 flow [2023-11-29 04:09:58,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:09:58,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:09:58,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2023-11-29 04:09:58,260 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4855072463768116 [2023-11-29 04:09:58,261 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 134 transitions. [2023-11-29 04:09:58,261 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 134 transitions. [2023-11-29 04:09:58,261 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:09:58,261 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 134 transitions. [2023-11-29 04:09:58,262 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:58,263 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 92.0) internal successors, (368), 4 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:58,264 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 92.0) internal successors, (368), 4 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:58,264 INFO L175 Difference]: Start difference. First operand has 69 places, 60 transitions, 130 flow. Second operand 3 states and 134 transitions. [2023-11-29 04:09:58,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 76 transitions, 272 flow [2023-11-29 04:09:58,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 76 transitions, 268 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:09:58,283 INFO L231 Difference]: Finished difference. Result has 68 places, 59 transitions, 128 flow [2023-11-29 04:09:58,284 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=68, PETRI_TRANSITIONS=59} [2023-11-29 04:09:58,284 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -29 predicate places. [2023-11-29 04:09:58,285 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 59 transitions, 128 flow [2023-11-29 04:09:58,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:58,285 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:09:58,285 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 04:09:58,287 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-11-29 04:09:58,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:09:58,486 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-29 04:09:58,486 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:09:58,486 INFO L85 PathProgramCache]: Analyzing trace with hash 820057366, now seen corresponding path program 1 times [2023-11-29 04:09:58,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:09:58,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [900734471] [2023-11-29 04:09:58,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:09:58,487 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:09:58,487 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:09:58,488 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:09:58,489 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-29 04:09:58,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:09:58,586 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 04:09:58,588 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:09:58,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 04:09:58,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:09:58,606 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:09:58,606 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:09:58,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [900734471] [2023-11-29 04:09:58,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [900734471] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:09:58,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:09:58,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:09:58,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121032360] [2023-11-29 04:09:58,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:09:58,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:09:58,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:09:58,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:09:58,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:09:58,639 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 92 [2023-11-29 04:09:58,640 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 59 transitions, 128 flow. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:09:58,640 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:09:58,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 92 [2023-11-29 04:09:58,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:10:00,439 INFO L124 PetriNetUnfolderBase]: 9214/14279 cut-off events. [2023-11-29 04:10:00,439 INFO L125 PetriNetUnfolderBase]: For 254/254 co-relation queries the response was YES. [2023-11-29 04:10:00,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27624 conditions, 14279 events. 9214/14279 cut-off events. For 254/254 co-relation queries the response was YES. Maximal size of possible extension queue 1466. Compared 121895 event pairs, 8010 based on Foata normal form. 5/7424 useless extension candidates. Maximal degree in co-relation 27614. Up to 11269 conditions per place. [2023-11-29 04:10:00,509 INFO L140 encePairwiseOnDemand]: 89/92 looper letters, 52 selfloop transitions, 2 changer transitions 0/75 dead transitions. [2023-11-29 04:10:00,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 75 transitions, 268 flow [2023-11-29 04:10:00,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:10:00,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:10:00,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 136 transitions. [2023-11-29 04:10:00,511 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4927536231884058 [2023-11-29 04:10:00,511 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 136 transitions. [2023-11-29 04:10:00,511 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 136 transitions. [2023-11-29 04:10:00,511 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:10:00,511 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 136 transitions. [2023-11-29 04:10:00,512 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:10:00,513 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 92.0) internal successors, (368), 4 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:10:00,514 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 92.0) internal successors, (368), 4 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:10:00,514 INFO L175 Difference]: Start difference. First operand has 68 places, 59 transitions, 128 flow. Second operand 3 states and 136 transitions. [2023-11-29 04:10:00,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 75 transitions, 268 flow [2023-11-29 04:10:00,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 75 transitions, 264 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:10:00,528 INFO L231 Difference]: Finished difference. Result has 67 places, 58 transitions, 126 flow [2023-11-29 04:10:00,529 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=67, PETRI_TRANSITIONS=58} [2023-11-29 04:10:00,529 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -30 predicate places. [2023-11-29 04:10:00,529 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 58 transitions, 126 flow [2023-11-29 04:10:00,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:10:00,530 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:10:00,530 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 04:10:00,532 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-11-29 04:10:00,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:10:00,731 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-29 04:10:00,731 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:10:00,731 INFO L85 PathProgramCache]: Analyzing trace with hash 820060032, now seen corresponding path program 1 times [2023-11-29 04:10:00,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:10:00,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [99790594] [2023-11-29 04:10:00,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:10:00,732 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:10:00,732 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:10:00,733 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:10:00,734 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-29 04:10:00,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:10:00,828 INFO L262 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 04:10:00,829 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:10:00,869 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2023-11-29 04:10:00,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2023-11-29 04:10:00,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:10:00,905 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:10:00,905 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:10:00,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [99790594] [2023-11-29 04:10:00,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [99790594] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:10:00,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:10:00,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 04:10:00,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563011763] [2023-11-29 04:10:00,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:10:00,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:10:00,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:10:00,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:10:00,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:10:00,928 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 92 [2023-11-29 04:10:00,929 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 58 transitions, 126 flow. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:10:00,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:10:00,929 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 92 [2023-11-29 04:10:00,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:10:02,276 INFO L124 PetriNetUnfolderBase]: 3959/6369 cut-off events. [2023-11-29 04:10:02,277 INFO L125 PetriNetUnfolderBase]: For 115/115 co-relation queries the response was YES. [2023-11-29 04:10:02,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12262 conditions, 6369 events. 3959/6369 cut-off events. For 115/115 co-relation queries the response was YES. Maximal size of possible extension queue 606. Compared 49056 event pairs, 3059 based on Foata normal form. 0/4016 useless extension candidates. Maximal degree in co-relation 12252. Up to 4120 conditions per place. [2023-11-29 04:10:02,316 INFO L140 encePairwiseOnDemand]: 83/92 looper letters, 45 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2023-11-29 04:10:02,316 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 68 transitions, 240 flow [2023-11-29 04:10:02,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:10:02,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:10:02,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2023-11-29 04:10:02,317 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-11-29 04:10:02,318 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 138 transitions. [2023-11-29 04:10:02,318 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 138 transitions. [2023-11-29 04:10:02,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:10:02,318 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 138 transitions. [2023-11-29 04:10:02,319 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:10:02,320 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 92.0) internal successors, (368), 4 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:10:02,320 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 92.0) internal successors, (368), 4 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:10:02,321 INFO L175 Difference]: Start difference. First operand has 67 places, 58 transitions, 126 flow. Second operand 3 states and 138 transitions. [2023-11-29 04:10:02,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 68 transitions, 240 flow [2023-11-29 04:10:02,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 68 transitions, 236 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:10:02,324 INFO L231 Difference]: Finished difference. Result has 66 places, 56 transitions, 134 flow [2023-11-29 04:10:02,324 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=134, PETRI_PLACES=66, PETRI_TRANSITIONS=56} [2023-11-29 04:10:02,325 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -31 predicate places. [2023-11-29 04:10:02,325 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 56 transitions, 134 flow [2023-11-29 04:10:02,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:10:02,326 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:10:02,326 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 04:10:02,328 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-11-29 04:10:02,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:10:02,526 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-29 04:10:02,527 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:10:02,527 INFO L85 PathProgramCache]: Analyzing trace with hash 820060033, now seen corresponding path program 1 times [2023-11-29 04:10:02,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:10:02,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1784727463] [2023-11-29 04:10:02,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:10:02,528 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:10:02,528 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:10:02,529 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:10:02,530 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-29 04:10:02,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:10:02,637 INFO L262 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 04:10:02,638 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:10:02,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:10:02,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 04:10:02,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:10:02,720 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:10:02,721 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:10:02,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1784727463] [2023-11-29 04:10:02,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1784727463] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:10:02,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:10:02,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 04:10:02,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841369181] [2023-11-29 04:10:02,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:10:02,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:10:02,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:10:02,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:10:02,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:10:02,756 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 92 [2023-11-29 04:10:02,756 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 56 transitions, 134 flow. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:10:02,756 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:10:02,757 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 92 [2023-11-29 04:10:02,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:10:03,273 INFO L124 PetriNetUnfolderBase]: 1120/1941 cut-off events. [2023-11-29 04:10:03,273 INFO L125 PetriNetUnfolderBase]: For 95/95 co-relation queries the response was YES. [2023-11-29 04:10:03,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3945 conditions, 1941 events. 1120/1941 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 13268 event pairs, 1120 based on Foata normal form. 0/1810 useless extension candidates. Maximal degree in co-relation 3933. Up to 1693 conditions per place. [2023-11-29 04:10:03,284 INFO L140 encePairwiseOnDemand]: 84/92 looper letters, 27 selfloop transitions, 1 changer transitions 0/49 dead transitions. [2023-11-29 04:10:03,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 49 transitions, 176 flow [2023-11-29 04:10:03,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:10:03,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:10:03,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2023-11-29 04:10:03,285 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4311594202898551 [2023-11-29 04:10:03,285 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 119 transitions. [2023-11-29 04:10:03,286 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 119 transitions. [2023-11-29 04:10:03,286 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:10:03,286 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 119 transitions. [2023-11-29 04:10:03,287 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-29 04:10:03,288 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 92.0) internal successors, (368), 4 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:10:03,289 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 92.0) internal successors, (368), 4 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:10:03,289 INFO L175 Difference]: Start difference. First operand has 66 places, 56 transitions, 134 flow. Second operand 3 states and 119 transitions. [2023-11-29 04:10:03,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 49 transitions, 176 flow [2023-11-29 04:10:03,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 49 transitions, 172 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:10:03,292 INFO L231 Difference]: Finished difference. Result has 59 places, 49 transitions, 118 flow [2023-11-29 04:10:03,292 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=59, PETRI_TRANSITIONS=49} [2023-11-29 04:10:03,293 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -38 predicate places. [2023-11-29 04:10:03,293 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 49 transitions, 118 flow [2023-11-29 04:10:03,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:10:03,293 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:10:03,293 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:10:03,296 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-11-29 04:10:03,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:10:03,494 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-29 04:10:03,494 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:10:03,495 INFO L85 PathProgramCache]: Analyzing trace with hash 555873265, now seen corresponding path program 1 times [2023-11-29 04:10:03,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:10:03,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [670803638] [2023-11-29 04:10:03,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:10:03,495 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:10:03,495 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:10:03,496 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:10:03,497 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-11-29 04:10:03,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:10:03,613 INFO L262 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 04:10:03,615 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:10:03,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 04:10:03,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:10:03,633 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:10:03,634 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:10:03,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [670803638] [2023-11-29 04:10:03,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [670803638] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:10:03,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:10:03,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:10:03,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191524467] [2023-11-29 04:10:03,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:10:03,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:10:03,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:10:03,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:10:03,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:10:03,673 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 92 [2023-11-29 04:10:03,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 49 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:10:03,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:10:03,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 92 [2023-11-29 04:10:03,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:10:04,180 INFO L124 PetriNetUnfolderBase]: 1120/1932 cut-off events. [2023-11-29 04:10:04,180 INFO L125 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2023-11-29 04:10:04,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3900 conditions, 1932 events. 1120/1932 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 13172 event pairs, 580 based on Foata normal form. 9/1825 useless extension candidates. Maximal degree in co-relation 3893. Up to 993 conditions per place. [2023-11-29 04:10:04,191 INFO L140 encePairwiseOnDemand]: 89/92 looper letters, 33 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2023-11-29 04:10:04,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 55 transitions, 200 flow [2023-11-29 04:10:04,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:10:04,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:10:04,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2023-11-29 04:10:04,193 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42391304347826086 [2023-11-29 04:10:04,193 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 117 transitions. [2023-11-29 04:10:04,193 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 117 transitions. [2023-11-29 04:10:04,194 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:10:04,194 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 117 transitions. [2023-11-29 04:10:04,194 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-29 04:10:04,196 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 92.0) internal successors, (368), 4 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:10:04,196 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 92.0) internal successors, (368), 4 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:10:04,196 INFO L175 Difference]: Start difference. First operand has 59 places, 49 transitions, 118 flow. Second operand 3 states and 117 transitions. [2023-11-29 04:10:04,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 55 transitions, 200 flow [2023-11-29 04:10:04,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 55 transitions, 199 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 04:10:04,199 INFO L231 Difference]: Finished difference. Result has 59 places, 48 transitions, 119 flow [2023-11-29 04:10:04,199 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=57, 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=119, PETRI_PLACES=59, PETRI_TRANSITIONS=48} [2023-11-29 04:10:04,200 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -38 predicate places. [2023-11-29 04:10:04,200 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 48 transitions, 119 flow [2023-11-29 04:10:04,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:10:04,200 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:10:04,200 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:10:04,203 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-11-29 04:10:04,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:10:04,401 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-29 04:10:04,402 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:10:04,402 INFO L85 PathProgramCache]: Analyzing trace with hash 555873264, now seen corresponding path program 1 times [2023-11-29 04:10:04,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:10:04,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1049461552] [2023-11-29 04:10:04,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:10:04,403 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:10:04,403 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:10:04,404 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:10:04,405 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-11-29 04:10:04,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:10:04,512 INFO L262 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 04:10:04,513 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:10:04,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 04:10:04,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:10:04,524 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:10:04,524 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:10:04,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1049461552] [2023-11-29 04:10:04,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1049461552] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:10:04,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:10:04,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:10:04,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576649742] [2023-11-29 04:10:04,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:10:04,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:10:04,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:10:04,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:10:04,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:10:04,547 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 92 [2023-11-29 04:10:04,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 48 transitions, 119 flow. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:10:04,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:10:04,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 92 [2023-11-29 04:10:04,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:10:04,989 INFO L124 PetriNetUnfolderBase]: 1132/1935 cut-off events. [2023-11-29 04:10:04,989 INFO L125 PetriNetUnfolderBase]: For 101/101 co-relation queries the response was YES. [2023-11-29 04:10:04,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3969 conditions, 1935 events. 1132/1935 cut-off events. For 101/101 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 13112 event pairs, 580 based on Foata normal form. 0/1822 useless extension candidates. Maximal degree in co-relation 3962. Up to 1014 conditions per place. [2023-11-29 04:10:04,997 INFO L140 encePairwiseOnDemand]: 89/92 looper letters, 34 selfloop transitions, 2 changer transitions 0/54 dead transitions. [2023-11-29 04:10:04,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 54 transitions, 203 flow [2023-11-29 04:10:04,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:10:04,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:10:04,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 115 transitions. [2023-11-29 04:10:04,999 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2023-11-29 04:10:04,999 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 115 transitions. [2023-11-29 04:10:04,999 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 115 transitions. [2023-11-29 04:10:04,999 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:10:04,999 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 115 transitions. [2023-11-29 04:10:05,000 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:10:05,000 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 92.0) internal successors, (368), 4 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:10:05,000 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 92.0) internal successors, (368), 4 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:10:05,000 INFO L175 Difference]: Start difference. First operand has 59 places, 48 transitions, 119 flow. Second operand 3 states and 115 transitions. [2023-11-29 04:10:05,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 54 transitions, 203 flow [2023-11-29 04:10:05,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 54 transitions, 199 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:10:05,002 INFO L231 Difference]: Finished difference. Result has 58 places, 47 transitions, 117 flow [2023-11-29 04:10:05,002 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=56, 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=117, PETRI_PLACES=58, PETRI_TRANSITIONS=47} [2023-11-29 04:10:05,003 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -39 predicate places. [2023-11-29 04:10:05,003 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 47 transitions, 117 flow [2023-11-29 04:10:05,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:10:05,003 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:10:05,003 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:10:05,005 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2023-11-29 04:10:05,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:10:05,204 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-29 04:10:05,204 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:10:05,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1635865526, now seen corresponding path program 1 times [2023-11-29 04:10:05,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:10:05,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1808296389] [2023-11-29 04:10:05,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:10:05,205 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:10:05,205 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:10:05,206 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:10:05,207 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-11-29 04:10:05,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:10:05,313 INFO L262 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 04:10:05,314 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:10:05,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:10:05,339 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:10:05,339 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:10:05,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1808296389] [2023-11-29 04:10:05,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1808296389] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:10:05,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:10:05,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:10:05,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031636789] [2023-11-29 04:10:05,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:10:05,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:10:05,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:10:05,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:10:05,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:10:05,351 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 92 [2023-11-29 04:10:05,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 47 transitions, 117 flow. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:10:05,352 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:10:05,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 92 [2023-11-29 04:10:05,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:10:06,050 INFO L124 PetriNetUnfolderBase]: 2231/3642 cut-off events. [2023-11-29 04:10:06,050 INFO L125 PetriNetUnfolderBase]: For 140/140 co-relation queries the response was YES. [2023-11-29 04:10:06,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7373 conditions, 3642 events. 2231/3642 cut-off events. For 140/140 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 23661 event pairs, 247 based on Foata normal form. 80/3548 useless extension candidates. Maximal degree in co-relation 7366. Up to 2609 conditions per place. [2023-11-29 04:10:06,067 INFO L140 encePairwiseOnDemand]: 86/92 looper letters, 49 selfloop transitions, 5 changer transitions 1/70 dead transitions. [2023-11-29 04:10:06,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 70 transitions, 279 flow [2023-11-29 04:10:06,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:10:06,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 04:10:06,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 153 transitions. [2023-11-29 04:10:06,069 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4157608695652174 [2023-11-29 04:10:06,069 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 153 transitions. [2023-11-29 04:10:06,069 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 153 transitions. [2023-11-29 04:10:06,069 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:10:06,069 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 153 transitions. [2023-11-29 04:10:06,070 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:10:06,071 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 92.0) internal successors, (460), 5 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:10:06,071 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 92.0) internal successors, (460), 5 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:10:06,071 INFO L175 Difference]: Start difference. First operand has 58 places, 47 transitions, 117 flow. Second operand 4 states and 153 transitions. [2023-11-29 04:10:06,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 70 transitions, 279 flow [2023-11-29 04:10:06,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 70 transitions, 273 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:10:06,073 INFO L231 Difference]: Finished difference. Result has 61 places, 50 transitions, 147 flow [2023-11-29 04:10:06,073 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=147, PETRI_PLACES=61, PETRI_TRANSITIONS=50} [2023-11-29 04:10:06,074 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -36 predicate places. [2023-11-29 04:10:06,074 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 50 transitions, 147 flow [2023-11-29 04:10:06,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:10:06,075 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:10:06,075 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-29 04:10:06,077 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-11-29 04:10:06,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:10:06,275 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-29 04:10:06,276 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:10:06,276 INFO L85 PathProgramCache]: Analyzing trace with hash 68467795, now seen corresponding path program 1 times [2023-11-29 04:10:06,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:10:06,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1561542337] [2023-11-29 04:10:06,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:10:06,277 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:10:06,277 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:10:06,277 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:10:06,278 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-11-29 04:10:06,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:10:06,400 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 04:10:06,401 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:10:06,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:10:06,447 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:10:06,447 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:10:06,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1561542337] [2023-11-29 04:10:06,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1561542337] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:10:06,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:10:06,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:10:06,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315021653] [2023-11-29 04:10:06,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:10:06,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:10:06,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:10:06,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:10:06,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:10:06,459 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 92 [2023-11-29 04:10:06,459 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 147 flow. Second operand has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:10:06,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:10:06,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 92 [2023-11-29 04:10:06,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:10:06,930 INFO L124 PetriNetUnfolderBase]: 1195/2030 cut-off events. [2023-11-29 04:10:06,931 INFO L125 PetriNetUnfolderBase]: For 436/436 co-relation queries the response was YES. [2023-11-29 04:10:06,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4560 conditions, 2030 events. 1195/2030 cut-off events. For 436/436 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 11590 event pairs, 87 based on Foata normal form. 68/2012 useless extension candidates. Maximal degree in co-relation 4550. Up to 1141 conditions per place. [2023-11-29 04:10:06,939 INFO L140 encePairwiseOnDemand]: 86/92 looper letters, 59 selfloop transitions, 8 changer transitions 1/83 dead transitions. [2023-11-29 04:10:06,939 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 83 transitions, 370 flow [2023-11-29 04:10:06,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 04:10:06,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 04:10:06,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 190 transitions. [2023-11-29 04:10:06,940 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41304347826086957 [2023-11-29 04:10:06,940 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 190 transitions. [2023-11-29 04:10:06,940 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 190 transitions. [2023-11-29 04:10:06,941 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:10:06,941 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 190 transitions. [2023-11-29 04:10:06,941 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 38.0) internal successors, (190), 5 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:10:06,942 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 92.0) internal successors, (552), 6 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:10:06,942 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 92.0) internal successors, (552), 6 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:10:06,942 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 147 flow. Second operand 5 states and 190 transitions. [2023-11-29 04:10:06,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 83 transitions, 370 flow [2023-11-29 04:10:06,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 83 transitions, 360 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-29 04:10:06,945 INFO L231 Difference]: Finished difference. Result has 65 places, 53 transitions, 187 flow [2023-11-29 04:10:06,945 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=65, PETRI_TRANSITIONS=53} [2023-11-29 04:10:06,945 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -32 predicate places. [2023-11-29 04:10:06,945 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 53 transitions, 187 flow [2023-11-29 04:10:06,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:10:06,946 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:10:06,946 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:10:06,948 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2023-11-29 04:10:07,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:10:07,146 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-29 04:10:07,147 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:10:07,147 INFO L85 PathProgramCache]: Analyzing trace with hash 385438689, now seen corresponding path program 1 times [2023-11-29 04:10:07,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:10:07,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1375132003] [2023-11-29 04:10:07,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:10:07,148 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:10:07,148 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:10:07,148 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:10:07,149 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-11-29 04:10:07,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:10:07,287 INFO L262 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 04:10:07,288 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:10:07,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:10:07,332 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:10:07,332 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:10:07,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1375132003] [2023-11-29 04:10:07,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1375132003] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:10:07,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:10:07,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 04:10:07,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137268172] [2023-11-29 04:10:07,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:10:07,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 04:10:07,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:10:07,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 04:10:07,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:10:07,346 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 92 [2023-11-29 04:10:07,346 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 53 transitions, 187 flow. Second operand has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:10:07,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:10:07,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 92 [2023-11-29 04:10:07,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:10:07,720 INFO L124 PetriNetUnfolderBase]: 523/894 cut-off events. [2023-11-29 04:10:07,720 INFO L125 PetriNetUnfolderBase]: For 668/668 co-relation queries the response was YES. [2023-11-29 04:10:07,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2280 conditions, 894 events. 523/894 cut-off events. For 668/668 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3943 event pairs, 53 based on Foata normal form. 36/908 useless extension candidates. Maximal degree in co-relation 2268. Up to 268 conditions per place. [2023-11-29 04:10:07,724 INFO L140 encePairwiseOnDemand]: 86/92 looper letters, 47 selfloop transitions, 11 changer transitions 2/75 dead transitions. [2023-11-29 04:10:07,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 75 transitions, 351 flow [2023-11-29 04:10:07,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 04:10:07,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 04:10:07,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 206 transitions. [2023-11-29 04:10:07,726 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37318840579710144 [2023-11-29 04:10:07,726 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 206 transitions. [2023-11-29 04:10:07,726 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 206 transitions. [2023-11-29 04:10:07,726 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:10:07,726 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 206 transitions. [2023-11-29 04:10:07,727 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 34.333333333333336) internal successors, (206), 6 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:10:07,727 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 92.0) internal successors, (644), 7 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:10:07,728 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 92.0) internal successors, (644), 7 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:10:07,728 INFO L175 Difference]: Start difference. First operand has 65 places, 53 transitions, 187 flow. Second operand 6 states and 206 transitions. [2023-11-29 04:10:07,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 75 transitions, 351 flow [2023-11-29 04:10:07,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 75 transitions, 324 flow, removed 4 selfloop flow, removed 5 redundant places. [2023-11-29 04:10:07,730 INFO L231 Difference]: Finished difference. Result has 62 places, 47 transitions, 177 flow [2023-11-29 04:10:07,731 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=177, PETRI_PLACES=62, PETRI_TRANSITIONS=47} [2023-11-29 04:10:07,731 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -35 predicate places. [2023-11-29 04:10:07,731 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 47 transitions, 177 flow [2023-11-29 04:10:07,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:10:07,731 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:10:07,731 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:10:07,735 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2023-11-29 04:10:07,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:10:07,932 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-29 04:10:07,932 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:10:07,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1159550328, now seen corresponding path program 1 times [2023-11-29 04:10:07,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:10:07,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [147315712] [2023-11-29 04:10:07,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:10:07,933 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:10:07,933 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:10:07,934 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:10:07,935 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-11-29 04:10:08,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:10:08,120 INFO L262 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 04:10:08,122 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:10:08,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:10:08,171 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:10:08,171 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:10:08,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [147315712] [2023-11-29 04:10:08,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [147315712] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:10:08,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:10:08,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:10:08,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451397241] [2023-11-29 04:10:08,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:10:08,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:10:08,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:10:08,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:10:08,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:10:08,199 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 92 [2023-11-29 04:10:08,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 47 transitions, 177 flow. Second operand has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:10:08,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:10:08,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 92 [2023-11-29 04:10:08,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:10:08,366 INFO L124 PetriNetUnfolderBase]: 290/625 cut-off events. [2023-11-29 04:10:08,367 INFO L125 PetriNetUnfolderBase]: For 301/313 co-relation queries the response was YES. [2023-11-29 04:10:08,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1383 conditions, 625 events. 290/625 cut-off events. For 301/313 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3068 event pairs, 120 based on Foata normal form. 0/590 useless extension candidates. Maximal degree in co-relation 1371. Up to 350 conditions per place. [2023-11-29 04:10:08,371 INFO L140 encePairwiseOnDemand]: 89/92 looper letters, 32 selfloop transitions, 2 changer transitions 0/59 dead transitions. [2023-11-29 04:10:08,371 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 59 transitions, 273 flow [2023-11-29 04:10:08,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:10:08,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 04:10:08,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 147 transitions. [2023-11-29 04:10:08,372 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39945652173913043 [2023-11-29 04:10:08,373 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 147 transitions. [2023-11-29 04:10:08,373 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 147 transitions. [2023-11-29 04:10:08,373 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:10:08,373 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 147 transitions. [2023-11-29 04:10:08,374 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:10:08,375 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 92.0) internal successors, (460), 5 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:10:08,375 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 92.0) internal successors, (460), 5 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:10:08,375 INFO L175 Difference]: Start difference. First operand has 62 places, 47 transitions, 177 flow. Second operand 4 states and 147 transitions. [2023-11-29 04:10:08,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 59 transitions, 273 flow [2023-11-29 04:10:08,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 59 transitions, 217 flow, removed 10 selfloop flow, removed 8 redundant places. [2023-11-29 04:10:08,378 INFO L231 Difference]: Finished difference. Result has 55 places, 46 transitions, 123 flow [2023-11-29 04:10:08,378 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=123, PETRI_PLACES=55, PETRI_TRANSITIONS=46} [2023-11-29 04:10:08,379 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -42 predicate places. [2023-11-29 04:10:08,379 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 123 flow [2023-11-29 04:10:08,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:10:08,379 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:10:08,379 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:10:08,383 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-11-29 04:10:08,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:10:08,580 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-29 04:10:08,580 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:10:08,580 INFO L85 PathProgramCache]: Analyzing trace with hash 2037529773, now seen corresponding path program 1 times [2023-11-29 04:10:08,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:10:08,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1145927347] [2023-11-29 04:10:08,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:10:08,581 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:10:08,581 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:10:08,582 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:10:08,583 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-11-29 04:10:08,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:10:08,757 INFO L262 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 04:10:08,759 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:10:08,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:10:08,832 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:10:08,832 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:10:08,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1145927347] [2023-11-29 04:10:08,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1145927347] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:10:08,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:10:08,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:10:08,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505794023] [2023-11-29 04:10:08,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:10:08,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:10:08,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:10:08,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:10:08,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:10:08,874 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 92 [2023-11-29 04:10:08,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 123 flow. Second operand has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:10:08,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:10:08,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 92 [2023-11-29 04:10:08,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:10:09,040 INFO L124 PetriNetUnfolderBase]: 267/578 cut-off events. [2023-11-29 04:10:09,040 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2023-11-29 04:10:09,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1138 conditions, 578 events. 267/578 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2664 event pairs, 134 based on Foata normal form. 0/558 useless extension candidates. Maximal degree in co-relation 1131. Up to 343 conditions per place. [2023-11-29 04:10:09,043 INFO L140 encePairwiseOnDemand]: 89/92 looper letters, 28 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2023-11-29 04:10:09,043 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 55 transitions, 205 flow [2023-11-29 04:10:09,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:10:09,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 04:10:09,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 143 transitions. [2023-11-29 04:10:09,044 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38858695652173914 [2023-11-29 04:10:09,044 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 143 transitions. [2023-11-29 04:10:09,044 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 143 transitions. [2023-11-29 04:10:09,045 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:10:09,045 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 143 transitions. [2023-11-29 04:10:09,045 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:10:09,046 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 92.0) internal successors, (460), 5 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:10:09,046 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 92.0) internal successors, (460), 5 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:10:09,046 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 123 flow. Second operand 4 states and 143 transitions. [2023-11-29 04:10:09,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 55 transitions, 205 flow [2023-11-29 04:10:09,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 55 transitions, 202 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:10:09,048 INFO L231 Difference]: Finished difference. Result has 55 places, 45 transitions, 122 flow [2023-11-29 04:10:09,048 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=118, 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=4, PETRI_FLOW=122, PETRI_PLACES=55, PETRI_TRANSITIONS=45} [2023-11-29 04:10:09,049 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -42 predicate places. [2023-11-29 04:10:09,049 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 45 transitions, 122 flow [2023-11-29 04:10:09,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:10:09,049 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:10:09,049 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:10:09,053 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2023-11-29 04:10:09,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:10:09,250 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-29 04:10:09,250 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:10:09,250 INFO L85 PathProgramCache]: Analyzing trace with hash -357624676, now seen corresponding path program 1 times [2023-11-29 04:10:09,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:10:09,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1492770158] [2023-11-29 04:10:09,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:10:09,251 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:10:09,251 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:10:09,252 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:10:09,253 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-11-29 04:10:09,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:10:09,503 INFO L262 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-29 04:10:09,506 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:10:09,948 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#t1682~0#1.base_47| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#t1681~0#1.base_51| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#t1683~0#1.base_37| (_ BitVec 32))) (let ((.cse0 (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t1681~0#1.base_51| (_ bv1 1)))) (and (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t1681~0#1.base_51| (_ bv0 1)) |v_ULTIMATE.start_main_~#t1682~0#1.base_47| (_ bv0 1)) |v_ULTIMATE.start_main_~#t1683~0#1.base_37| (_ bv0 1))) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t1681~0#1.base_51|)) (= (_ bv0 1) (select .cse0 |v_ULTIMATE.start_main_~#t1682~0#1.base_47|)) (= (_ bv0 1) (select (store .cse0 |v_ULTIMATE.start_main_~#t1682~0#1.base_47| (_ bv1 1)) |v_ULTIMATE.start_main_~#t1683~0#1.base_37|))))) is different from true [2023-11-29 04:10:09,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-29 04:10:09,949 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:10:09,949 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:10:09,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1492770158] [2023-11-29 04:10:09,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1492770158] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:10:09,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:10:09,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:10:09,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051039915] [2023-11-29 04:10:09,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:10:09,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 04:10:09,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:10:09,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 04:10:09,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=14, Unknown=1, NotChecked=6, Total=30 [2023-11-29 04:10:09,951 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 92 [2023-11-29 04:10:09,952 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 45 transitions, 122 flow. Second operand has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:10:09,952 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:10:09,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 92 [2023-11-29 04:10:09,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:10:10,282 INFO L124 PetriNetUnfolderBase]: 282/567 cut-off events. [2023-11-29 04:10:10,282 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2023-11-29 04:10:10,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1161 conditions, 567 events. 282/567 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2700 event pairs, 56 based on Foata normal form. 8/554 useless extension candidates. Maximal degree in co-relation 1153. Up to 384 conditions per place. [2023-11-29 04:10:10,285 INFO L140 encePairwiseOnDemand]: 84/92 looper letters, 29 selfloop transitions, 7 changer transitions 0/57 dead transitions. [2023-11-29 04:10:10,285 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 57 transitions, 222 flow [2023-11-29 04:10:10,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 04:10:10,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 04:10:10,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 145 transitions. [2023-11-29 04:10:10,286 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.26268115942028986 [2023-11-29 04:10:10,287 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 145 transitions. [2023-11-29 04:10:10,287 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 145 transitions. [2023-11-29 04:10:10,287 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:10:10,287 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 145 transitions. [2023-11-29 04:10:10,288 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 24.166666666666668) internal successors, (145), 6 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:10:10,289 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 92.0) internal successors, (644), 7 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:10:10,289 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 92.0) internal successors, (644), 7 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:10:10,289 INFO L175 Difference]: Start difference. First operand has 55 places, 45 transitions, 122 flow. Second operand 6 states and 145 transitions. [2023-11-29 04:10:10,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 57 transitions, 222 flow [2023-11-29 04:10:10,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 57 transitions, 217 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:10:10,291 INFO L231 Difference]: Finished difference. Result has 59 places, 48 transitions, 151 flow [2023-11-29 04:10:10,291 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=151, PETRI_PLACES=59, PETRI_TRANSITIONS=48} [2023-11-29 04:10:10,292 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -38 predicate places. [2023-11-29 04:10:10,292 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 48 transitions, 151 flow [2023-11-29 04:10:10,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:10:10,292 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:10:10,293 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:10:10,296 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2023-11-29 04:10:10,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:10:10,493 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-29 04:10:10,493 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:10:10,493 INFO L85 PathProgramCache]: Analyzing trace with hash -144761140, now seen corresponding path program 1 times [2023-11-29 04:10:10,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:10:10,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1594285975] [2023-11-29 04:10:10,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:10:10,494 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:10:10,494 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:10:10,495 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:10:10,496 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-11-29 04:10:10,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:10:10,697 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 04:10:10,699 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:10:10,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:10:10,728 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:10:10,729 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:10:10,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1594285975] [2023-11-29 04:10:10,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1594285975] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:10:10,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:10:10,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 04:10:10,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618781773] [2023-11-29 04:10:10,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:10:10,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:10:10,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:10:10,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:10:10,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:10:10,738 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 92 [2023-11-29 04:10:10,739 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 48 transitions, 151 flow. Second operand has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:10:10,739 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:10:10,739 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 92 [2023-11-29 04:10:10,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:10:11,054 INFO L124 PetriNetUnfolderBase]: 626/1238 cut-off events. [2023-11-29 04:10:11,054 INFO L125 PetriNetUnfolderBase]: For 375/415 co-relation queries the response was YES. [2023-11-29 04:10:11,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2945 conditions, 1238 events. 626/1238 cut-off events. For 375/415 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 6997 event pairs, 302 based on Foata normal form. 8/1197 useless extension candidates. Maximal degree in co-relation 2936. Up to 556 conditions per place. [2023-11-29 04:10:11,059 INFO L140 encePairwiseOnDemand]: 86/92 looper letters, 46 selfloop transitions, 5 changer transitions 0/74 dead transitions. [2023-11-29 04:10:11,059 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 74 transitions, 344 flow [2023-11-29 04:10:11,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 04:10:11,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 04:10:11,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 176 transitions. [2023-11-29 04:10:11,061 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3826086956521739 [2023-11-29 04:10:11,061 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 176 transitions. [2023-11-29 04:10:11,061 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 176 transitions. [2023-11-29 04:10:11,061 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:10:11,061 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 176 transitions. [2023-11-29 04:10:11,062 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 35.2) internal successors, (176), 5 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:10:11,062 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 92.0) internal successors, (552), 6 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:10:11,062 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 92.0) internal successors, (552), 6 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:10:11,063 INFO L175 Difference]: Start difference. First operand has 59 places, 48 transitions, 151 flow. Second operand 5 states and 176 transitions. [2023-11-29 04:10:11,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 74 transitions, 344 flow [2023-11-29 04:10:11,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 74 transitions, 326 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-29 04:10:11,065 INFO L231 Difference]: Finished difference. Result has 62 places, 52 transitions, 180 flow [2023-11-29 04:10:11,065 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=180, PETRI_PLACES=62, PETRI_TRANSITIONS=52} [2023-11-29 04:10:11,065 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -35 predicate places. [2023-11-29 04:10:11,065 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 52 transitions, 180 flow [2023-11-29 04:10:11,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:10:11,065 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:10:11,065 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:10:11,069 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2023-11-29 04:10:11,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:10:11,266 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-29 04:10:11,266 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:10:11,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1935808358, now seen corresponding path program 2 times [2023-11-29 04:10:11,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:10:11,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2132651937] [2023-11-29 04:10:11,267 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 04:10:11,267 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:10:11,267 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:10:11,268 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:10:11,269 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-11-29 04:10:11,471 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-29 04:10:11,471 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-29 04:10:11,472 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 04:10:11,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 04:10:11,688 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-11-29 04:10:11,689 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 04:10:11,690 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (84 of 85 remaining) [2023-11-29 04:10:11,691 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 85 remaining) [2023-11-29 04:10:11,692 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 85 remaining) [2023-11-29 04:10:11,692 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 85 remaining) [2023-11-29 04:10:11,692 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 85 remaining) [2023-11-29 04:10:11,693 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 85 remaining) [2023-11-29 04:10:11,693 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 85 remaining) [2023-11-29 04:10:11,693 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 85 remaining) [2023-11-29 04:10:11,693 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 85 remaining) [2023-11-29 04:10:11,693 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 85 remaining) [2023-11-29 04:10:11,694 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 85 remaining) [2023-11-29 04:10:11,694 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 85 remaining) [2023-11-29 04:10:11,694 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 85 remaining) [2023-11-29 04:10:11,694 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 85 remaining) [2023-11-29 04:10:11,694 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 85 remaining) [2023-11-29 04:10:11,695 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 85 remaining) [2023-11-29 04:10:11,695 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 85 remaining) [2023-11-29 04:10:11,695 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 85 remaining) [2023-11-29 04:10:11,695 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 85 remaining) [2023-11-29 04:10:11,696 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 85 remaining) [2023-11-29 04:10:11,696 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 85 remaining) [2023-11-29 04:10:11,696 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 85 remaining) [2023-11-29 04:10:11,696 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 85 remaining) [2023-11-29 04:10:11,696 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 85 remaining) [2023-11-29 04:10:11,697 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 85 remaining) [2023-11-29 04:10:11,697 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 85 remaining) [2023-11-29 04:10:11,697 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 85 remaining) [2023-11-29 04:10:11,697 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 85 remaining) [2023-11-29 04:10:11,697 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 85 remaining) [2023-11-29 04:10:11,698 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 85 remaining) [2023-11-29 04:10:11,698 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 85 remaining) [2023-11-29 04:10:11,698 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 85 remaining) [2023-11-29 04:10:11,698 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 85 remaining) [2023-11-29 04:10:11,699 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 85 remaining) [2023-11-29 04:10:11,699 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 85 remaining) [2023-11-29 04:10:11,699 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 85 remaining) [2023-11-29 04:10:11,699 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 85 remaining) [2023-11-29 04:10:11,699 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 85 remaining) [2023-11-29 04:10:11,699 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 85 remaining) [2023-11-29 04:10:11,699 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 85 remaining) [2023-11-29 04:10:11,700 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 85 remaining) [2023-11-29 04:10:11,700 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 85 remaining) [2023-11-29 04:10:11,700 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 85 remaining) [2023-11-29 04:10:11,700 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 85 remaining) [2023-11-29 04:10:11,700 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 85 remaining) [2023-11-29 04:10:11,700 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 85 remaining) [2023-11-29 04:10:11,700 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 85 remaining) [2023-11-29 04:10:11,701 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (37 of 85 remaining) [2023-11-29 04:10:11,701 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (36 of 85 remaining) [2023-11-29 04:10:11,701 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (35 of 85 remaining) [2023-11-29 04:10:11,701 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (34 of 85 remaining) [2023-11-29 04:10:11,701 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 85 remaining) [2023-11-29 04:10:11,701 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 85 remaining) [2023-11-29 04:10:11,702 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 85 remaining) [2023-11-29 04:10:11,702 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 85 remaining) [2023-11-29 04:10:11,702 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 85 remaining) [2023-11-29 04:10:11,702 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 85 remaining) [2023-11-29 04:10:11,702 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 85 remaining) [2023-11-29 04:10:11,702 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 85 remaining) [2023-11-29 04:10:11,702 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 85 remaining) [2023-11-29 04:10:11,703 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 85 remaining) [2023-11-29 04:10:11,703 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 85 remaining) [2023-11-29 04:10:11,703 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 85 remaining) [2023-11-29 04:10:11,703 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 85 remaining) [2023-11-29 04:10:11,703 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 85 remaining) [2023-11-29 04:10:11,703 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 85 remaining) [2023-11-29 04:10:11,703 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 85 remaining) [2023-11-29 04:10:11,704 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 85 remaining) [2023-11-29 04:10:11,704 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 85 remaining) [2023-11-29 04:10:11,704 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 85 remaining) [2023-11-29 04:10:11,704 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 85 remaining) [2023-11-29 04:10:11,704 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 85 remaining) [2023-11-29 04:10:11,704 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 85 remaining) [2023-11-29 04:10:11,704 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 85 remaining) [2023-11-29 04:10:11,705 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 85 remaining) [2023-11-29 04:10:11,705 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 85 remaining) [2023-11-29 04:10:11,705 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 85 remaining) [2023-11-29 04:10:11,705 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 85 remaining) [2023-11-29 04:10:11,705 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 85 remaining) [2023-11-29 04:10:11,705 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 85 remaining) [2023-11-29 04:10:11,706 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 85 remaining) [2023-11-29 04:10:11,706 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 85 remaining) [2023-11-29 04:10:11,706 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 85 remaining) [2023-11-29 04:10:11,706 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 85 remaining) [2023-11-29 04:10:11,706 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 85 remaining) [2023-11-29 04:10:11,710 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2023-11-29 04:10:11,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:10:11,907 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:10:11,914 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-29 04:10:11,914 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 04:10:11,986 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre30 could not be translated [2023-11-29 04:10:11,990 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre32 could not be translated [2023-11-29 04:10:11,997 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre34 could not be translated [2023-11-29 04:10:12,026 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 04:10:12 BasicIcfg [2023-11-29 04:10:12,026 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 04:10:12,026 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 04:10:12,027 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 04:10:12,027 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 04:10:12,027 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:09:48" (3/4) ... [2023-11-29 04:10:12,029 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 04:10:12,030 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 04:10:12,031 INFO L158 Benchmark]: Toolchain (without parser) took 26228.24ms. Allocated memory was 67.1MB in the beginning and 2.8GB in the end (delta: 2.8GB). Free memory was 42.0MB in the beginning and 1.5GB in the end (delta: -1.5GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2023-11-29 04:10:12,031 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 67.1MB. Free memory was 43.1MB in the beginning and 43.0MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 04:10:12,031 INFO L158 Benchmark]: CACSL2BoogieTranslator took 571.47ms. Allocated memory was 67.1MB in the beginning and 88.1MB in the end (delta: 21.0MB). Free memory was 41.9MB in the beginning and 52.5MB in the end (delta: -10.7MB). Peak memory consumption was 13.9MB. Max. memory is 16.1GB. [2023-11-29 04:10:12,032 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.22ms. Allocated memory is still 88.1MB. Free memory was 52.5MB in the beginning and 50.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 04:10:12,032 INFO L158 Benchmark]: Boogie Preprocessor took 71.09ms. Allocated memory is still 88.1MB. Free memory was 50.1MB in the beginning and 45.5MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 04:10:12,032 INFO L158 Benchmark]: RCFGBuilder took 1564.91ms. Allocated memory was 88.1MB in the beginning and 107.0MB in the end (delta: 18.9MB). Free memory was 45.5MB in the beginning and 56.0MB in the end (delta: -10.5MB). Peak memory consumption was 31.0MB. Max. memory is 16.1GB. [2023-11-29 04:10:12,033 INFO L158 Benchmark]: TraceAbstraction took 23954.43ms. Allocated memory was 107.0MB in the beginning and 2.8GB in the end (delta: 2.7GB). Free memory was 55.2MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2023-11-29 04:10:12,033 INFO L158 Benchmark]: Witness Printer took 3.58ms. Allocated memory is still 2.8GB. Free memory is still 1.5GB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 04:10:12,035 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.30ms. Allocated memory is still 67.1MB. Free memory was 43.1MB in the beginning and 43.0MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 571.47ms. Allocated memory was 67.1MB in the beginning and 88.1MB in the end (delta: 21.0MB). Free memory was 41.9MB in the beginning and 52.5MB in the end (delta: -10.7MB). Peak memory consumption was 13.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.22ms. Allocated memory is still 88.1MB. Free memory was 52.5MB in the beginning and 50.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 71.09ms. Allocated memory is still 88.1MB. Free memory was 50.1MB in the beginning and 45.5MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1564.91ms. Allocated memory was 88.1MB in the beginning and 107.0MB in the end (delta: 18.9MB). Free memory was 45.5MB in the beginning and 56.0MB in the end (delta: -10.5MB). Peak memory consumption was 31.0MB. Max. memory is 16.1GB. * TraceAbstraction took 23954.43ms. Allocated memory was 107.0MB in the beginning and 2.8GB in the end (delta: 2.7GB). Free memory was 55.2MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. * Witness Printer took 3.58ms. Allocated memory is still 2.8GB. Free memory is still 1.5GB. 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~pre30 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre32 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre34 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p1_EAX = 0; [L732] 0 int __unbuffered_p1_EBX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L736] 0 int x = 0; [L737] 0 _Bool x$flush_delayed; [L738] 0 int x$mem_tmp; [L739] 0 _Bool x$r_buff0_thd0; [L740] 0 _Bool x$r_buff0_thd1; [L741] 0 _Bool x$r_buff0_thd2; [L742] 0 _Bool x$r_buff0_thd3; [L743] 0 _Bool x$r_buff1_thd0; [L744] 0 _Bool x$r_buff1_thd1; [L745] 0 _Bool x$r_buff1_thd2; [L746] 0 _Bool x$r_buff1_thd3; [L747] 0 _Bool x$read_delayed; [L748] 0 int *x$read_delayed_var; [L749] 0 int x$w_buff0; [L750] 0 _Bool x$w_buff0_used; [L751] 0 int x$w_buff1; [L752] 0 _Bool x$w_buff1_used; [L754] 0 int y = 0; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L848] 0 pthread_t t1681; [L849] FCALL, FORK 0 pthread_create(&t1681, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1681={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L761] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 1 x$flush_delayed = weak$$choice2 [L764] EXPR 1 \read(x) [L764] 1 x$mem_tmp = x [L765] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L766] EXPR 1 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L766] EXPR 1 \read(x) [L766] EXPR 1 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L766] 1 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L767] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)))) [L768] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)))) [L769] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L770] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L771] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L772] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x$r_buff1_thd1 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L773] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L774] 1 __unbuffered_p0_EAX$read_delayed_var = &x [L775] EXPR 1 \read(x) [L775] 1 __unbuffered_p0_EAX = x [L776] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L776] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L776] 1 x = x$flush_delayed ? x$mem_tmp : x [L777] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L850] 0 pthread_t t1682; [L851] FCALL, FORK 0 pthread_create(&t1682, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1681={7:0}, t1682={4:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L780] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L792] 2 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L795] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L798] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L799] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L800] 2 x$flush_delayed = weak$$choice2 [L801] EXPR 2 \read(x) [L801] 2 x$mem_tmp = x [L802] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L802] EXPR 2 \read(x) [L802] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L802] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L803] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L804] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L805] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L806] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L807] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L808] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L809] EXPR 2 \read(x) [L809] 2 __unbuffered_p1_EBX = x [L810] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L810] EXPR 2 \read(x) [L810] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L810] 2 x = x$flush_delayed ? x$mem_tmp : x [L811] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L852] 0 pthread_t t1683; [L853] FCALL, FORK 0 pthread_create(&t1683, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1681={7:0}, t1682={4:0}, t1683={5:0}, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L823] 3 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L785] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L816] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L826] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L826] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L826] EXPR 3 \read(x) [L826] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L826] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L826] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L827] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L828] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L829] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L830] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L833] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1681={7:0}, t1682={4:0}, t1683={5:0}, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L859] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L859] EXPR 0 \read(x) [L859] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L859] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L859] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L860] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L861] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L862] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L863] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1681={7:0}, t1682={4:0}, t1683={5:0}, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L866] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L867] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L867] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L867] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L867] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L867] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L867] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L868] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1681={7:0}, t1682={4:0}, t1683={5:0}, weak$$choice1=2, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L870] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=2, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L18] 0 __assert_fail ("0", "rfi006_power.oepc.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=2, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 846]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed 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. - 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: 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 149 locations, 85 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: 23.6s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 16.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 652 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 515 mSDsluCounter, 59 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 56 IncrementalHoareTripleChecker+Unchecked, 23 mSDsCounter, 63 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1312 IncrementalHoareTripleChecker+Invalid, 1431 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 63 mSolverCounterUnsat, 36 mSDtfsCounter, 1312 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 214 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=187occurred in iteration=0, InterpolantAutomatonStates: 58, 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.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 252 NumberOfCodeBlocks, 252 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 204 ConstructedInterpolants, 1 QuantifiedInterpolants, 1720 SizeOfPredicates, 11 NumberOfNonLiveVariables, 2108 ConjunctsInSsa, 72 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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-29 04:10:12,059 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60b238b2-d3cf-482b-9159-e3f77e2b5013/bin/uautomizer-verify-BQ2R08f2Ya/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 Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample