./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi009_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b751d-de18-4de7-8a9e-f123072e3863/bin/uautomizer-verify-NlZe1sFDwI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b751d-de18-4de7-8a9e-f123072e3863/bin/uautomizer-verify-NlZe1sFDwI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b751d-de18-4de7-8a9e-f123072e3863/bin/uautomizer-verify-NlZe1sFDwI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b751d-de18-4de7-8a9e-f123072e3863/bin/uautomizer-verify-NlZe1sFDwI/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi009_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b751d-de18-4de7-8a9e-f123072e3863/bin/uautomizer-verify-NlZe1sFDwI/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b751d-de18-4de7-8a9e-f123072e3863/bin/uautomizer-verify-NlZe1sFDwI --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6efd977ba774fd706e089a911dcd82549d76c764859cf8b84047b990ab28d067 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-24 21:41:29,884 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-24 21:41:29,996 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b751d-de18-4de7-8a9e-f123072e3863/bin/uautomizer-verify-NlZe1sFDwI/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-24 21:41:30,003 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-24 21:41:30,004 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-24 21:41:30,044 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-24 21:41:30,045 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-24 21:41:30,046 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-24 21:41:30,047 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-24 21:41:30,052 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-24 21:41:30,052 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-24 21:41:30,053 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-24 21:41:30,054 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-24 21:41:30,056 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-24 21:41:30,056 INFO L153 SettingsManager]: * Use SBE=true [2023-11-24 21:41:30,057 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-24 21:41:30,057 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-24 21:41:30,058 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-24 21:41:30,058 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-24 21:41:30,058 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-24 21:41:30,059 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-24 21:41:30,059 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-24 21:41:30,060 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-24 21:41:30,060 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-24 21:41:30,061 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-24 21:41:30,061 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-24 21:41:30,061 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-24 21:41:30,062 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-24 21:41:30,063 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-24 21:41:30,063 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-24 21:41:30,064 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-24 21:41:30,065 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-24 21:41:30,065 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 21:41:30,065 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-24 21:41:30,066 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-24 21:41:30,066 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-24 21:41:30,066 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-24 21:41:30,066 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-24 21:41:30,066 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-24 21:41:30,067 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-24 21:41:30,067 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-24 21:41:30,067 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_950b751d-de18-4de7-8a9e-f123072e3863/bin/uautomizer-verify-NlZe1sFDwI/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b751d-de18-4de7-8a9e-f123072e3863/bin/uautomizer-verify-NlZe1sFDwI Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6efd977ba774fd706e089a911dcd82549d76c764859cf8b84047b990ab28d067 [2023-11-24 21:41:30,392 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-24 21:41:30,421 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-24 21:41:30,424 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-24 21:41:30,426 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-24 21:41:30,426 INFO L274 PluginConnector]: CDTParser initialized [2023-11-24 21:41:30,428 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b751d-de18-4de7-8a9e-f123072e3863/bin/uautomizer-verify-NlZe1sFDwI/../../sv-benchmarks/c/pthread-wmm/rfi009_rmo.oepc.i [2023-11-24 21:41:33,507 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-24 21:41:33,855 INFO L384 CDTParser]: Found 1 translation units. [2023-11-24 21:41:33,856 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b751d-de18-4de7-8a9e-f123072e3863/sv-benchmarks/c/pthread-wmm/rfi009_rmo.oepc.i [2023-11-24 21:41:33,875 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b751d-de18-4de7-8a9e-f123072e3863/bin/uautomizer-verify-NlZe1sFDwI/data/a10273bc3/0d2056a342574936ad2cb09eb64a328f/FLAG3c99d3223 [2023-11-24 21:41:33,901 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b751d-de18-4de7-8a9e-f123072e3863/bin/uautomizer-verify-NlZe1sFDwI/data/a10273bc3/0d2056a342574936ad2cb09eb64a328f [2023-11-24 21:41:33,906 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-24 21:41:33,909 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-24 21:41:33,912 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-24 21:41:33,912 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-24 21:41:33,919 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-24 21:41:33,920 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 09:41:33" (1/1) ... [2023-11-24 21:41:33,921 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d59bc41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:41:33, skipping insertion in model container [2023-11-24 21:41:33,922 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 09:41:33" (1/1) ... [2023-11-24 21:41:34,003 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-24 21:41:34,402 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 21:41:34,415 INFO L202 MainTranslator]: Completed pre-run [2023-11-24 21:41:34,492 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 21:41:34,599 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 21:41:34,601 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 21:41:34,609 INFO L206 MainTranslator]: Completed translation [2023-11-24 21:41:34,610 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:41:34 WrapperNode [2023-11-24 21:41:34,611 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-24 21:41:34,612 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-24 21:41:34,613 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-24 21:41:34,613 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-24 21:41:34,622 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:41:34" (1/1) ... [2023-11-24 21:41:34,649 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:41:34" (1/1) ... [2023-11-24 21:41:34,679 INFO L138 Inliner]: procedures = 176, calls = 74, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 140 [2023-11-24 21:41:34,680 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-24 21:41:34,681 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-24 21:41:34,681 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-24 21:41:34,681 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-24 21:41:34,694 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:41:34" (1/1) ... [2023-11-24 21:41:34,694 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:41:34" (1/1) ... [2023-11-24 21:41:34,699 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:41:34" (1/1) ... [2023-11-24 21:41:34,723 INFO L175 MemorySlicer]: Split 24 memory accesses to 5 slices as follows [2, 1, 19, 1, 1]. 79 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-24 21:41:34,723 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:41:34" (1/1) ... [2023-11-24 21:41:34,724 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:41:34" (1/1) ... [2023-11-24 21:41:34,748 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:41:34" (1/1) ... [2023-11-24 21:41:34,761 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:41:34" (1/1) ... [2023-11-24 21:41:34,766 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:41:34" (1/1) ... [2023-11-24 21:41:34,774 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:41:34" (1/1) ... [2023-11-24 21:41:34,782 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-24 21:41:34,783 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-24 21:41:34,783 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-24 21:41:34,784 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-24 21:41:34,784 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:41:34" (1/1) ... [2023-11-24 21:41:34,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 21:41:34,822 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b751d-de18-4de7-8a9e-f123072e3863/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 21:41:34,836 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b751d-de18-4de7-8a9e-f123072e3863/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-24 21:41:34,874 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b751d-de18-4de7-8a9e-f123072e3863/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-24 21:41:34,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-24 21:41:34,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-24 21:41:34,886 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-24 21:41:34,887 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-24 21:41:34,887 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-11-24 21:41:34,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-24 21:41:34,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-24 21:41:34,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-24 21:41:34,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-24 21:41:34,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-24 21:41:34,890 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-24 21:41:34,891 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-24 21:41:34,891 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-24 21:41:34,892 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-24 21:41:34,892 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-24 21:41:34,892 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-24 21:41:34,892 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-24 21:41:34,893 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-24 21:41:34,893 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-24 21:41:34,893 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-24 21:41:34,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-24 21:41:34,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-24 21:41:34,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-24 21:41:34,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-24 21:41:34,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-24 21:41:34,895 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-24 21:41:34,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-24 21:41:34,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-24 21:41:34,898 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-24 21:41:35,150 INFO L241 CfgBuilder]: Building ICFG [2023-11-24 21:41:35,153 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-24 21:41:35,748 INFO L282 CfgBuilder]: Performing block encoding [2023-11-24 21:41:36,368 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-24 21:41:36,368 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-24 21:41:36,369 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 09:41:36 BoogieIcfgContainer [2023-11-24 21:41:36,369 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-24 21:41:36,373 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-24 21:41:36,373 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-24 21:41:36,377 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-24 21:41:36,377 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 09:41:33" (1/3) ... [2023-11-24 21:41:36,378 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dc14fdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 09:41:36, skipping insertion in model container [2023-11-24 21:41:36,378 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:41:34" (2/3) ... [2023-11-24 21:41:36,380 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dc14fdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 09:41:36, skipping insertion in model container [2023-11-24 21:41:36,380 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 09:41:36" (3/3) ... [2023-11-24 21:41:36,384 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi009_rmo.oepc.i [2023-11-24 21:41:36,405 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-24 21:41:36,405 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 44 error locations. [2023-11-24 21:41:36,406 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-24 21:41:36,577 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-24 21:41:36,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 96 places, 88 transitions, 188 flow [2023-11-24 21:41:36,699 INFO L124 PetriNetUnfolderBase]: 2/85 cut-off events. [2023-11-24 21:41:36,699 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-24 21:41:36,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95 conditions, 85 events. 2/85 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 285 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 84. Up to 2 conditions per place. [2023-11-24 21:41:36,706 INFO L82 GeneralOperation]: Start removeDead. Operand has 96 places, 88 transitions, 188 flow [2023-11-24 21:41:36,720 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 93 places, 85 transitions, 179 flow [2023-11-24 21:41:36,732 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-24 21:41:36,738 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;@7b15b5ac, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 21:41:36,739 INFO L358 AbstractCegarLoop]: Starting to check reachability of 77 error locations. [2023-11-24 21:41:36,743 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-24 21:41:36,743 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-24 21:41:36,743 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-24 21:41:36,743 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:41:36,744 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-24 21:41:36,745 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-24 21:41:36,750 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:41:36,750 INFO L85 PathProgramCache]: Analyzing trace with hash 23498, now seen corresponding path program 1 times [2023-11-24 21:41:36,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:41:36,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355794609] [2023-11-24 21:41:36,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:41:36,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:41:36,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:37,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:41:37,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:41:37,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355794609] [2023-11-24 21:41:37,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355794609] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:41:37,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:41:37,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:41:37,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718373027] [2023-11-24 21:41:37,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:41:37,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:41:37,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:41:37,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:41:37,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:41:37,176 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 88 [2023-11-24 21:41:37,179 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 85 transitions, 179 flow. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:37,180 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:41:37,180 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 88 [2023-11-24 21:41:37,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:41:40,659 INFO L124 PetriNetUnfolderBase]: 9214/14346 cut-off events. [2023-11-24 21:41:40,659 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2023-11-24 21:41:40,698 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 119273 event pairs, 7964 based on Foata normal form. 500/7829 useless extension candidates. Maximal degree in co-relation 27425. Up to 11276 conditions per place. [2023-11-24 21:41:40,833 INFO L140 encePairwiseOnDemand]: 63/88 looper letters, 53 selfloop transitions, 2 changer transitions 0/78 dead transitions. [2023-11-24 21:41:40,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 78 transitions, 275 flow [2023-11-24 21:41:40,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:41:40,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:41:40,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 176 transitions. [2023-11-24 21:41:40,849 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2023-11-24 21:41:40,850 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 176 transitions. [2023-11-24 21:41:40,851 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 176 transitions. [2023-11-24 21:41:40,854 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:41:40,856 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 176 transitions. [2023-11-24 21:41:40,860 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 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-24 21:41:40,866 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 88.0) internal successors, (352), 4 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:40,867 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 88.0) internal successors, (352), 4 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:40,869 INFO L175 Difference]: Start difference. First operand has 93 places, 85 transitions, 179 flow. Second operand 3 states and 176 transitions. [2023-11-24 21:41:40,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 78 transitions, 275 flow [2023-11-24 21:41:40,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 78 transitions, 272 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-24 21:41:40,881 INFO L231 Difference]: Finished difference. Result has 70 places, 61 transitions, 132 flow [2023-11-24 21:41:40,883 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, 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-24 21:41:40,888 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -23 predicate places. [2023-11-24 21:41:40,888 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 61 transitions, 132 flow [2023-11-24 21:41:40,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:40,889 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:41:40,889 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-24 21:41:40,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-24 21:41:40,890 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-24 21:41:40,890 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:41:40,891 INFO L85 PathProgramCache]: Analyzing trace with hash 23499, now seen corresponding path program 1 times [2023-11-24 21:41:40,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:41:40,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590007642] [2023-11-24 21:41:40,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:41:40,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:41:40,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:41,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:41:41,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:41:41,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590007642] [2023-11-24 21:41:41,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590007642] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:41:41,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:41:41,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:41:41,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884198258] [2023-11-24 21:41:41,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:41:41,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:41:41,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:41:41,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:41:41,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:41:41,128 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 88 [2023-11-24 21:41:41,128 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-24 21:41:41,129 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:41:41,129 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 88 [2023-11-24 21:41:41,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:41:43,979 INFO L124 PetriNetUnfolderBase]: 9214/14345 cut-off events. [2023-11-24 21:41:43,980 INFO L125 PetriNetUnfolderBase]: For 250/250 co-relation queries the response was YES. [2023-11-24 21:41:44,024 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 119182 event pairs, 7964 based on Foata normal form. 1/7329 useless extension candidates. Maximal degree in co-relation 27675. Up to 11275 conditions per place. [2023-11-24 21:41:44,123 INFO L140 encePairwiseOnDemand]: 85/88 looper letters, 52 selfloop transitions, 2 changer transitions 0/77 dead transitions. [2023-11-24 21:41:44,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 77 transitions, 272 flow [2023-11-24 21:41:44,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:41:44,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:41:44,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 136 transitions. [2023-11-24 21:41:44,132 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5151515151515151 [2023-11-24 21:41:44,135 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 136 transitions. [2023-11-24 21:41:44,136 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 136 transitions. [2023-11-24 21:41:44,138 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:41:44,139 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 136 transitions. [2023-11-24 21:41:44,142 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-24 21:41:44,144 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 88.0) internal successors, (352), 4 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:44,145 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 88.0) internal successors, (352), 4 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:44,146 INFO L175 Difference]: Start difference. First operand has 70 places, 61 transitions, 132 flow. Second operand 3 states and 136 transitions. [2023-11-24 21:41:44,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 77 transitions, 272 flow [2023-11-24 21:41:44,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 77 transitions, 268 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:41:44,203 INFO L231 Difference]: Finished difference. Result has 69 places, 60 transitions, 130 flow [2023-11-24 21:41:44,203 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, 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-24 21:41:44,204 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -24 predicate places. [2023-11-24 21:41:44,205 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 60 transitions, 130 flow [2023-11-24 21:41:44,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:44,205 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:41:44,205 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-24 21:41:44,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-24 21:41:44,206 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-24 21:41:44,207 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:41:44,207 INFO L85 PathProgramCache]: Analyzing trace with hash 700804751, now seen corresponding path program 1 times [2023-11-24 21:41:44,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:41:44,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482489774] [2023-11-24 21:41:44,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:41:44,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:41:44,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:44,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:41:44,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:41:44,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482489774] [2023-11-24 21:41:44,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482489774] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:41:44,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:41:44,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:41:44,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607311285] [2023-11-24 21:41:44,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:41:44,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:41:44,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:41:44,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:41:44,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:41:44,368 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 88 [2023-11-24 21:41:44,368 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-24 21:41:44,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:41:44,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 88 [2023-11-24 21:41:44,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:41:47,131 INFO L124 PetriNetUnfolderBase]: 9218/14344 cut-off events. [2023-11-24 21:41:47,131 INFO L125 PetriNetUnfolderBase]: For 250/250 co-relation queries the response was YES. [2023-11-24 21:41:47,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27694 conditions, 14344 events. 9218/14344 cut-off events. For 250/250 co-relation queries the response was YES. Maximal size of possible extension queue 1466. Compared 119825 event pairs, 5720 based on Foata normal form. 0/7336 useless extension candidates. Maximal degree in co-relation 27683. Up to 11278 conditions per place. [2023-11-24 21:41:47,242 INFO L140 encePairwiseOnDemand]: 85/88 looper letters, 53 selfloop transitions, 2 changer transitions 0/76 dead transitions. [2023-11-24 21:41:47,243 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 76 transitions, 272 flow [2023-11-24 21:41:47,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:41:47,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:41:47,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2023-11-24 21:41:47,245 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5075757575757576 [2023-11-24 21:41:47,246 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 134 transitions. [2023-11-24 21:41:47,246 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 134 transitions. [2023-11-24 21:41:47,246 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:41:47,246 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 134 transitions. [2023-11-24 21:41:47,247 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-24 21:41:47,250 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 88.0) internal successors, (352), 4 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:47,250 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 88.0) internal successors, (352), 4 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:47,250 INFO L175 Difference]: Start difference. First operand has 69 places, 60 transitions, 130 flow. Second operand 3 states and 134 transitions. [2023-11-24 21:41:47,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 76 transitions, 272 flow [2023-11-24 21:41:47,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 76 transitions, 268 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:41:47,270 INFO L231 Difference]: Finished difference. Result has 68 places, 59 transitions, 128 flow [2023-11-24 21:41:47,270 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, 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-24 21:41:47,272 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -25 predicate places. [2023-11-24 21:41:47,272 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 59 transitions, 128 flow [2023-11-24 21:41:47,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:47,273 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:41:47,273 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-24 21:41:47,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-24 21:41:47,273 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-24 21:41:47,274 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:41:47,275 INFO L85 PathProgramCache]: Analyzing trace with hash 700804752, now seen corresponding path program 1 times [2023-11-24 21:41:47,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:41:47,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399468498] [2023-11-24 21:41:47,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:41:47,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:41:47,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:47,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:41:47,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:41:47,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399468498] [2023-11-24 21:41:47,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399468498] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:41:47,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:41:47,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:41:47,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572531184] [2023-11-24 21:41:47,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:41:47,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:41:47,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:41:47,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:41:47,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:41:47,418 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 88 [2023-11-24 21:41:47,418 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-24 21:41:47,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:41:47,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 88 [2023-11-24 21:41:47,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:41:49,958 INFO L124 PetriNetUnfolderBase]: 9214/14334 cut-off events. [2023-11-24 21:41:49,958 INFO L125 PetriNetUnfolderBase]: For 254/254 co-relation queries the response was YES. [2023-11-24 21:41:49,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27679 conditions, 14334 events. 9214/14334 cut-off events. For 254/254 co-relation queries the response was YES. Maximal size of possible extension queue 1466. Compared 119885 event pairs, 6280 based on Foata normal form. 5/7334 useless extension candidates. Maximal degree in co-relation 27669. Up to 11269 conditions per place. [2023-11-24 21:41:50,069 INFO L140 encePairwiseOnDemand]: 85/88 looper letters, 52 selfloop transitions, 2 changer transitions 0/75 dead transitions. [2023-11-24 21:41:50,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 75 transitions, 268 flow [2023-11-24 21:41:50,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:41:50,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:41:50,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 136 transitions. [2023-11-24 21:41:50,071 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5151515151515151 [2023-11-24 21:41:50,071 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 136 transitions. [2023-11-24 21:41:50,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 136 transitions. [2023-11-24 21:41:50,072 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:41:50,072 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 136 transitions. [2023-11-24 21:41:50,073 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-24 21:41:50,075 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 88.0) internal successors, (352), 4 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:50,075 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 88.0) internal successors, (352), 4 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:50,076 INFO L175 Difference]: Start difference. First operand has 68 places, 59 transitions, 128 flow. Second operand 3 states and 136 transitions. [2023-11-24 21:41:50,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 75 transitions, 268 flow [2023-11-24 21:41:50,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 75 transitions, 264 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:41:50,085 INFO L231 Difference]: Finished difference. Result has 67 places, 58 transitions, 126 flow [2023-11-24 21:41:50,086 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, 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-24 21:41:50,088 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -26 predicate places. [2023-11-24 21:41:50,088 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 58 transitions, 126 flow [2023-11-24 21:41:50,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:50,089 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:41:50,089 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-24 21:41:50,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-24 21:41:50,090 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-24 21:41:50,091 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:41:50,092 INFO L85 PathProgramCache]: Analyzing trace with hash 700804869, now seen corresponding path program 1 times [2023-11-24 21:41:50,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:41:50,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014204052] [2023-11-24 21:41:50,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:41:50,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:41:50,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:50,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:41:50,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:41:50,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014204052] [2023-11-24 21:41:50,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014204052] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:41:50,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:41:50,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:41:50,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877869337] [2023-11-24 21:41:50,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:41:50,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-24 21:41:50,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:41:50,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-24 21:41:50,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-24 21:41:50,272 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 88 [2023-11-24 21:41:50,272 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-24 21:41:50,273 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:41:50,273 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 88 [2023-11-24 21:41:50,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:41:51,465 INFO L124 PetriNetUnfolderBase]: 4498/7558 cut-off events. [2023-11-24 21:41:51,465 INFO L125 PetriNetUnfolderBase]: For 115/115 co-relation queries the response was YES. [2023-11-24 21:41:51,488 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 61946 event pairs, 3059 based on Foata normal form. 0/4870 useless extension candidates. Maximal degree in co-relation 14390. Up to 4121 conditions per place. [2023-11-24 21:41:51,532 INFO L140 encePairwiseOnDemand]: 75/88 looper letters, 55 selfloop transitions, 6 changer transitions 0/81 dead transitions. [2023-11-24 21:41:51,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 81 transitions, 294 flow [2023-11-24 21:41:51,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 21:41:51,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-24 21:41:51,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 181 transitions. [2023-11-24 21:41:51,534 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5142045454545454 [2023-11-24 21:41:51,535 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 181 transitions. [2023-11-24 21:41:51,535 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 181 transitions. [2023-11-24 21:41:51,535 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:41:51,535 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 181 transitions. [2023-11-24 21:41:51,536 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-24 21:41:51,537 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 88.0) internal successors, (440), 5 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:51,538 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 88.0) internal successors, (440), 5 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:51,538 INFO L175 Difference]: Start difference. First operand has 67 places, 58 transitions, 126 flow. Second operand 4 states and 181 transitions. [2023-11-24 21:41:51,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 81 transitions, 294 flow [2023-11-24 21:41:51,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 81 transitions, 290 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:41:51,542 INFO L231 Difference]: Finished difference. Result has 69 places, 60 transitions, 178 flow [2023-11-24 21:41:51,543 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, 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-24 21:41:51,544 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -24 predicate places. [2023-11-24 21:41:51,544 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 60 transitions, 178 flow [2023-11-24 21:41:51,544 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-24 21:41:51,545 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:41:51,545 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-24 21:41:51,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-24 21:41:51,545 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-24 21:41:51,546 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:41:51,546 INFO L85 PathProgramCache]: Analyzing trace with hash 700804870, now seen corresponding path program 1 times [2023-11-24 21:41:51,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:41:51,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070825657] [2023-11-24 21:41:51,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:41:51,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:41:51,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:51,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:41:51,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:41:51,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070825657] [2023-11-24 21:41:51,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070825657] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:41:51,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:41:51,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:41:51,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143962808] [2023-11-24 21:41:51,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:41:51,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:41:51,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:41:51,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:41:51,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:41:51,687 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 88 [2023-11-24 21:41:51,688 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 60 transitions, 178 flow. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:51,688 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:41:51,688 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 88 [2023-11-24 21:41:51,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:41:52,254 INFO L124 PetriNetUnfolderBase]: 1304/2461 cut-off events. [2023-11-24 21:41:52,254 INFO L125 PetriNetUnfolderBase]: For 988/988 co-relation queries the response was YES. [2023-11-24 21:41:52,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5931 conditions, 2461 events. 1304/2461 cut-off events. For 988/988 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 18580 event pairs, 1168 based on Foata normal form. 691/3003 useless extension candidates. Maximal degree in co-relation 5917. Up to 2069 conditions per place. [2023-11-24 21:41:52,276 INFO L140 encePairwiseOnDemand]: 80/88 looper letters, 31 selfloop transitions, 1 changer transitions 0/53 dead transitions. [2023-11-24 21:41:52,277 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 53 transitions, 228 flow [2023-11-24 21:41:52,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:41:52,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:41:52,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2023-11-24 21:41:52,280 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45075757575757575 [2023-11-24 21:41:52,280 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 119 transitions. [2023-11-24 21:41:52,280 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 119 transitions. [2023-11-24 21:41:52,281 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:41:52,282 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 119 transitions. [2023-11-24 21:41:52,283 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:52,285 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 88.0) internal successors, (352), 4 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:52,287 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 88.0) internal successors, (352), 4 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:52,288 INFO L175 Difference]: Start difference. First operand has 69 places, 60 transitions, 178 flow. Second operand 3 states and 119 transitions. [2023-11-24 21:41:52,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 53 transitions, 228 flow [2023-11-24 21:41:52,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 53 transitions, 226 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-24 21:41:52,295 INFO L231 Difference]: Finished difference. Result has 63 places, 53 transitions, 164 flow [2023-11-24 21:41:52,296 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=164, PETRI_PLACES=63, PETRI_TRANSITIONS=53} [2023-11-24 21:41:52,300 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -30 predicate places. [2023-11-24 21:41:52,301 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 53 transitions, 164 flow [2023-11-24 21:41:52,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:52,301 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:41:52,306 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:41:52,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-24 21:41:52,307 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-24 21:41:52,307 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:41:52,307 INFO L85 PathProgramCache]: Analyzing trace with hash -160911075, now seen corresponding path program 1 times [2023-11-24 21:41:52,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:41:52,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383680582] [2023-11-24 21:41:52,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:41:52,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:41:52,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:52,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:41:52,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:41:52,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383680582] [2023-11-24 21:41:52,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383680582] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:41:52,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:41:52,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:41:52,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454938070] [2023-11-24 21:41:52,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:41:52,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:41:52,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:41:52,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:41:52,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:41:52,404 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 88 [2023-11-24 21:41:52,404 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 53 transitions, 164 flow. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:52,404 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:41:52,405 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 88 [2023-11-24 21:41:52,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:41:52,930 INFO L124 PetriNetUnfolderBase]: 1316/2449 cut-off events. [2023-11-24 21:41:52,930 INFO L125 PetriNetUnfolderBase]: For 963/963 co-relation queries the response was YES. [2023-11-24 21:41:52,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5947 conditions, 2449 events. 1316/2449 cut-off events. For 963/963 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 18227 event pairs, 878 based on Foata normal form. 0/2314 useless extension candidates. Maximal degree in co-relation 5937. Up to 1077 conditions per place. [2023-11-24 21:41:52,946 INFO L140 encePairwiseOnDemand]: 85/88 looper letters, 38 selfloop transitions, 2 changer transitions 0/59 dead transitions. [2023-11-24 21:41:52,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 59 transitions, 264 flow [2023-11-24 21:41:52,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:41:52,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:41:52,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 115 transitions. [2023-11-24 21:41:52,948 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4356060606060606 [2023-11-24 21:41:52,948 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 115 transitions. [2023-11-24 21:41:52,948 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 115 transitions. [2023-11-24 21:41:52,949 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:41:52,949 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 115 transitions. [2023-11-24 21:41:52,951 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-24 21:41:52,952 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 88.0) internal successors, (352), 4 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:52,952 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 88.0) internal successors, (352), 4 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:52,952 INFO L175 Difference]: Start difference. First operand has 63 places, 53 transitions, 164 flow. Second operand 3 states and 115 transitions. [2023-11-24 21:41:52,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 59 transitions, 264 flow [2023-11-24 21:41:52,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 59 transitions, 263 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-24 21:41:52,956 INFO L231 Difference]: Finished difference. Result has 63 places, 52 transitions, 165 flow [2023-11-24 21:41:52,957 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, 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-24 21:41:52,958 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -30 predicate places. [2023-11-24 21:41:52,958 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 52 transitions, 165 flow [2023-11-24 21:41:52,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:52,959 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:41:52,959 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:41:52,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-24 21:41:52,959 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-24 21:41:52,960 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:41:52,960 INFO L85 PathProgramCache]: Analyzing trace with hash -160911074, now seen corresponding path program 1 times [2023-11-24 21:41:52,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:41:52,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694448933] [2023-11-24 21:41:52,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:41:52,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:41:52,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:53,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:41:53,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:41:53,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694448933] [2023-11-24 21:41:53,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694448933] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:41:53,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:41:53,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:41:53,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919609579] [2023-11-24 21:41:53,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:41:53,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:41:53,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:41:53,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:41:53,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:41:53,070 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 88 [2023-11-24 21:41:53,070 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-24 21:41:53,070 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:41:53,070 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 88 [2023-11-24 21:41:53,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:41:53,459 INFO L124 PetriNetUnfolderBase]: 1304/2428 cut-off events. [2023-11-24 21:41:53,459 INFO L125 PetriNetUnfolderBase]: For 1035/1035 co-relation queries the response was YES. [2023-11-24 21:41:53,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5944 conditions, 2428 events. 1304/2428 cut-off events. For 1035/1035 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 18091 event pairs, 872 based on Foata normal form. 9/2305 useless extension candidates. Maximal degree in co-relation 5934. Up to 1077 conditions per place. [2023-11-24 21:41:53,471 INFO L140 encePairwiseOnDemand]: 85/88 looper letters, 37 selfloop transitions, 2 changer transitions 0/58 dead transitions. [2023-11-24 21:41:53,471 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 58 transitions, 263 flow [2023-11-24 21:41:53,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:41:53,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:41:53,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2023-11-24 21:41:53,472 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4431818181818182 [2023-11-24 21:41:53,472 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 117 transitions. [2023-11-24 21:41:53,473 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 117 transitions. [2023-11-24 21:41:53,473 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:41:53,473 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 117 transitions. [2023-11-24 21:41:53,473 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:53,474 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 88.0) internal successors, (352), 4 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:53,474 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 88.0) internal successors, (352), 4 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:53,475 INFO L175 Difference]: Start difference. First operand has 63 places, 52 transitions, 165 flow. Second operand 3 states and 117 transitions. [2023-11-24 21:41:53,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 58 transitions, 263 flow [2023-11-24 21:41:53,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 58 transitions, 259 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:41:53,478 INFO L231 Difference]: Finished difference. Result has 62 places, 51 transitions, 163 flow [2023-11-24 21:41:53,478 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, 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-24 21:41:53,479 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -31 predicate places. [2023-11-24 21:41:53,479 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 51 transitions, 163 flow [2023-11-24 21:41:53,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:53,479 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:41:53,479 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:41:53,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-24 21:41:53,479 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-24 21:41:53,480 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:41:53,480 INFO L85 PathProgramCache]: Analyzing trace with hash 389339820, now seen corresponding path program 1 times [2023-11-24 21:41:53,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:41:53,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848529425] [2023-11-24 21:41:53,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:41:53,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:41:53,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:53,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:41:53,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:41:53,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848529425] [2023-11-24 21:41:53,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848529425] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:41:53,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:41:53,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:41:53,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725886541] [2023-11-24 21:41:53,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:41:53,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:41:53,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:41:53,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:41:53,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:41:53,613 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 88 [2023-11-24 21:41:53,613 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-24 21:41:53,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:41:53,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 88 [2023-11-24 21:41:53,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:41:54,032 INFO L124 PetriNetUnfolderBase]: 1246/2580 cut-off events. [2023-11-24 21:41:54,032 INFO L125 PetriNetUnfolderBase]: For 882/890 co-relation queries the response was YES. [2023-11-24 21:41:54,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5970 conditions, 2580 events. 1246/2580 cut-off events. For 882/890 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 20590 event pairs, 432 based on Foata normal form. 0/2454 useless extension candidates. Maximal degree in co-relation 5960. Up to 1359 conditions per place. [2023-11-24 21:41:54,044 INFO L140 encePairwiseOnDemand]: 84/88 looper letters, 53 selfloop transitions, 3 changer transitions 0/75 dead transitions. [2023-11-24 21:41:54,044 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 75 transitions, 368 flow [2023-11-24 21:41:54,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:41:54,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:41:54,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 135 transitions. [2023-11-24 21:41:54,046 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5113636363636364 [2023-11-24 21:41:54,046 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 135 transitions. [2023-11-24 21:41:54,046 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 135 transitions. [2023-11-24 21:41:54,046 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:41:54,047 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 135 transitions. [2023-11-24 21:41:54,047 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-24 21:41:54,048 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 88.0) internal successors, (352), 4 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:54,049 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 88.0) internal successors, (352), 4 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:54,049 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 163 flow. Second operand 3 states and 135 transitions. [2023-11-24 21:41:54,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 75 transitions, 368 flow [2023-11-24 21:41:54,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 75 transitions, 360 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:41:54,052 INFO L231 Difference]: Finished difference. Result has 63 places, 51 transitions, 172 flow [2023-11-24 21:41:54,053 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, 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-24 21:41:54,053 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -30 predicate places. [2023-11-24 21:41:54,054 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 51 transitions, 172 flow [2023-11-24 21:41:54,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:54,054 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:41:54,054 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:41:54,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-24 21:41:54,055 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-24 21:41:54,055 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:41:54,055 INFO L85 PathProgramCache]: Analyzing trace with hash 493491838, now seen corresponding path program 1 times [2023-11-24 21:41:54,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:41:54,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209960356] [2023-11-24 21:41:54,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:41:54,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:41:54,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:54,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:41:54,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:41:54,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209960356] [2023-11-24 21:41:54,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209960356] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:41:54,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:41:54,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-24 21:41:54,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774589299] [2023-11-24 21:41:54,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:41:54,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-24 21:41:54,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:41:54,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-24 21:41:54,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-24 21:41:54,172 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 88 [2023-11-24 21:41:54,173 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-24 21:41:54,173 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:41:54,173 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 88 [2023-11-24 21:41:54,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:41:54,743 INFO L124 PetriNetUnfolderBase]: 1280/2642 cut-off events. [2023-11-24 21:41:54,743 INFO L125 PetriNetUnfolderBase]: For 1177/1185 co-relation queries the response was YES. [2023-11-24 21:41:54,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6495 conditions, 2642 events. 1280/2642 cut-off events. For 1177/1185 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 20883 event pairs, 372 based on Foata normal form. 0/2588 useless extension candidates. Maximal degree in co-relation 6483. Up to 972 conditions per place. [2023-11-24 21:41:54,758 INFO L140 encePairwiseOnDemand]: 81/88 looper letters, 45 selfloop transitions, 8 changer transitions 0/72 dead transitions. [2023-11-24 21:41:54,759 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 72 transitions, 331 flow [2023-11-24 21:41:54,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 21:41:54,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-24 21:41:54,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 166 transitions. [2023-11-24 21:41:54,760 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4715909090909091 [2023-11-24 21:41:54,761 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 166 transitions. [2023-11-24 21:41:54,761 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 166 transitions. [2023-11-24 21:41:54,761 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:41:54,761 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 166 transitions. [2023-11-24 21:41:54,762 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-24 21:41:54,764 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 88.0) internal successors, (440), 5 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:54,764 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 88.0) internal successors, (440), 5 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:54,764 INFO L175 Difference]: Start difference. First operand has 63 places, 51 transitions, 172 flow. Second operand 4 states and 166 transitions. [2023-11-24 21:41:54,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 72 transitions, 331 flow [2023-11-24 21:41:54,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 72 transitions, 325 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:41:54,768 INFO L231 Difference]: Finished difference. Result has 63 places, 51 transitions, 183 flow [2023-11-24 21:41:54,769 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, 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=183, PETRI_PLACES=63, PETRI_TRANSITIONS=51} [2023-11-24 21:41:54,769 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -30 predicate places. [2023-11-24 21:41:54,770 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 51 transitions, 183 flow [2023-11-24 21:41:54,770 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-24 21:41:54,770 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:41:54,770 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:41:54,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-24 21:41:54,771 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-24 21:41:54,771 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:41:54,771 INFO L85 PathProgramCache]: Analyzing trace with hash -739751291, now seen corresponding path program 1 times [2023-11-24 21:41:54,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:41:54,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033630087] [2023-11-24 21:41:54,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:41:54,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:41:54,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:55,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:41:55,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:41:55,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033630087] [2023-11-24 21:41:55,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033630087] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:41:55,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:41:55,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-24 21:41:55,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151758105] [2023-11-24 21:41:55,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:41:55,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 21:41:55,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:41:55,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 21:41:55,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-24 21:41:55,069 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 88 [2023-11-24 21:41:55,070 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 51 transitions, 183 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-24 21:41:55,070 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:41:55,070 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 88 [2023-11-24 21:41:55,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:41:55,647 INFO L124 PetriNetUnfolderBase]: 1234/2576 cut-off events. [2023-11-24 21:41:55,647 INFO L125 PetriNetUnfolderBase]: For 1381/1389 co-relation queries the response was YES. [2023-11-24 21:41:55,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6471 conditions, 2576 events. 1234/2576 cut-off events. For 1381/1389 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 20430 event pairs, 612 based on Foata normal form. 24/2554 useless extension candidates. Maximal degree in co-relation 6459. Up to 1378 conditions per place. [2023-11-24 21:41:55,664 INFO L140 encePairwiseOnDemand]: 85/88 looper letters, 51 selfloop transitions, 3 changer transitions 0/73 dead transitions. [2023-11-24 21:41:55,664 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 73 transitions, 377 flow [2023-11-24 21:41:55,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 21:41:55,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-24 21:41:55,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 160 transitions. [2023-11-24 21:41:55,666 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2023-11-24 21:41:55,666 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 160 transitions. [2023-11-24 21:41:55,666 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 160 transitions. [2023-11-24 21:41:55,667 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:41:55,667 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 160 transitions. [2023-11-24 21:41:55,668 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 40.0) internal successors, (160), 4 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-24 21:41:55,670 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 88.0) internal successors, (440), 5 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:55,671 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 88.0) internal successors, (440), 5 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:55,672 INFO L175 Difference]: Start difference. First operand has 63 places, 51 transitions, 183 flow. Second operand 4 states and 160 transitions. [2023-11-24 21:41:55,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 73 transitions, 377 flow [2023-11-24 21:41:55,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 73 transitions, 364 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:41:55,678 INFO L231 Difference]: Finished difference. Result has 63 places, 50 transitions, 175 flow [2023-11-24 21:41:55,678 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=175, PETRI_PLACES=63, PETRI_TRANSITIONS=50} [2023-11-24 21:41:55,679 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -30 predicate places. [2023-11-24 21:41:55,679 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 50 transitions, 175 flow [2023-11-24 21:41:55,679 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-24 21:41:55,680 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:41:55,680 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:41:55,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-24 21:41:55,680 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-24 21:41:55,681 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:41:55,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1744992147, now seen corresponding path program 1 times [2023-11-24 21:41:55,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:41:55,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589046302] [2023-11-24 21:41:55,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:41:55,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:41:55,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:56,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:41:56,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:41:56,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589046302] [2023-11-24 21:41:56,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589046302] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:41:56,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:41:56,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 21:41:56,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739802912] [2023-11-24 21:41:56,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:41:56,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-24 21:41:56,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:41:56,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-24 21:41:56,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-24 21:41:56,535 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 88 [2023-11-24 21:41:56,535 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 50 transitions, 175 flow. Second operand has 7 states, 7 states have (on average 27.0) internal successors, (189), 7 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:56,535 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:41:56,536 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 88 [2023-11-24 21:41:56,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:41:57,304 INFO L124 PetriNetUnfolderBase]: 1236/2465 cut-off events. [2023-11-24 21:41:57,304 INFO L125 PetriNetUnfolderBase]: For 1630/1630 co-relation queries the response was YES. [2023-11-24 21:41:57,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6332 conditions, 2465 events. 1236/2465 cut-off events. For 1630/1630 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 19331 event pairs, 438 based on Foata normal form. 0/2410 useless extension candidates. Maximal degree in co-relation 6320. Up to 1212 conditions per place. [2023-11-24 21:41:57,319 INFO L140 encePairwiseOnDemand]: 83/88 looper letters, 40 selfloop transitions, 5 changer transitions 0/62 dead transitions. [2023-11-24 21:41:57,319 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 62 transitions, 315 flow [2023-11-24 21:41:57,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 21:41:57,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-24 21:41:57,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 191 transitions. [2023-11-24 21:41:57,322 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36174242424242425 [2023-11-24 21:41:57,322 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 191 transitions. [2023-11-24 21:41:57,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 191 transitions. [2023-11-24 21:41:57,322 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:41:57,322 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 191 transitions. [2023-11-24 21:41:57,323 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 31.833333333333332) internal successors, (191), 6 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:57,325 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 88.0) internal successors, (616), 7 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:57,326 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 88.0) internal successors, (616), 7 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:57,326 INFO L175 Difference]: Start difference. First operand has 63 places, 50 transitions, 175 flow. Second operand 6 states and 191 transitions. [2023-11-24 21:41:57,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 62 transitions, 315 flow [2023-11-24 21:41:57,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 62 transitions, 308 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:41:57,330 INFO L231 Difference]: Finished difference. Result has 65 places, 49 transitions, 179 flow [2023-11-24 21:41:57,330 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=179, PETRI_PLACES=65, PETRI_TRANSITIONS=49} [2023-11-24 21:41:57,331 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -28 predicate places. [2023-11-24 21:41:57,331 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 49 transitions, 179 flow [2023-11-24 21:41:57,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 27.0) internal successors, (189), 7 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:57,332 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:41:57,332 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:41:57,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-24 21:41:57,333 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-24 21:41:57,333 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:41:57,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1744990709, now seen corresponding path program 1 times [2023-11-24 21:41:57,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:41:57,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338742976] [2023-11-24 21:41:57,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:41:57,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:41:57,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:57,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:41:57,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:41:57,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338742976] [2023-11-24 21:41:57,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338742976] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:41:57,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:41:57,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 21:41:57,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684484731] [2023-11-24 21:41:57,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:41:57,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 21:41:57,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:41:57,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 21:41:57,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-24 21:41:57,587 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 88 [2023-11-24 21:41:57,587 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 49 transitions, 179 flow. Second operand has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:57,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:41:57,588 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 88 [2023-11-24 21:41:57,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:41:58,696 INFO L124 PetriNetUnfolderBase]: 2625/4969 cut-off events. [2023-11-24 21:41:58,696 INFO L125 PetriNetUnfolderBase]: For 2363/2363 co-relation queries the response was YES. [2023-11-24 21:41:58,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13120 conditions, 4969 events. 2625/4969 cut-off events. For 2363/2363 co-relation queries the response was YES. Maximal size of possible extension queue 502. Compared 41579 event pairs, 729 based on Foata normal form. 0/4823 useless extension candidates. Maximal degree in co-relation 13108. Up to 2050 conditions per place. [2023-11-24 21:41:58,728 INFO L140 encePairwiseOnDemand]: 81/88 looper letters, 89 selfloop transitions, 14 changer transitions 0/119 dead transitions. [2023-11-24 21:41:58,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 119 transitions, 686 flow [2023-11-24 21:41:58,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-24 21:41:58,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-24 21:41:58,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 299 transitions. [2023-11-24 21:41:58,730 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4247159090909091 [2023-11-24 21:41:58,730 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 299 transitions. [2023-11-24 21:41:58,730 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 299 transitions. [2023-11-24 21:41:58,731 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:41:58,731 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 299 transitions. [2023-11-24 21:41:58,732 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 37.375) internal successors, (299), 8 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:58,734 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 88.0) internal successors, (792), 9 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:58,734 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 88.0) internal successors, (792), 9 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:58,735 INFO L175 Difference]: Start difference. First operand has 65 places, 49 transitions, 179 flow. Second operand 8 states and 299 transitions. [2023-11-24 21:41:58,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 119 transitions, 686 flow [2023-11-24 21:41:58,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 119 transitions, 672 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-24 21:41:58,740 INFO L231 Difference]: Finished difference. Result has 72 places, 59 transitions, 265 flow [2023-11-24 21:41:58,741 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=265, PETRI_PLACES=72, PETRI_TRANSITIONS=59} [2023-11-24 21:41:58,742 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -21 predicate places. [2023-11-24 21:41:58,742 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 59 transitions, 265 flow [2023-11-24 21:41:58,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:58,742 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:41:58,743 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:41:58,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-24 21:41:58,743 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-24 21:41:58,743 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:41:58,743 INFO L85 PathProgramCache]: Analyzing trace with hash -517017946, now seen corresponding path program 1 times [2023-11-24 21:41:58,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:41:58,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826887996] [2023-11-24 21:41:58,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:41:58,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:41:58,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:41:59,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:41:59,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:41:59,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826887996] [2023-11-24 21:41:59,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826887996] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:41:59,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:41:59,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 21:41:59,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655234427] [2023-11-24 21:41:59,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:41:59,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-24 21:41:59,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:41:59,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-24 21:41:59,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-11-24 21:41:59,186 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 88 [2023-11-24 21:41:59,187 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 59 transitions, 265 flow. Second operand has 7 states, 7 states have (on average 27.857142857142858) internal successors, (195), 7 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:59,187 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:41:59,187 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 88 [2023-11-24 21:41:59,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:41:59,764 INFO L124 PetriNetUnfolderBase]: 1323/2472 cut-off events. [2023-11-24 21:41:59,764 INFO L125 PetriNetUnfolderBase]: For 2047/2126 co-relation queries the response was YES. [2023-11-24 21:41:59,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6828 conditions, 2472 events. 1323/2472 cut-off events. For 2047/2126 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 18278 event pairs, 369 based on Foata normal form. 156/2547 useless extension candidates. Maximal degree in co-relation 6812. Up to 1022 conditions per place. [2023-11-24 21:41:59,776 INFO L140 encePairwiseOnDemand]: 79/88 looper letters, 22 selfloop transitions, 3 changer transitions 24/67 dead transitions. [2023-11-24 21:41:59,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 67 transitions, 376 flow [2023-11-24 21:41:59,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 21:41:59,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-24 21:41:59,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 195 transitions. [2023-11-24 21:41:59,778 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3693181818181818 [2023-11-24 21:41:59,778 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 195 transitions. [2023-11-24 21:41:59,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 195 transitions. [2023-11-24 21:41:59,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:41:59,778 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 195 transitions. [2023-11-24 21:41:59,779 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 32.5) internal successors, (195), 6 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:59,781 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 88.0) internal successors, (616), 7 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:59,781 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 88.0) internal successors, (616), 7 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:59,781 INFO L175 Difference]: Start difference. First operand has 72 places, 59 transitions, 265 flow. Second operand 6 states and 195 transitions. [2023-11-24 21:41:59,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 67 transitions, 376 flow [2023-11-24 21:41:59,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 67 transitions, 365 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:41:59,790 INFO L231 Difference]: Finished difference. Result has 70 places, 37 transitions, 120 flow [2023-11-24 21:41:59,790 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=120, PETRI_PLACES=70, PETRI_TRANSITIONS=37} [2023-11-24 21:41:59,791 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -23 predicate places. [2023-11-24 21:41:59,791 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 37 transitions, 120 flow [2023-11-24 21:41:59,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 27.857142857142858) internal successors, (195), 7 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:41:59,792 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:41:59,792 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:41:59,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-24 21:41:59,792 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-24 21:41:59,792 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:41:59,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1688033854, now seen corresponding path program 1 times [2023-11-24 21:41:59,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:41:59,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823548505] [2023-11-24 21:41:59,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:41:59,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:41:59,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:42:00,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:42:00,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:42:00,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823548505] [2023-11-24 21:42:00,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823548505] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:42:00,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:42:00,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 21:42:00,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239004973] [2023-11-24 21:42:00,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:42:00,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 21:42:00,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:42:00,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 21:42:00,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-24 21:42:00,114 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 88 [2023-11-24 21:42:00,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 37 transitions, 120 flow. Second operand has 6 states, 6 states have (on average 29.0) internal successors, (174), 6 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-24 21:42:00,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:42:00,115 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 88 [2023-11-24 21:42:00,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:42:00,634 INFO L124 PetriNetUnfolderBase]: 678/1404 cut-off events. [2023-11-24 21:42:00,634 INFO L125 PetriNetUnfolderBase]: For 660/668 co-relation queries the response was YES. [2023-11-24 21:42:00,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3345 conditions, 1404 events. 678/1404 cut-off events. For 660/668 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 9440 event pairs, 97 based on Foata normal form. 36/1414 useless extension candidates. Maximal degree in co-relation 3329. Up to 555 conditions per place. [2023-11-24 21:42:00,644 INFO L140 encePairwiseOnDemand]: 82/88 looper letters, 29 selfloop transitions, 2 changer transitions 36/84 dead transitions. [2023-11-24 21:42:00,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 84 transitions, 414 flow [2023-11-24 21:42:00,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-24 21:42:00,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-24 21:42:00,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 285 transitions. [2023-11-24 21:42:00,646 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40482954545454547 [2023-11-24 21:42:00,646 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 285 transitions. [2023-11-24 21:42:00,647 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 285 transitions. [2023-11-24 21:42:00,647 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:42:00,647 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 285 transitions. [2023-11-24 21:42:00,648 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 35.625) internal successors, (285), 8 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:42:00,652 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 88.0) internal successors, (792), 9 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:42:00,652 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 88.0) internal successors, (792), 9 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:42:00,652 INFO L175 Difference]: Start difference. First operand has 70 places, 37 transitions, 120 flow. Second operand 8 states and 285 transitions. [2023-11-24 21:42:00,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 84 transitions, 414 flow [2023-11-24 21:42:00,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 84 transitions, 379 flow, removed 5 selfloop flow, removed 10 redundant places. [2023-11-24 21:42:00,657 INFO L231 Difference]: Finished difference. Result has 63 places, 36 transitions, 111 flow [2023-11-24 21:42:00,658 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=111, PETRI_PLACES=63, PETRI_TRANSITIONS=36} [2023-11-24 21:42:00,659 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -30 predicate places. [2023-11-24 21:42:00,659 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 36 transitions, 111 flow [2023-11-24 21:42:00,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.0) internal successors, (174), 6 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-24 21:42:00,659 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:42:00,660 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:42:00,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-24 21:42:00,660 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-24 21:42:00,661 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:42:00,662 INFO L85 PathProgramCache]: Analyzing trace with hash -727613177, now seen corresponding path program 1 times [2023-11-24 21:42:00,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:42:00,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496959671] [2023-11-24 21:42:00,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:42:00,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:42:00,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:42:01,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:42:01,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:42:01,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496959671] [2023-11-24 21:42:01,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496959671] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:42:01,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:42:01,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-24 21:42:01,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364470535] [2023-11-24 21:42:01,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:42:01,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-24 21:42:01,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:42:01,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-24 21:42:01,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-24 21:42:01,685 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 88 [2023-11-24 21:42:01,686 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 36 transitions, 111 flow. Second operand has 7 states, 7 states have (on average 28.857142857142858) internal successors, (202), 7 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:42:01,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:42:01,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 88 [2023-11-24 21:42:01,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:42:02,186 INFO L124 PetriNetUnfolderBase]: 486/928 cut-off events. [2023-11-24 21:42:02,186 INFO L125 PetriNetUnfolderBase]: For 452/460 co-relation queries the response was YES. [2023-11-24 21:42:02,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2423 conditions, 928 events. 486/928 cut-off events. For 452/460 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 5392 event pairs, 114 based on Foata normal form. 24/932 useless extension candidates. Maximal degree in co-relation 2409. Up to 613 conditions per place. [2023-11-24 21:42:02,193 INFO L140 encePairwiseOnDemand]: 81/88 looper letters, 31 selfloop transitions, 6 changer transitions 21/75 dead transitions. [2023-11-24 21:42:02,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 75 transitions, 360 flow [2023-11-24 21:42:02,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-24 21:42:02,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-24 21:42:02,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 276 transitions. [2023-11-24 21:42:02,196 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39204545454545453 [2023-11-24 21:42:02,196 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 276 transitions. [2023-11-24 21:42:02,196 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 276 transitions. [2023-11-24 21:42:02,197 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:42:02,197 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 276 transitions. [2023-11-24 21:42:02,198 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 34.5) internal successors, (276), 8 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:42:02,200 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 88.0) internal successors, (792), 9 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:42:02,200 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 88.0) internal successors, (792), 9 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:42:02,201 INFO L175 Difference]: Start difference. First operand has 63 places, 36 transitions, 111 flow. Second operand 8 states and 276 transitions. [2023-11-24 21:42:02,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 75 transitions, 360 flow [2023-11-24 21:42:02,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 75 transitions, 338 flow, removed 8 selfloop flow, removed 6 redundant places. [2023-11-24 21:42:02,205 INFO L231 Difference]: Finished difference. Result has 63 places, 41 transitions, 157 flow [2023-11-24 21:42:02,205 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=157, PETRI_PLACES=63, PETRI_TRANSITIONS=41} [2023-11-24 21:42:02,206 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -30 predicate places. [2023-11-24 21:42:02,206 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 41 transitions, 157 flow [2023-11-24 21:42:02,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 28.857142857142858) internal successors, (202), 7 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:42:02,207 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:42:02,207 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] [2023-11-24 21:42:02,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-24 21:42:02,208 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-24 21:42:02,208 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:42:02,208 INFO L85 PathProgramCache]: Analyzing trace with hash -559264384, now seen corresponding path program 1 times [2023-11-24 21:42:02,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:42:02,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657860872] [2023-11-24 21:42:02,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:42:02,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:42:02,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:42:03,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:42:03,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:42:03,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657860872] [2023-11-24 21:42:03,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657860872] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:42:03,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:42:03,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-24 21:42:03,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979634852] [2023-11-24 21:42:03,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:42:03,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-24 21:42:03,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:42:03,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-24 21:42:03,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-24 21:42:03,365 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 88 [2023-11-24 21:42:03,366 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 41 transitions, 157 flow. Second operand has 7 states, 7 states have (on average 29.0) internal successors, (203), 7 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:42:03,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:42:03,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 88 [2023-11-24 21:42:03,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:42:04,166 INFO L124 PetriNetUnfolderBase]: 896/1806 cut-off events. [2023-11-24 21:42:04,166 INFO L125 PetriNetUnfolderBase]: For 1295/1311 co-relation queries the response was YES. [2023-11-24 21:42:04,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4641 conditions, 1806 events. 896/1806 cut-off events. For 1295/1311 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 13066 event pairs, 254 based on Foata normal form. 30/1812 useless extension candidates. Maximal degree in co-relation 4625. Up to 668 conditions per place. [2023-11-24 21:42:04,182 INFO L140 encePairwiseOnDemand]: 79/88 looper letters, 42 selfloop transitions, 12 changer transitions 21/92 dead transitions. [2023-11-24 21:42:04,183 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 92 transitions, 495 flow [2023-11-24 21:42:04,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-24 21:42:04,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-24 21:42:04,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 313 transitions. [2023-11-24 21:42:04,185 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3952020202020202 [2023-11-24 21:42:04,185 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 313 transitions. [2023-11-24 21:42:04,185 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 313 transitions. [2023-11-24 21:42:04,186 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:42:04,186 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 313 transitions. [2023-11-24 21:42:04,187 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 34.77777777777778) internal successors, (313), 9 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:42:04,190 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 88.0) internal successors, (880), 10 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:42:04,190 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 88.0) internal successors, (880), 10 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:42:04,191 INFO L175 Difference]: Start difference. First operand has 63 places, 41 transitions, 157 flow. Second operand 9 states and 313 transitions. [2023-11-24 21:42:04,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 92 transitions, 495 flow [2023-11-24 21:42:04,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 92 transitions, 449 flow, removed 23 selfloop flow, removed 4 redundant places. [2023-11-24 21:42:04,200 INFO L231 Difference]: Finished difference. Result has 69 places, 50 transitions, 238 flow [2023-11-24 21:42:04,200 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=238, PETRI_PLACES=69, PETRI_TRANSITIONS=50} [2023-11-24 21:42:04,201 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -24 predicate places. [2023-11-24 21:42:04,201 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 50 transitions, 238 flow [2023-11-24 21:42:04,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 29.0) internal successors, (203), 7 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:42:04,202 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:42:04,202 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] [2023-11-24 21:42:04,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-24 21:42:04,202 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-24 21:42:04,203 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:42:04,203 INFO L85 PathProgramCache]: Analyzing trace with hash 354383126, now seen corresponding path program 2 times [2023-11-24 21:42:04,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:42:04,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916039439] [2023-11-24 21:42:04,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:42:04,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:42:04,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:42:05,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:42:05,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:42:05,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916039439] [2023-11-24 21:42:05,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916039439] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:42:05,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:42:05,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-24 21:42:05,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498094852] [2023-11-24 21:42:05,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:42:05,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-24 21:42:05,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:42:05,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-24 21:42:05,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-24 21:42:05,556 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 88 [2023-11-24 21:42:05,557 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 50 transitions, 238 flow. Second operand has 8 states, 8 states have (on average 28.75) internal successors, (230), 8 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:42:05,557 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:42:05,557 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 88 [2023-11-24 21:42:05,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:42:06,637 INFO L124 PetriNetUnfolderBase]: 1045/2167 cut-off events. [2023-11-24 21:42:06,637 INFO L125 PetriNetUnfolderBase]: For 2566/2582 co-relation queries the response was YES. [2023-11-24 21:42:06,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6111 conditions, 2167 events. 1045/2167 cut-off events. For 2566/2582 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 16583 event pairs, 241 based on Foata normal form. 40/2159 useless extension candidates. Maximal degree in co-relation 6091. Up to 963 conditions per place. [2023-11-24 21:42:06,656 INFO L140 encePairwiseOnDemand]: 80/88 looper letters, 55 selfloop transitions, 16 changer transitions 38/126 dead transitions. [2023-11-24 21:42:06,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 126 transitions, 766 flow [2023-11-24 21:42:06,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-24 21:42:06,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-11-24 21:42:06,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 504 transitions. [2023-11-24 21:42:06,660 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38181818181818183 [2023-11-24 21:42:06,660 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 504 transitions. [2023-11-24 21:42:06,660 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 504 transitions. [2023-11-24 21:42:06,661 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:42:06,661 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 504 transitions. [2023-11-24 21:42:06,663 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 33.6) internal successors, (504), 15 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:42:06,666 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 88.0) internal successors, (1408), 16 states have internal predecessors, (1408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:42:06,666 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 88.0) internal successors, (1408), 16 states have internal predecessors, (1408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:42:06,666 INFO L175 Difference]: Start difference. First operand has 69 places, 50 transitions, 238 flow. Second operand 15 states and 504 transitions. [2023-11-24 21:42:06,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 126 transitions, 766 flow [2023-11-24 21:42:06,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 126 transitions, 725 flow, removed 20 selfloop flow, removed 5 redundant places. [2023-11-24 21:42:06,678 INFO L231 Difference]: Finished difference. Result has 87 places, 56 transitions, 359 flow [2023-11-24 21:42:06,679 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=359, PETRI_PLACES=87, PETRI_TRANSITIONS=56} [2023-11-24 21:42:06,679 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -6 predicate places. [2023-11-24 21:42:06,679 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 56 transitions, 359 flow [2023-11-24 21:42:06,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 28.75) internal successors, (230), 8 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:42:06,680 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:42:06,680 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:42:06,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-24 21:42:06,680 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-24 21:42:06,680 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:42:06,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1275241628, now seen corresponding path program 1 times [2023-11-24 21:42:06,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:42:06,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960682092] [2023-11-24 21:42:06,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:42:06,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:42:06,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:42:06,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:42:06,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:42:06,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960682092] [2023-11-24 21:42:06,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960682092] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:42:06,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:42:06,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-24 21:42:06,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718573049] [2023-11-24 21:42:06,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:42:06,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-24 21:42:06,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:42:06,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-24 21:42:06,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-24 21:42:06,863 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 88 [2023-11-24 21:42:06,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 56 transitions, 359 flow. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:42:06,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:42:06,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 88 [2023-11-24 21:42:06,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:42:07,818 INFO L124 PetriNetUnfolderBase]: 3214/5270 cut-off events. [2023-11-24 21:42:07,818 INFO L125 PetriNetUnfolderBase]: For 10683/10683 co-relation queries the response was YES. [2023-11-24 21:42:07,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15765 conditions, 5270 events. 3214/5270 cut-off events. For 10683/10683 co-relation queries the response was YES. Maximal size of possible extension queue 365. Compared 35821 event pairs, 583 based on Foata normal form. 245/5486 useless extension candidates. Maximal degree in co-relation 15735. Up to 2953 conditions per place. [2023-11-24 21:42:07,892 INFO L140 encePairwiseOnDemand]: 82/88 looper letters, 80 selfloop transitions, 5 changer transitions 1/99 dead transitions. [2023-11-24 21:42:07,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 99 transitions, 854 flow [2023-11-24 21:42:07,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 21:42:07,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-24 21:42:07,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 144 transitions. [2023-11-24 21:42:07,893 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2023-11-24 21:42:07,894 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 144 transitions. [2023-11-24 21:42:07,894 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 144 transitions. [2023-11-24 21:42:07,894 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:42:07,894 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 144 transitions. [2023-11-24 21:42:07,895 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:42:07,896 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 88.0) internal successors, (440), 5 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:42:07,896 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 88.0) internal successors, (440), 5 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:42:07,896 INFO L175 Difference]: Start difference. First operand has 87 places, 56 transitions, 359 flow. Second operand 4 states and 144 transitions. [2023-11-24 21:42:07,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 99 transitions, 854 flow [2023-11-24 21:42:07,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 99 transitions, 784 flow, removed 32 selfloop flow, removed 9 redundant places. [2023-11-24 21:42:07,935 INFO L231 Difference]: Finished difference. Result has 75 places, 59 transitions, 349 flow [2023-11-24 21:42:07,935 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=315, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=349, PETRI_PLACES=75, PETRI_TRANSITIONS=59} [2023-11-24 21:42:07,936 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -18 predicate places. [2023-11-24 21:42:07,936 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 59 transitions, 349 flow [2023-11-24 21:42:07,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:42:07,936 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:42:07,936 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:42:07,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-24 21:42:07,936 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-24 21:42:07,937 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:42:07,937 INFO L85 PathProgramCache]: Analyzing trace with hash 557981283, now seen corresponding path program 1 times [2023-11-24 21:42:07,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:42:07,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141429285] [2023-11-24 21:42:07,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:42:07,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:42:07,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:42:08,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:42:08,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:42:08,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141429285] [2023-11-24 21:42:08,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141429285] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:42:08,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:42:08,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 21:42:08,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030798576] [2023-11-24 21:42:08,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:42:08,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 21:42:08,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:42:08,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 21:42:08,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-24 21:42:08,162 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 88 [2023-11-24 21:42:08,163 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 59 transitions, 349 flow. Second operand has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:42:08,163 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:42:08,163 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 88 [2023-11-24 21:42:08,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:42:08,880 INFO L124 PetriNetUnfolderBase]: 2219/3642 cut-off events. [2023-11-24 21:42:08,880 INFO L125 PetriNetUnfolderBase]: For 5823/5831 co-relation queries the response was YES. [2023-11-24 21:42:08,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11414 conditions, 3642 events. 2219/3642 cut-off events. For 5823/5831 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 22639 event pairs, 171 based on Foata normal form. 230/3852 useless extension candidates. Maximal degree in co-relation 11389. Up to 1497 conditions per place. [2023-11-24 21:42:08,914 INFO L140 encePairwiseOnDemand]: 82/88 looper letters, 88 selfloop transitions, 8 changer transitions 3/112 dead transitions. [2023-11-24 21:42:08,914 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 112 transitions, 889 flow [2023-11-24 21:42:08,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 21:42:08,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-24 21:42:08,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 181 transitions. [2023-11-24 21:42:08,916 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4113636363636364 [2023-11-24 21:42:08,916 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 181 transitions. [2023-11-24 21:42:08,916 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 181 transitions. [2023-11-24 21:42:08,916 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:42:08,916 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 181 transitions. [2023-11-24 21:42:08,917 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 36.2) internal successors, (181), 5 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:42:08,918 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 88.0) internal successors, (528), 6 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:42:08,918 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 88.0) internal successors, (528), 6 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:42:08,918 INFO L175 Difference]: Start difference. First operand has 75 places, 59 transitions, 349 flow. Second operand 5 states and 181 transitions. [2023-11-24 21:42:08,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 112 transitions, 889 flow [2023-11-24 21:42:08,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 112 transitions, 866 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-11-24 21:42:08,931 INFO L231 Difference]: Finished difference. Result has 78 places, 60 transitions, 358 flow [2023-11-24 21:42:08,931 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=358, PETRI_PLACES=78, PETRI_TRANSITIONS=60} [2023-11-24 21:42:08,931 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -15 predicate places. [2023-11-24 21:42:08,932 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 60 transitions, 358 flow [2023-11-24 21:42:08,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:42:08,932 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:42:08,932 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:42:08,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-24 21:42:08,932 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-24 21:42:08,933 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:42:08,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1379307314, now seen corresponding path program 1 times [2023-11-24 21:42:08,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:42:08,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057731702] [2023-11-24 21:42:08,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:42:08,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:42:08,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:42:09,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:42:09,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:42:09,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057731702] [2023-11-24 21:42:09,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057731702] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:42:09,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:42:09,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 21:42:09,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079796259] [2023-11-24 21:42:09,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:42:09,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 21:42:09,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:42:09,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 21:42:09,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-24 21:42:09,166 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 88 [2023-11-24 21:42:09,167 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 60 transitions, 358 flow. Second operand has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:42:09,167 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:42:09,167 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 88 [2023-11-24 21:42:09,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:42:09,673 INFO L124 PetriNetUnfolderBase]: 1338/2225 cut-off events. [2023-11-24 21:42:09,673 INFO L125 PetriNetUnfolderBase]: For 4560/4576 co-relation queries the response was YES. [2023-11-24 21:42:09,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7531 conditions, 2225 events. 1338/2225 cut-off events. For 4560/4576 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 12539 event pairs, 82 based on Foata normal form. 156/2367 useless extension candidates. Maximal degree in co-relation 7505. Up to 868 conditions per place. [2023-11-24 21:42:09,691 INFO L140 encePairwiseOnDemand]: 82/88 looper letters, 75 selfloop transitions, 11 changer transitions 2/101 dead transitions. [2023-11-24 21:42:09,692 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 101 transitions, 777 flow [2023-11-24 21:42:09,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 21:42:09,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-24 21:42:09,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 202 transitions. [2023-11-24 21:42:09,693 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38257575757575757 [2023-11-24 21:42:09,694 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 202 transitions. [2023-11-24 21:42:09,694 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 202 transitions. [2023-11-24 21:42:09,694 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:42:09,694 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 202 transitions. [2023-11-24 21:42:09,695 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 33.666666666666664) internal successors, (202), 6 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:42:09,696 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 88.0) internal successors, (616), 7 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:42:09,696 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 88.0) internal successors, (616), 7 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:42:09,696 INFO L175 Difference]: Start difference. First operand has 78 places, 60 transitions, 358 flow. Second operand 6 states and 202 transitions. [2023-11-24 21:42:09,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 101 transitions, 777 flow [2023-11-24 21:42:09,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 101 transitions, 706 flow, removed 9 selfloop flow, removed 9 redundant places. [2023-11-24 21:42:09,711 INFO L231 Difference]: Finished difference. Result has 76 places, 58 transitions, 326 flow [2023-11-24 21:42:09,711 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=326, PETRI_PLACES=76, PETRI_TRANSITIONS=58} [2023-11-24 21:42:09,712 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -17 predicate places. [2023-11-24 21:42:09,712 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 58 transitions, 326 flow [2023-11-24 21:42:09,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:42:09,713 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:42:09,713 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:42:09,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-24 21:42:09,713 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-24 21:42:09,714 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:42:09,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1956305096, now seen corresponding path program 1 times [2023-11-24 21:42:09,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:42:09,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922261866] [2023-11-24 21:42:09,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:42:09,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:42:09,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-24 21:42:09,804 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-24 21:42:09,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-24 21:42:09,964 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-24 21:42:09,965 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-24 21:42:09,966 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (76 of 77 remaining) [2023-11-24 21:42:09,968 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 77 remaining) [2023-11-24 21:42:09,968 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 77 remaining) [2023-11-24 21:42:09,971 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 77 remaining) [2023-11-24 21:42:09,972 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 77 remaining) [2023-11-24 21:42:09,972 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 77 remaining) [2023-11-24 21:42:09,972 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 77 remaining) [2023-11-24 21:42:09,973 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 77 remaining) [2023-11-24 21:42:09,973 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 77 remaining) [2023-11-24 21:42:09,973 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 77 remaining) [2023-11-24 21:42:09,973 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 77 remaining) [2023-11-24 21:42:09,974 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 77 remaining) [2023-11-24 21:42:09,974 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 77 remaining) [2023-11-24 21:42:09,974 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 77 remaining) [2023-11-24 21:42:09,974 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 77 remaining) [2023-11-24 21:42:09,974 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 77 remaining) [2023-11-24 21:42:09,974 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 77 remaining) [2023-11-24 21:42:09,974 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 77 remaining) [2023-11-24 21:42:09,975 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 77 remaining) [2023-11-24 21:42:09,975 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 77 remaining) [2023-11-24 21:42:09,975 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 77 remaining) [2023-11-24 21:42:09,975 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 77 remaining) [2023-11-24 21:42:09,975 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 77 remaining) [2023-11-24 21:42:09,975 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 77 remaining) [2023-11-24 21:42:09,976 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 77 remaining) [2023-11-24 21:42:09,976 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 77 remaining) [2023-11-24 21:42:09,976 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 77 remaining) [2023-11-24 21:42:09,976 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 77 remaining) [2023-11-24 21:42:09,976 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 77 remaining) [2023-11-24 21:42:09,976 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 77 remaining) [2023-11-24 21:42:09,976 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 77 remaining) [2023-11-24 21:42:09,977 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 77 remaining) [2023-11-24 21:42:09,977 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 77 remaining) [2023-11-24 21:42:09,977 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 77 remaining) [2023-11-24 21:42:09,977 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 77 remaining) [2023-11-24 21:42:09,977 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 77 remaining) [2023-11-24 21:42:09,977 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 77 remaining) [2023-11-24 21:42:09,978 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 77 remaining) [2023-11-24 21:42:09,978 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 77 remaining) [2023-11-24 21:42:09,978 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 77 remaining) [2023-11-24 21:42:09,978 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 77 remaining) [2023-11-24 21:42:09,978 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 77 remaining) [2023-11-24 21:42:09,978 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 77 remaining) [2023-11-24 21:42:09,978 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (33 of 77 remaining) [2023-11-24 21:42:09,979 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (32 of 77 remaining) [2023-11-24 21:42:09,979 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 77 remaining) [2023-11-24 21:42:09,979 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 77 remaining) [2023-11-24 21:42:09,979 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 77 remaining) [2023-11-24 21:42:09,979 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 77 remaining) [2023-11-24 21:42:09,979 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 77 remaining) [2023-11-24 21:42:09,979 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 77 remaining) [2023-11-24 21:42:09,980 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 77 remaining) [2023-11-24 21:42:09,980 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 77 remaining) [2023-11-24 21:42:09,980 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 77 remaining) [2023-11-24 21:42:09,980 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 77 remaining) [2023-11-24 21:42:09,980 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 77 remaining) [2023-11-24 21:42:09,980 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 77 remaining) [2023-11-24 21:42:09,981 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 77 remaining) [2023-11-24 21:42:09,981 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 77 remaining) [2023-11-24 21:42:09,981 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 77 remaining) [2023-11-24 21:42:09,981 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 77 remaining) [2023-11-24 21:42:09,981 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 77 remaining) [2023-11-24 21:42:09,981 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 77 remaining) [2023-11-24 21:42:09,982 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 77 remaining) [2023-11-24 21:42:09,982 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 77 remaining) [2023-11-24 21:42:09,982 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 77 remaining) [2023-11-24 21:42:09,982 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 77 remaining) [2023-11-24 21:42:09,982 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 77 remaining) [2023-11-24 21:42:09,982 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 77 remaining) [2023-11-24 21:42:09,982 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 77 remaining) [2023-11-24 21:42:09,983 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 77 remaining) [2023-11-24 21:42:09,983 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 77 remaining) [2023-11-24 21:42:09,983 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 77 remaining) [2023-11-24 21:42:09,985 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 77 remaining) [2023-11-24 21:42:09,986 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 77 remaining) [2023-11-24 21:42:09,986 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 77 remaining) [2023-11-24 21:42:09,986 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 77 remaining) [2023-11-24 21:42:09,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-24 21:42:09,986 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:42:09,995 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-24 21:42:09,996 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-24 21:42:10,085 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre22 could not be translated [2023-11-24 21:42:10,091 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre24 could not be translated [2023-11-24 21:42:10,099 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre26 could not be translated [2023-11-24 21:42:10,141 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 09:42:10 BasicIcfg [2023-11-24 21:42:10,149 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-24 21:42:10,150 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-24 21:42:10,150 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-24 21:42:10,150 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-24 21:42:10,151 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 09:41:36" (3/4) ... [2023-11-24 21:42:10,152 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-24 21:42:10,154 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-24 21:42:10,154 INFO L158 Benchmark]: Toolchain (without parser) took 36245.79ms. Allocated memory was 123.7MB in the beginning and 3.3GB in the end (delta: 3.2GB). Free memory was 78.1MB in the beginning and 1.6GB in the end (delta: -1.6GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2023-11-24 21:42:10,155 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 123.7MB. Free memory is still 97.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-24 21:42:10,155 INFO L158 Benchmark]: CACSL2BoogieTranslator took 699.12ms. Allocated memory was 123.7MB in the beginning and 172.0MB in the end (delta: 48.2MB). Free memory was 77.7MB in the beginning and 142.8MB in the end (delta: -65.1MB). Peak memory consumption was 32.1MB. Max. memory is 16.1GB. [2023-11-24 21:42:10,155 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.20ms. Allocated memory is still 172.0MB. Free memory was 142.8MB in the beginning and 139.8MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-24 21:42:10,156 INFO L158 Benchmark]: Boogie Preprocessor took 101.63ms. Allocated memory is still 172.0MB. Free memory was 139.8MB in the beginning and 135.5MB in the end (delta: 4.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-24 21:42:10,156 INFO L158 Benchmark]: RCFGBuilder took 1586.50ms. Allocated memory is still 172.0MB. Free memory was 135.5MB in the beginning and 66.0MB in the end (delta: 69.5MB). Peak memory consumption was 71.3MB. Max. memory is 16.1GB. [2023-11-24 21:42:10,158 INFO L158 Benchmark]: TraceAbstraction took 33775.99ms. Allocated memory was 172.0MB in the beginning and 3.3GB in the end (delta: 3.1GB). Free memory was 64.9MB in the beginning and 1.6GB in the end (delta: -1.6GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2023-11-24 21:42:10,158 INFO L158 Benchmark]: Witness Printer took 4.08ms. Allocated memory is still 3.3GB. Free memory was 1.6GB in the beginning and 1.6GB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-24 21:42:10,160 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.34ms. Allocated memory is still 123.7MB. Free memory is still 97.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 699.12ms. Allocated memory was 123.7MB in the beginning and 172.0MB in the end (delta: 48.2MB). Free memory was 77.7MB in the beginning and 142.8MB in the end (delta: -65.1MB). Peak memory consumption was 32.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.20ms. Allocated memory is still 172.0MB. Free memory was 142.8MB in the beginning and 139.8MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 101.63ms. Allocated memory is still 172.0MB. Free memory was 139.8MB in the beginning and 135.5MB in the end (delta: 4.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1586.50ms. Allocated memory is still 172.0MB. Free memory was 135.5MB in the beginning and 66.0MB in the end (delta: 69.5MB). Peak memory consumption was 71.3MB. Max. memory is 16.1GB. * TraceAbstraction took 33775.99ms. Allocated memory was 172.0MB in the beginning and 3.3GB in the end (delta: 3.1GB). Free memory was 64.9MB in the beginning and 1.6GB in the end (delta: -1.6GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. * Witness Printer took 4.08ms. Allocated memory is still 3.3GB. Free memory was 1.6GB in the beginning and 1.6GB in the end (delta: 1.0MB). 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~pre22 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre24 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre26 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_p0_EBX = 0; [L732] 0 int __unbuffered_p1_EAX = 0; [L734] 0 int __unbuffered_p1_EBX = 0; [L735] 0 _Bool main$tmp_guard0; [L736] 0 _Bool main$tmp_guard1; [L738] 0 int x = 0; [L738] 0 int x = 0; [L739] 0 _Bool x$flush_delayed; [L740] 0 int x$mem_tmp; [L741] 0 _Bool x$r_buff0_thd0; [L742] 0 _Bool x$r_buff0_thd1; [L743] 0 _Bool x$r_buff0_thd2; [L744] 0 _Bool x$r_buff0_thd3; [L745] 0 _Bool x$r_buff1_thd0; [L746] 0 _Bool x$r_buff1_thd1; [L747] 0 _Bool x$r_buff1_thd2; [L748] 0 _Bool x$r_buff1_thd3; [L749] 0 _Bool x$read_delayed; [L750] 0 int *x$read_delayed_var; [L751] 0 int x$w_buff0; [L752] 0 _Bool x$w_buff0_used; [L753] 0 int x$w_buff1; [L754] 0 _Bool x$w_buff1_used; [L756] 0 int y = 0; [L757] 0 _Bool weak$$choice0; [L758] 0 _Bool weak$$choice1; [L759] 0 _Bool weak$$choice2; [L849] 0 pthread_t t1749; [L850] FCALL, FORK 0 pthread_create(&t1749, ((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_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1749={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] [L763] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 1 x$flush_delayed = weak$$choice2 [L766] EXPR 1 \read(x) [L766] 1 x$mem_tmp = x [L767] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L767] EXPR 1 \read(x) [L767] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L767] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L768] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L769] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L770] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L771] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L772] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L773] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L774] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L775] 1 __unbuffered_p0_EAX$read_delayed_var = &x [L776] EXPR 1 \read(x) [L776] 1 __unbuffered_p0_EAX = x [L777] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L777] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L777] 1 x = x$flush_delayed ? x$mem_tmp : x [L778] 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_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, 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] [L781] 1 __unbuffered_p0_EBX = 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_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, 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] [L851] 0 pthread_t t1750; [L852] FCALL, FORK 0 pthread_create(&t1750, ((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_p0_EBX=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, t1749={6:0}, t1750={7:0}, weak$$choice1=0, weak$$choice2=1, 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] [L793] 2 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_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, 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] [L796] 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_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, 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] [L799] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L800] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L801] 2 x$flush_delayed = weak$$choice2 [L802] EXPR 2 \read(x) [L802] 2 x$mem_tmp = x [L803] 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) [L803] EXPR 2 \read(x) [L803] 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) [L803] 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) [L804] 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)) [L805] 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)) [L806] 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)) [L807] 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)) [L808] 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)) [L809] 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)) [L810] EXPR 2 \read(x) [L810] 2 __unbuffered_p1_EBX = x [L811] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L811] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L811] 2 x = x$flush_delayed ? x$mem_tmp : x [L812] 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_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, 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] [L853] 0 pthread_t t1751; [L854] FCALL, FORK 0 pthread_create(&t1751, ((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_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1749={6:0}, t1750={7:0}, t1751={5:0}, weak$$choice1=0, weak$$choice2=1, 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] [L824] 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_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, 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] [L827] 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) [L827] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L827] EXPR 3 \read(x) [L827] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L827] 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) [L827] 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) [L828] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L829] 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 [L830] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L831] 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_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, 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] [L786] 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_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, 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] [L817] 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_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, 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] [L834] 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_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, 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] [L856] 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_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1749={6:0}, t1750={7:0}, t1751={5:0}, weak$$choice1=0, weak$$choice2=1, 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] [L858] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L858] RET 0 assume_abort_if_not(main$tmp_guard0) [L860] 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) [L860] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L860] EXPR 0 \read(x) [L860] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L860] 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) [L860] 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) [L861] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L862] 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 [L863] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L864] 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_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1749={6:0}, t1750={7:0}, t1751={5:0}, weak$$choice1=0, weak$$choice2=1, 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] [L867] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L868] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L868] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L868] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L868] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L868] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L868] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L869] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX$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_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1749={6:0}, t1750={7:0}, t1751={5:0}, weak$$choice1=1, weak$$choice2=1, 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] [L871] 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_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=1, 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] [L18] 0 __assert_fail ("0", "rfi009_rmo.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_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=1, 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] - 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: 847]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 852]: 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: 850]: 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: 854]: 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, 141 locations, 77 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: 33.4s, OverallIterations: 22, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 25.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1174 SdHoareTripleChecker+Valid, 3.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1004 mSDsluCounter, 77 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 38 mSDsCounter, 123 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2569 IncrementalHoareTripleChecker+Invalid, 2692 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 123 mSolverCounterUnsat, 39 mSDtfsCounter, 2569 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 108 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=359occurred in iteration=18, InterpolantAutomatonStates: 111, 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.6s SatisfiabilityAnalysisTime, 6.5s InterpolantComputationTime, 348 NumberOfCodeBlocks, 348 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 294 ConstructedInterpolants, 0 QuantifiedInterpolants, 2441 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-24 21:42:10,187 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b751d-de18-4de7-8a9e-f123072e3863/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b751d-de18-4de7-8a9e-f123072e3863/bin/uautomizer-verify-NlZe1sFDwI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b751d-de18-4de7-8a9e-f123072e3863/bin/uautomizer-verify-NlZe1sFDwI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b751d-de18-4de7-8a9e-f123072e3863/bin/uautomizer-verify-NlZe1sFDwI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b751d-de18-4de7-8a9e-f123072e3863/bin/uautomizer-verify-NlZe1sFDwI/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi009_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b751d-de18-4de7-8a9e-f123072e3863/bin/uautomizer-verify-NlZe1sFDwI/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b751d-de18-4de7-8a9e-f123072e3863/bin/uautomizer-verify-NlZe1sFDwI --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6efd977ba774fd706e089a911dcd82549d76c764859cf8b84047b990ab28d067 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-24 21:42:12,939 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-24 21:42:13,035 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b751d-de18-4de7-8a9e-f123072e3863/bin/uautomizer-verify-NlZe1sFDwI/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-24 21:42:13,042 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-24 21:42:13,043 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-24 21:42:13,075 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-24 21:42:13,076 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-24 21:42:13,076 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-24 21:42:13,077 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-24 21:42:13,078 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-24 21:42:13,078 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-24 21:42:13,079 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-24 21:42:13,080 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-24 21:42:13,081 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-24 21:42:13,081 INFO L153 SettingsManager]: * Use SBE=true [2023-11-24 21:42:13,082 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-24 21:42:13,083 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-24 21:42:13,083 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-24 21:42:13,084 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-24 21:42:13,085 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-24 21:42:13,085 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-24 21:42:13,086 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-24 21:42:13,087 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-24 21:42:13,087 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-24 21:42:13,088 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-24 21:42:13,089 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-24 21:42:13,089 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-24 21:42:13,090 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-24 21:42:13,090 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-24 21:42:13,091 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-24 21:42:13,091 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-24 21:42:13,092 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-24 21:42:13,093 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-24 21:42:13,093 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-24 21:42:13,094 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 21:42:13,094 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-24 21:42:13,095 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-24 21:42:13,095 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-24 21:42:13,096 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-24 21:42:13,096 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-24 21:42:13,096 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-24 21:42:13,097 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-24 21:42:13,097 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-24 21:42:13,097 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-24 21:42:13,098 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_950b751d-de18-4de7-8a9e-f123072e3863/bin/uautomizer-verify-NlZe1sFDwI/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b751d-de18-4de7-8a9e-f123072e3863/bin/uautomizer-verify-NlZe1sFDwI Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6efd977ba774fd706e089a911dcd82549d76c764859cf8b84047b990ab28d067 [2023-11-24 21:42:13,472 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-24 21:42:13,500 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-24 21:42:13,503 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-24 21:42:13,504 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-24 21:42:13,506 INFO L274 PluginConnector]: CDTParser initialized [2023-11-24 21:42:13,507 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_950b751d-de18-4de7-8a9e-f123072e3863/bin/uautomizer-verify-NlZe1sFDwI/../../sv-benchmarks/c/pthread-wmm/rfi009_rmo.oepc.i