./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix004.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8393723b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98918b0-758e-4464-9b6a-4e4adc2934bf/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98918b0-758e-4464-9b6a-4e4adc2934bf/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98918b0-758e-4464-9b6a-4e4adc2934bf/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98918b0-758e-4464-9b6a-4e4adc2934bf/bin/uautomizer-TMbwUNV5ro/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix004.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98918b0-758e-4464-9b6a-4e4adc2934bf/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98918b0-758e-4464-9b6a-4e4adc2934bf/bin/uautomizer-TMbwUNV5ro --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 81dfcecae183e47a2274a923e55daf761c46d6146ab2c58970ae115599afe231 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-8393723 [2022-11-18 21:10:23,884 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 21:10:23,886 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 21:10:23,907 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 21:10:23,908 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 21:10:23,909 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 21:10:23,910 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 21:10:23,912 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 21:10:23,914 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 21:10:23,915 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 21:10:23,916 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 21:10:23,917 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 21:10:23,918 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 21:10:23,919 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 21:10:23,920 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 21:10:23,922 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 21:10:23,923 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 21:10:23,924 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 21:10:23,926 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 21:10:23,928 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 21:10:23,930 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 21:10:23,932 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 21:10:23,934 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 21:10:23,935 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 21:10:23,939 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 21:10:23,940 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 21:10:23,940 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 21:10:23,941 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 21:10:23,942 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 21:10:23,943 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 21:10:23,944 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 21:10:23,945 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 21:10:23,946 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 21:10:23,947 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 21:10:23,948 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 21:10:23,949 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 21:10:23,950 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 21:10:23,950 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 21:10:23,950 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 21:10:23,952 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 21:10:23,953 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 21:10:23,954 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98918b0-758e-4464-9b6a-4e4adc2934bf/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-18 21:10:23,989 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 21:10:23,989 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 21:10:23,990 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 21:10:23,990 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 21:10:23,991 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 21:10:23,991 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 21:10:23,992 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 21:10:23,992 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 21:10:23,992 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 21:10:23,992 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 21:10:23,993 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 21:10:23,993 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 21:10:23,993 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 21:10:23,993 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 21:10:23,994 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 21:10:23,994 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 21:10:23,994 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 21:10:23,994 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 21:10:23,994 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 21:10:23,995 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 21:10:23,995 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 21:10:23,995 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 21:10:23,995 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 21:10:23,996 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 21:10:23,996 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 21:10:23,996 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 21:10:23,996 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 21:10:23,996 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 21:10:23,997 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 21:10:23,997 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 21:10:23,997 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 21:10:23,997 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 21:10:23,998 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 21:10:23,998 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_e98918b0-758e-4464-9b6a-4e4adc2934bf/bin/uautomizer-TMbwUNV5ro/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_e98918b0-758e-4464-9b6a-4e4adc2934bf/bin/uautomizer-TMbwUNV5ro Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 ! call(reach_error())) ) 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 -> 81dfcecae183e47a2274a923e55daf761c46d6146ab2c58970ae115599afe231 [2022-11-18 21:10:24,258 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 21:10:24,282 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 21:10:24,285 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 21:10:24,287 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 21:10:24,290 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 21:10:24,292 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98918b0-758e-4464-9b6a-4e4adc2934bf/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/pthread-wmm/mix004.oepc.i [2022-11-18 21:10:24,369 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98918b0-758e-4464-9b6a-4e4adc2934bf/bin/uautomizer-TMbwUNV5ro/data/0ad4675a1/db29b74f3433446897a10a36e863d803/FLAG85aaf113a [2022-11-18 21:10:24,994 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 21:10:25,009 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98918b0-758e-4464-9b6a-4e4adc2934bf/sv-benchmarks/c/pthread-wmm/mix004.oepc.i [2022-11-18 21:10:25,026 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98918b0-758e-4464-9b6a-4e4adc2934bf/bin/uautomizer-TMbwUNV5ro/data/0ad4675a1/db29b74f3433446897a10a36e863d803/FLAG85aaf113a [2022-11-18 21:10:25,265 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98918b0-758e-4464-9b6a-4e4adc2934bf/bin/uautomizer-TMbwUNV5ro/data/0ad4675a1/db29b74f3433446897a10a36e863d803 [2022-11-18 21:10:25,268 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 21:10:25,270 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 21:10:25,272 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 21:10:25,273 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 21:10:25,277 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 21:10:25,278 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:10:25" (1/1) ... [2022-11-18 21:10:25,279 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@234f5c38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:10:25, skipping insertion in model container [2022-11-18 21:10:25,279 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:10:25" (1/1) ... [2022-11-18 21:10:25,288 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 21:10:25,351 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 21:10:25,588 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98918b0-758e-4464-9b6a-4e4adc2934bf/sv-benchmarks/c/pthread-wmm/mix004.oepc.i[945,958] [2022-11-18 21:10:25,811 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 21:10:25,829 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 21:10:25,850 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98918b0-758e-4464-9b6a-4e4adc2934bf/sv-benchmarks/c/pthread-wmm/mix004.oepc.i[945,958] [2022-11-18 21:10:25,960 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 21:10:26,012 INFO L208 MainTranslator]: Completed translation [2022-11-18 21:10:26,012 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:10:26 WrapperNode [2022-11-18 21:10:26,012 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 21:10:26,014 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 21:10:26,014 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 21:10:26,015 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 21:10:26,023 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:10:26" (1/1) ... [2022-11-18 21:10:26,062 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:10:26" (1/1) ... [2022-11-18 21:10:26,101 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 147 [2022-11-18 21:10:26,102 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 21:10:26,102 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 21:10:26,102 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 21:10:26,103 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 21:10:26,112 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:10:26" (1/1) ... [2022-11-18 21:10:26,113 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:10:26" (1/1) ... [2022-11-18 21:10:26,116 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:10:26" (1/1) ... [2022-11-18 21:10:26,116 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:10:26" (1/1) ... [2022-11-18 21:10:26,124 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:10:26" (1/1) ... [2022-11-18 21:10:26,126 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:10:26" (1/1) ... [2022-11-18 21:10:26,128 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:10:26" (1/1) ... [2022-11-18 21:10:26,130 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:10:26" (1/1) ... [2022-11-18 21:10:26,133 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 21:10:26,134 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 21:10:26,134 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 21:10:26,134 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 21:10:26,138 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:10:26" (1/1) ... [2022-11-18 21:10:26,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 21:10:26,168 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98918b0-758e-4464-9b6a-4e4adc2934bf/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 21:10:26,189 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98918b0-758e-4464-9b6a-4e4adc2934bf/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 21:10:26,219 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e98918b0-758e-4464-9b6a-4e4adc2934bf/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 21:10:26,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-18 21:10:26,239 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-18 21:10:26,239 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 21:10:26,239 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-18 21:10:26,240 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 21:10:26,240 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-18 21:10:26,240 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-18 21:10:26,240 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-18 21:10:26,241 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-18 21:10:26,242 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-18 21:10:26,242 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-18 21:10:26,242 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-18 21:10:26,242 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-18 21:10:26,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 21:10:26,243 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-18 21:10:26,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 21:10:26,243 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 21:10:26,244 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-18 21:10:26,456 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 21:10:26,459 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 21:10:26,901 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 21:10:27,239 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 21:10:27,239 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-18 21:10:27,242 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:10:27 BoogieIcfgContainer [2022-11-18 21:10:27,242 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 21:10:27,245 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 21:10:27,245 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 21:10:27,249 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 21:10:27,250 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 09:10:25" (1/3) ... [2022-11-18 21:10:27,250 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42ccc32e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:10:27, skipping insertion in model container [2022-11-18 21:10:27,251 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:10:26" (2/3) ... [2022-11-18 21:10:27,251 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42ccc32e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:10:27, skipping insertion in model container [2022-11-18 21:10:27,251 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:10:27" (3/3) ... [2022-11-18 21:10:27,253 INFO L112 eAbstractionObserver]: Analyzing ICFG mix004.oepc.i [2022-11-18 21:10:27,262 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-18 21:10:27,274 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 21:10:27,275 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-18 21:10:27,275 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-18 21:10:27,393 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-18 21:10:27,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 152 places, 141 transitions, 302 flow [2022-11-18 21:10:27,507 INFO L130 PetriNetUnfolder]: 2/137 cut-off events. [2022-11-18 21:10:27,508 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-18 21:10:27,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150 conditions, 137 events. 2/137 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 75 event pairs, 0 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 93. Up to 2 conditions per place. [2022-11-18 21:10:27,514 INFO L82 GeneralOperation]: Start removeDead. Operand has 152 places, 141 transitions, 302 flow [2022-11-18 21:10:27,520 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 148 places, 137 transitions, 286 flow [2022-11-18 21:10:27,531 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 21:10:27,538 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@6f141b87, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 21:10:27,539 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-11-18 21:10:27,554 INFO L130 PetriNetUnfolder]: 0/53 cut-off events. [2022-11-18 21:10:27,554 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-18 21:10:27,555 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 21:10:27,555 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:10:27,556 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 21:10:27,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:10:27,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1322941922, now seen corresponding path program 1 times [2022-11-18 21:10:27,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:10:27,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601081988] [2022-11-18 21:10:27,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:10:27,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:10:27,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:10:28,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 21:10:28,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:10:28,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601081988] [2022-11-18 21:10:28,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601081988] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:10:28,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:10:28,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 21:10:28,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025808169] [2022-11-18 21:10:28,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:10:28,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 21:10:28,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:10:28,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 21:10:28,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 21:10:28,304 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 141 [2022-11-18 21:10:28,308 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 137 transitions, 286 flow. Second operand has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:10:28,308 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 21:10:28,308 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 141 [2022-11-18 21:10:28,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 21:10:28,653 INFO L130 PetriNetUnfolder]: 162/551 cut-off events. [2022-11-18 21:10:28,653 INFO L131 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2022-11-18 21:10:28,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 857 conditions, 551 events. 162/551 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2902 event pairs, 34 based on Foata normal form. 53/575 useless extension candidates. Maximal degree in co-relation 797. Up to 191 conditions per place. [2022-11-18 21:10:28,668 INFO L137 encePairwiseOnDemand]: 136/141 looper letters, 18 selfloop transitions, 2 changer transitions 0/141 dead transitions. [2022-11-18 21:10:28,669 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 141 transitions, 343 flow [2022-11-18 21:10:28,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 21:10:28,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-18 21:10:28,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 400 transitions. [2022-11-18 21:10:28,694 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9456264775413712 [2022-11-18 21:10:28,695 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 400 transitions. [2022-11-18 21:10:28,695 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 400 transitions. [2022-11-18 21:10:28,702 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 21:10:28,704 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 400 transitions. [2022-11-18 21:10:28,712 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:10:28,724 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 141.0) internal successors, (564), 4 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:10:28,726 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 141.0) internal successors, (564), 4 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:10:28,728 INFO L175 Difference]: Start difference. First operand has 148 places, 137 transitions, 286 flow. Second operand 3 states and 400 transitions. [2022-11-18 21:10:28,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 141 transitions, 343 flow [2022-11-18 21:10:28,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 141 transitions, 336 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-18 21:10:28,742 INFO L231 Difference]: Finished difference. Result has 144 places, 133 transitions, 278 flow [2022-11-18 21:10:28,745 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=278, PETRI_PLACES=144, PETRI_TRANSITIONS=133} [2022-11-18 21:10:28,752 INFO L288 CegarLoopForPetriNet]: 148 programPoint places, -4 predicate places. [2022-11-18 21:10:28,753 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 133 transitions, 278 flow [2022-11-18 21:10:28,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:10:28,754 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 21:10:28,755 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:10:28,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 21:10:28,756 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 21:10:28,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:10:28,758 INFO L85 PathProgramCache]: Analyzing trace with hash 101420100, now seen corresponding path program 1 times [2022-11-18 21:10:28,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:10:28,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160892057] [2022-11-18 21:10:28,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:10:28,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:10:28,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:10:29,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 21:10:29,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:10:29,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160892057] [2022-11-18 21:10:29,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160892057] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:10:29,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:10:29,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 21:10:29,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759840466] [2022-11-18 21:10:29,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:10:29,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 21:10:29,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:10:29,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 21:10:29,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 21:10:29,433 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 141 [2022-11-18 21:10:29,439 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 133 transitions, 278 flow. Second operand has 6 states, 6 states have (on average 110.83333333333333) internal successors, (665), 6 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:10:29,439 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 21:10:29,439 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 141 [2022-11-18 21:10:29,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 21:10:33,219 INFO L130 PetriNetUnfolder]: 6975/15709 cut-off events. [2022-11-18 21:10:33,220 INFO L131 PetriNetUnfolder]: For 634/634 co-relation queries the response was YES. [2022-11-18 21:10:33,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26007 conditions, 15709 events. 6975/15709 cut-off events. For 634/634 co-relation queries the response was YES. Maximal size of possible extension queue 724. Compared 153145 event pairs, 3289 based on Foata normal form. 0/15425 useless extension candidates. Maximal degree in co-relation 25943. Up to 5944 conditions per place. [2022-11-18 21:10:33,351 INFO L137 encePairwiseOnDemand]: 132/141 looper letters, 32 selfloop transitions, 5 changer transitions 71/199 dead transitions. [2022-11-18 21:10:33,352 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 199 transitions, 620 flow [2022-11-18 21:10:33,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 21:10:33,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-18 21:10:33,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1069 transitions. [2022-11-18 21:10:33,356 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8423955870764381 [2022-11-18 21:10:33,356 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1069 transitions. [2022-11-18 21:10:33,356 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1069 transitions. [2022-11-18 21:10:33,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 21:10:33,357 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1069 transitions. [2022-11-18 21:10:33,360 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 118.77777777777777) internal successors, (1069), 9 states have internal predecessors, (1069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:10:33,365 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 141.0) internal successors, (1410), 10 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:10:33,366 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 141.0) internal successors, (1410), 10 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:10:33,366 INFO L175 Difference]: Start difference. First operand has 144 places, 133 transitions, 278 flow. Second operand 9 states and 1069 transitions. [2022-11-18 21:10:33,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 199 transitions, 620 flow [2022-11-18 21:10:33,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 199 transitions, 602 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-18 21:10:33,376 INFO L231 Difference]: Finished difference. Result has 157 places, 123 transitions, 315 flow [2022-11-18 21:10:33,376 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=315, PETRI_PLACES=157, PETRI_TRANSITIONS=123} [2022-11-18 21:10:33,377 INFO L288 CegarLoopForPetriNet]: 148 programPoint places, 9 predicate places. [2022-11-18 21:10:33,378 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 123 transitions, 315 flow [2022-11-18 21:10:33,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 110.83333333333333) internal successors, (665), 6 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:10:33,379 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 21:10:33,379 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:10:33,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 21:10:33,380 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 21:10:33,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:10:33,383 INFO L85 PathProgramCache]: Analyzing trace with hash -244441240, now seen corresponding path program 1 times [2022-11-18 21:10:33,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:10:33,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038901188] [2022-11-18 21:10:33,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:10:33,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:10:33,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:10:33,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 21:10:33,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:10:33,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038901188] [2022-11-18 21:10:33,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038901188] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:10:33,850 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:10:33,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 21:10:33,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784980052] [2022-11-18 21:10:33,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:10:33,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 21:10:33,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:10:33,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 21:10:33,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 21:10:33,854 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 141 [2022-11-18 21:10:33,856 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 123 transitions, 315 flow. Second operand has 6 states, 6 states have (on average 119.16666666666667) internal successors, (715), 6 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:10:33,856 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 21:10:33,856 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 141 [2022-11-18 21:10:33,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 21:10:35,561 INFO L130 PetriNetUnfolder]: 2984/5341 cut-off events. [2022-11-18 21:10:35,562 INFO L131 PetriNetUnfolder]: For 6302/6410 co-relation queries the response was YES. [2022-11-18 21:10:35,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14176 conditions, 5341 events. 2984/5341 cut-off events. For 6302/6410 co-relation queries the response was YES. Maximal size of possible extension queue 350. Compared 37801 event pairs, 862 based on Foata normal form. 136/5256 useless extension candidates. Maximal degree in co-relation 14110. Up to 1968 conditions per place. [2022-11-18 21:10:35,628 INFO L137 encePairwiseOnDemand]: 135/141 looper letters, 22 selfloop transitions, 3 changer transitions 40/168 dead transitions. [2022-11-18 21:10:35,628 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 168 transitions, 577 flow [2022-11-18 21:10:35,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 21:10:35,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-18 21:10:35,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1119 transitions. [2022-11-18 21:10:35,636 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8817966903073287 [2022-11-18 21:10:35,636 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1119 transitions. [2022-11-18 21:10:35,636 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1119 transitions. [2022-11-18 21:10:35,637 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 21:10:35,637 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1119 transitions. [2022-11-18 21:10:35,640 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 124.33333333333333) internal successors, (1119), 9 states have internal predecessors, (1119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:10:35,643 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 141.0) internal successors, (1410), 10 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:10:35,644 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 141.0) internal successors, (1410), 10 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:10:35,644 INFO L175 Difference]: Start difference. First operand has 157 places, 123 transitions, 315 flow. Second operand 9 states and 1119 transitions. [2022-11-18 21:10:35,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 168 transitions, 577 flow [2022-11-18 21:10:35,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 168 transitions, 558 flow, removed 7 selfloop flow, removed 4 redundant places. [2022-11-18 21:10:35,708 INFO L231 Difference]: Finished difference. Result has 148 places, 123 transitions, 327 flow [2022-11-18 21:10:35,708 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=327, PETRI_PLACES=148, PETRI_TRANSITIONS=123} [2022-11-18 21:10:35,710 INFO L288 CegarLoopForPetriNet]: 148 programPoint places, 0 predicate places. [2022-11-18 21:10:35,711 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 123 transitions, 327 flow [2022-11-18 21:10:35,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 119.16666666666667) internal successors, (715), 6 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:10:35,712 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 21:10:35,712 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:10:35,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-18 21:10:35,712 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 21:10:35,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:10:35,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1814984533, now seen corresponding path program 1 times [2022-11-18 21:10:35,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:10:35,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820064279] [2022-11-18 21:10:35,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:10:35,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:10:35,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:10:36,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 21:10:36,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:10:36,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820064279] [2022-11-18 21:10:36,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820064279] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:10:36,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:10:36,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 21:10:36,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725489309] [2022-11-18 21:10:36,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:10:36,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 21:10:36,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:10:36,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 21:10:36,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-18 21:10:36,061 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 141 [2022-11-18 21:10:36,062 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 123 transitions, 327 flow. Second operand has 7 states, 7 states have (on average 110.57142857142857) internal successors, (774), 7 states have internal predecessors, (774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:10:36,062 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 21:10:36,063 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 141 [2022-11-18 21:10:36,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 21:10:38,172 INFO L130 PetriNetUnfolder]: 4062/6727 cut-off events. [2022-11-18 21:10:38,173 INFO L131 PetriNetUnfolder]: For 12800/12800 co-relation queries the response was YES. [2022-11-18 21:10:38,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19789 conditions, 6727 events. 4062/6727 cut-off events. For 12800/12800 co-relation queries the response was YES. Maximal size of possible extension queue 356. Compared 43196 event pairs, 1180 based on Foata normal form. 144/6643 useless extension candidates. Maximal degree in co-relation 19713. Up to 3209 conditions per place. [2022-11-18 21:10:38,242 INFO L137 encePairwiseOnDemand]: 135/141 looper letters, 39 selfloop transitions, 3 changer transitions 58/191 dead transitions. [2022-11-18 21:10:38,242 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 191 transitions, 840 flow [2022-11-18 21:10:38,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 21:10:38,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-18 21:10:38,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1070 transitions. [2022-11-18 21:10:38,246 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.843183609141056 [2022-11-18 21:10:38,247 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1070 transitions. [2022-11-18 21:10:38,248 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1070 transitions. [2022-11-18 21:10:38,252 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 21:10:38,252 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1070 transitions. [2022-11-18 21:10:38,255 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 118.88888888888889) internal successors, (1070), 9 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:10:38,258 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 141.0) internal successors, (1410), 10 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:10:38,261 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 141.0) internal successors, (1410), 10 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:10:38,262 INFO L175 Difference]: Start difference. First operand has 148 places, 123 transitions, 327 flow. Second operand 9 states and 1070 transitions. [2022-11-18 21:10:38,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 191 transitions, 840 flow [2022-11-18 21:10:38,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 191 transitions, 804 flow, removed 14 selfloop flow, removed 8 redundant places. [2022-11-18 21:10:38,322 INFO L231 Difference]: Finished difference. Result has 149 places, 123 transitions, 332 flow [2022-11-18 21:10:38,326 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=332, PETRI_PLACES=149, PETRI_TRANSITIONS=123} [2022-11-18 21:10:38,328 INFO L288 CegarLoopForPetriNet]: 148 programPoint places, 1 predicate places. [2022-11-18 21:10:38,328 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 123 transitions, 332 flow [2022-11-18 21:10:38,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 110.57142857142857) internal successors, (774), 7 states have internal predecessors, (774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:10:38,329 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 21:10:38,329 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:10:38,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-18 21:10:38,330 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 21:10:38,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:10:38,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1915365088, now seen corresponding path program 1 times [2022-11-18 21:10:38,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:10:38,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743308282] [2022-11-18 21:10:38,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:10:38,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:10:38,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:10:38,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 21:10:38,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:10:38,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743308282] [2022-11-18 21:10:38,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743308282] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:10:38,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:10:38,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 21:10:38,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726740590] [2022-11-18 21:10:38,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:10:38,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 21:10:38,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:10:38,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 21:10:38,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 21:10:38,623 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 141 [2022-11-18 21:10:38,624 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 123 transitions, 332 flow. Second operand has 6 states, 6 states have (on average 116.0) internal successors, (696), 6 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:10:38,624 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 21:10:38,624 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 141 [2022-11-18 21:10:38,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 21:10:41,686 INFO L130 PetriNetUnfolder]: 7696/13912 cut-off events. [2022-11-18 21:10:41,687 INFO L131 PetriNetUnfolder]: For 4162/4335 co-relation queries the response was YES. [2022-11-18 21:10:41,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28488 conditions, 13912 events. 7696/13912 cut-off events. For 4162/4335 co-relation queries the response was YES. Maximal size of possible extension queue 848. Compared 115207 event pairs, 549 based on Foata normal form. 0/13337 useless extension candidates. Maximal degree in co-relation 28416. Up to 3955 conditions per place. [2022-11-18 21:10:41,858 INFO L137 encePairwiseOnDemand]: 130/141 looper letters, 79 selfloop transitions, 18 changer transitions 8/205 dead transitions. [2022-11-18 21:10:41,859 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 205 transitions, 712 flow [2022-11-18 21:10:41,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 21:10:41,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-18 21:10:41,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1247 transitions. [2022-11-18 21:10:41,864 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8843971631205674 [2022-11-18 21:10:41,864 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1247 transitions. [2022-11-18 21:10:41,864 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1247 transitions. [2022-11-18 21:10:41,865 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 21:10:41,865 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1247 transitions. [2022-11-18 21:10:41,868 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 124.7) internal successors, (1247), 10 states have internal predecessors, (1247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:10:41,871 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 141.0) internal successors, (1551), 11 states have internal predecessors, (1551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:10:41,872 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 141.0) internal successors, (1551), 11 states have internal predecessors, (1551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:10:41,873 INFO L175 Difference]: Start difference. First operand has 149 places, 123 transitions, 332 flow. Second operand 10 states and 1247 transitions. [2022-11-18 21:10:41,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 205 transitions, 712 flow [2022-11-18 21:10:41,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 205 transitions, 694 flow, removed 6 selfloop flow, removed 8 redundant places. [2022-11-18 21:10:41,898 INFO L231 Difference]: Finished difference. Result has 150 places, 139 transitions, 446 flow [2022-11-18 21:10:41,899 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=446, PETRI_PLACES=150, PETRI_TRANSITIONS=139} [2022-11-18 21:10:41,902 INFO L288 CegarLoopForPetriNet]: 148 programPoint places, 2 predicate places. [2022-11-18 21:10:41,902 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 139 transitions, 446 flow [2022-11-18 21:10:41,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 116.0) internal successors, (696), 6 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:10:41,903 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 21:10:41,903 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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] [2022-11-18 21:10:41,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-18 21:10:41,904 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 21:10:41,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:10:41,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1110608078, now seen corresponding path program 1 times [2022-11-18 21:10:41,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:10:41,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185064645] [2022-11-18 21:10:41,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:10:41,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:10:41,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:10:42,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 21:10:42,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:10:42,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185064645] [2022-11-18 21:10:42,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185064645] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:10:42,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:10:42,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 21:10:42,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600512474] [2022-11-18 21:10:42,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:10:42,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 21:10:42,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:10:42,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 21:10:42,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-18 21:10:42,226 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 141 [2022-11-18 21:10:42,227 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 139 transitions, 446 flow. Second operand has 7 states, 7 states have (on average 116.0) internal successors, (812), 7 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:10:42,227 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 21:10:42,227 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 141 [2022-11-18 21:10:42,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 21:10:45,025 INFO L130 PetriNetUnfolder]: 7382/13607 cut-off events. [2022-11-18 21:10:45,026 INFO L131 PetriNetUnfolder]: For 15033/15184 co-relation queries the response was YES. [2022-11-18 21:10:45,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37372 conditions, 13607 events. 7382/13607 cut-off events. For 15033/15184 co-relation queries the response was YES. Maximal size of possible extension queue 889. Compared 116252 event pairs, 481 based on Foata normal form. 236/13496 useless extension candidates. Maximal degree in co-relation 37299. Up to 2698 conditions per place. [2022-11-18 21:10:45,154 INFO L137 encePairwiseOnDemand]: 130/141 looper letters, 110 selfloop transitions, 36 changer transitions 0/246 dead transitions. [2022-11-18 21:10:45,154 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 246 transitions, 1158 flow [2022-11-18 21:10:45,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-18 21:10:45,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-18 21:10:45,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1624 transitions. [2022-11-18 21:10:45,159 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8859792689579924 [2022-11-18 21:10:45,160 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1624 transitions. [2022-11-18 21:10:45,160 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1624 transitions. [2022-11-18 21:10:45,161 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 21:10:45,161 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1624 transitions. [2022-11-18 21:10:45,165 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 124.92307692307692) internal successors, (1624), 13 states have internal predecessors, (1624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:10:45,169 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 141.0) internal successors, (1974), 14 states have internal predecessors, (1974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:10:45,172 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 141.0) internal successors, (1974), 14 states have internal predecessors, (1974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:10:45,172 INFO L175 Difference]: Start difference. First operand has 150 places, 139 transitions, 446 flow. Second operand 13 states and 1624 transitions. [2022-11-18 21:10:45,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 246 transitions, 1158 flow [2022-11-18 21:10:45,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 246 transitions, 1156 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-18 21:10:45,271 INFO L231 Difference]: Finished difference. Result has 167 places, 159 transitions, 731 flow [2022-11-18 21:10:45,272 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=444, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=731, PETRI_PLACES=167, PETRI_TRANSITIONS=159} [2022-11-18 21:10:45,275 INFO L288 CegarLoopForPetriNet]: 148 programPoint places, 19 predicate places. [2022-11-18 21:10:45,275 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 159 transitions, 731 flow [2022-11-18 21:10:45,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 116.0) internal successors, (812), 7 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:10:45,276 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 21:10:45,276 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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] [2022-11-18 21:10:45,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-18 21:10:45,277 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 21:10:45,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:10:45,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1762118274, now seen corresponding path program 1 times [2022-11-18 21:10:45,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:10:45,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828903649] [2022-11-18 21:10:45,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:10:45,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:10:45,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:10:45,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 21:10:45,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:10:45,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828903649] [2022-11-18 21:10:45,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828903649] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:10:45,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:10:45,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 21:10:45,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248327758] [2022-11-18 21:10:45,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:10:45,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 21:10:45,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:10:45,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 21:10:45,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 21:10:45,658 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 141 [2022-11-18 21:10:45,659 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 159 transitions, 731 flow. Second operand has 7 states, 7 states have (on average 116.71428571428571) internal successors, (817), 7 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:10:45,659 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 21:10:45,659 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 141 [2022-11-18 21:10:45,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 21:10:47,228 INFO L130 PetriNetUnfolder]: 2911/9275 cut-off events. [2022-11-18 21:10:47,228 INFO L131 PetriNetUnfolder]: For 25401/35460 co-relation queries the response was YES. [2022-11-18 21:10:47,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29532 conditions, 9275 events. 2911/9275 cut-off events. For 25401/35460 co-relation queries the response was YES. Maximal size of possible extension queue 978. Compared 109298 event pairs, 325 based on Foata normal form. 209/8877 useless extension candidates. Maximal degree in co-relation 29450. Up to 2012 conditions per place. [2022-11-18 21:10:47,345 INFO L137 encePairwiseOnDemand]: 135/141 looper letters, 58 selfloop transitions, 5 changer transitions 0/199 dead transitions. [2022-11-18 21:10:47,346 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 199 transitions, 962 flow [2022-11-18 21:10:47,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 21:10:47,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-18 21:10:47,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 861 transitions. [2022-11-18 21:10:47,349 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8723404255319149 [2022-11-18 21:10:47,349 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 861 transitions. [2022-11-18 21:10:47,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 861 transitions. [2022-11-18 21:10:47,350 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 21:10:47,350 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 861 transitions. [2022-11-18 21:10:47,352 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 123.0) internal successors, (861), 7 states have internal predecessors, (861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:10:47,354 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 141.0) internal successors, (1128), 8 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:10:47,355 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 141.0) internal successors, (1128), 8 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:10:47,355 INFO L175 Difference]: Start difference. First operand has 167 places, 159 transitions, 731 flow. Second operand 7 states and 861 transitions. [2022-11-18 21:10:47,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 199 transitions, 962 flow [2022-11-18 21:10:48,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 199 transitions, 869 flow, removed 38 selfloop flow, removed 4 redundant places. [2022-11-18 21:10:48,133 INFO L231 Difference]: Finished difference. Result has 174 places, 163 transitions, 685 flow [2022-11-18 21:10:48,134 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=638, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=685, PETRI_PLACES=174, PETRI_TRANSITIONS=163} [2022-11-18 21:10:48,134 INFO L288 CegarLoopForPetriNet]: 148 programPoint places, 26 predicate places. [2022-11-18 21:10:48,134 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 163 transitions, 685 flow [2022-11-18 21:10:48,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 116.71428571428571) internal successors, (817), 7 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:10:48,135 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 21:10:48,135 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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] [2022-11-18 21:10:48,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-18 21:10:48,136 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 21:10:48,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:10:48,136 INFO L85 PathProgramCache]: Analyzing trace with hash 2122349288, now seen corresponding path program 2 times [2022-11-18 21:10:48,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:10:48,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144485608] [2022-11-18 21:10:48,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:10:48,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:10:48,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:10:48,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 21:10:48,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:10:48,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144485608] [2022-11-18 21:10:48,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144485608] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:10:48,484 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:10:48,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-18 21:10:48,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021642862] [2022-11-18 21:10:48,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:10:48,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 21:10:48,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:10:48,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 21:10:48,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-18 21:10:48,487 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 141 [2022-11-18 21:10:48,488 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 163 transitions, 685 flow. Second operand has 8 states, 8 states have (on average 116.125) internal successors, (929), 8 states have internal predecessors, (929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:10:48,488 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 21:10:48,488 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 141 [2022-11-18 21:10:48,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 21:10:52,937 INFO L130 PetriNetUnfolder]: 12753/23258 cut-off events. [2022-11-18 21:10:52,938 INFO L131 PetriNetUnfolder]: For 44072/44348 co-relation queries the response was YES. [2022-11-18 21:10:53,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70678 conditions, 23258 events. 12753/23258 cut-off events. For 44072/44348 co-relation queries the response was YES. Maximal size of possible extension queue 1572. Compared 216601 event pairs, 738 based on Foata normal form. 258/22873 useless extension candidates. Maximal degree in co-relation 70593. Up to 2882 conditions per place. [2022-11-18 21:10:53,156 INFO L137 encePairwiseOnDemand]: 130/141 looper letters, 108 selfloop transitions, 56 changer transitions 27/295 dead transitions. [2022-11-18 21:10:53,156 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 295 transitions, 1745 flow [2022-11-18 21:10:53,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-18 21:10:53,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-11-18 21:10:53,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2002 transitions. [2022-11-18 21:10:53,314 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8874113475177305 [2022-11-18 21:10:53,314 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 2002 transitions. [2022-11-18 21:10:53,314 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 2002 transitions. [2022-11-18 21:10:53,316 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 21:10:53,316 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 2002 transitions. [2022-11-18 21:10:53,333 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 125.125) internal successors, (2002), 16 states have internal predecessors, (2002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:10:53,338 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 141.0) internal successors, (2397), 17 states have internal predecessors, (2397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:10:53,340 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 141.0) internal successors, (2397), 17 states have internal predecessors, (2397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:10:53,340 INFO L175 Difference]: Start difference. First operand has 174 places, 163 transitions, 685 flow. Second operand 16 states and 2002 transitions. [2022-11-18 21:10:53,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 295 transitions, 1745 flow [2022-11-18 21:10:54,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 295 transitions, 1742 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-11-18 21:10:54,627 INFO L231 Difference]: Finished difference. Result has 192 places, 189 transitions, 1139 flow [2022-11-18 21:10:54,628 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=682, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1139, PETRI_PLACES=192, PETRI_TRANSITIONS=189} [2022-11-18 21:10:54,629 INFO L288 CegarLoopForPetriNet]: 148 programPoint places, 44 predicate places. [2022-11-18 21:10:54,630 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 189 transitions, 1139 flow [2022-11-18 21:10:54,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 116.125) internal successors, (929), 8 states have internal predecessors, (929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:10:54,631 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 21:10:54,631 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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] [2022-11-18 21:10:54,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-18 21:10:54,631 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 21:10:54,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:10:54,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1731427727, now seen corresponding path program 1 times [2022-11-18 21:10:54,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:10:54,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067530161] [2022-11-18 21:10:54,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:10:54,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:10:54,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:10:56,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 21:10:56,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:10:56,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067530161] [2022-11-18 21:10:56,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067530161] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:10:56,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:10:56,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-18 21:10:56,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229044047] [2022-11-18 21:10:56,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:10:56,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-18 21:10:56,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:10:56,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-18 21:10:56,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-18 21:10:56,055 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 141 [2022-11-18 21:10:56,056 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 189 transitions, 1139 flow. Second operand has 9 states, 9 states have (on average 114.55555555555556) internal successors, (1031), 9 states have internal predecessors, (1031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:10:56,057 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 21:10:56,057 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 141 [2022-11-18 21:10:56,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 21:10:58,496 INFO L130 PetriNetUnfolder]: 4492/14512 cut-off events. [2022-11-18 21:10:58,496 INFO L131 PetriNetUnfolder]: For 74262/79297 co-relation queries the response was YES. [2022-11-18 21:10:58,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55377 conditions, 14512 events. 4492/14512 cut-off events. For 74262/79297 co-relation queries the response was YES. Maximal size of possible extension queue 1715. Compared 192267 event pairs, 127 based on Foata normal form. 11/13619 useless extension candidates. Maximal degree in co-relation 55280. Up to 3536 conditions per place. [2022-11-18 21:10:58,699 INFO L137 encePairwiseOnDemand]: 130/141 looper letters, 46 selfloop transitions, 13 changer transitions 25/246 dead transitions. [2022-11-18 21:10:58,699 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 246 transitions, 1549 flow [2022-11-18 21:10:58,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 21:10:58,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-18 21:10:58,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1193 transitions. [2022-11-18 21:10:58,709 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8460992907801419 [2022-11-18 21:10:58,709 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1193 transitions. [2022-11-18 21:10:58,709 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1193 transitions. [2022-11-18 21:10:58,710 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 21:10:58,710 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1193 transitions. [2022-11-18 21:10:58,718 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 119.3) internal successors, (1193), 10 states have internal predecessors, (1193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:10:58,723 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 141.0) internal successors, (1551), 11 states have internal predecessors, (1551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:10:58,724 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 141.0) internal successors, (1551), 11 states have internal predecessors, (1551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:10:58,725 INFO L175 Difference]: Start difference. First operand has 192 places, 189 transitions, 1139 flow. Second operand 10 states and 1193 transitions. [2022-11-18 21:10:58,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 246 transitions, 1549 flow [2022-11-18 21:11:02,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 246 transitions, 1242 flow, removed 114 selfloop flow, removed 11 redundant places. [2022-11-18 21:11:02,817 INFO L231 Difference]: Finished difference. Result has 196 places, 200 transitions, 897 flow [2022-11-18 21:11:02,818 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=832, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=897, PETRI_PLACES=196, PETRI_TRANSITIONS=200} [2022-11-18 21:11:02,818 INFO L288 CegarLoopForPetriNet]: 148 programPoint places, 48 predicate places. [2022-11-18 21:11:02,818 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 200 transitions, 897 flow [2022-11-18 21:11:02,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 114.55555555555556) internal successors, (1031), 9 states have internal predecessors, (1031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:11:02,819 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 21:11:02,819 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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] [2022-11-18 21:11:02,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-18 21:11:02,820 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 21:11:02,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:11:02,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1135819181, now seen corresponding path program 2 times [2022-11-18 21:11:02,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:11:02,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838193005] [2022-11-18 21:11:02,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:11:02,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:11:02,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:11:04,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 21:11:04,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:11:04,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838193005] [2022-11-18 21:11:04,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838193005] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:11:04,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:11:04,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-18 21:11:04,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136707944] [2022-11-18 21:11:04,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:11:04,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-18 21:11:04,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:11:04,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-18 21:11:04,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-11-18 21:11:04,158 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 141 [2022-11-18 21:11:04,159 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 200 transitions, 897 flow. Second operand has 12 states, 12 states have (on average 101.91666666666667) internal successors, (1223), 12 states have internal predecessors, (1223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:11:04,159 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 21:11:04,159 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 141 [2022-11-18 21:11:04,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 21:11:09,806 INFO L130 PetriNetUnfolder]: 10677/33775 cut-off events. [2022-11-18 21:11:09,806 INFO L131 PetriNetUnfolder]: For 50659/51343 co-relation queries the response was YES. [2022-11-18 21:11:10,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90126 conditions, 33775 events. 10677/33775 cut-off events. For 50659/51343 co-relation queries the response was YES. Maximal size of possible extension queue 3671. Compared 504026 event pairs, 187 based on Foata normal form. 27/31939 useless extension candidates. Maximal degree in co-relation 90019. Up to 3285 conditions per place. [2022-11-18 21:11:10,325 INFO L137 encePairwiseOnDemand]: 121/141 looper letters, 95 selfloop transitions, 33 changer transitions 35/307 dead transitions. [2022-11-18 21:11:10,326 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 307 transitions, 1843 flow [2022-11-18 21:11:10,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-18 21:11:10,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-11-18 21:11:10,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1820 transitions. [2022-11-18 21:11:10,334 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7592824363788069 [2022-11-18 21:11:10,334 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1820 transitions. [2022-11-18 21:11:10,335 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1820 transitions. [2022-11-18 21:11:10,338 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 21:11:10,338 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1820 transitions. [2022-11-18 21:11:10,344 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 107.05882352941177) internal successors, (1820), 17 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:11:10,351 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 141.0) internal successors, (2538), 18 states have internal predecessors, (2538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:11:10,353 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 141.0) internal successors, (2538), 18 states have internal predecessors, (2538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:11:10,354 INFO L175 Difference]: Start difference. First operand has 196 places, 200 transitions, 897 flow. Second operand 17 states and 1820 transitions. [2022-11-18 21:11:10,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 307 transitions, 1843 flow [2022-11-18 21:11:20,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 307 transitions, 1778 flow, removed 32 selfloop flow, removed 7 redundant places. [2022-11-18 21:11:20,489 INFO L231 Difference]: Finished difference. Result has 209 places, 218 transitions, 1145 flow [2022-11-18 21:11:20,489 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=884, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1145, PETRI_PLACES=209, PETRI_TRANSITIONS=218} [2022-11-18 21:11:20,490 INFO L288 CegarLoopForPetriNet]: 148 programPoint places, 61 predicate places. [2022-11-18 21:11:20,490 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 218 transitions, 1145 flow [2022-11-18 21:11:20,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 101.91666666666667) internal successors, (1223), 12 states have internal predecessors, (1223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:11:20,491 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 21:11:20,492 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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] [2022-11-18 21:11:20,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-18 21:11:20,492 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 21:11:20,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:11:20,492 INFO L85 PathProgramCache]: Analyzing trace with hash -2063728775, now seen corresponding path program 3 times [2022-11-18 21:11:20,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:11:20,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963541859] [2022-11-18 21:11:20,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:11:20,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:11:20,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:11:21,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 21:11:21,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:11:21,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963541859] [2022-11-18 21:11:21,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963541859] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:11:21,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:11:21,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-18 21:11:21,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748209994] [2022-11-18 21:11:21,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:11:21,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-18 21:11:21,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:11:21,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-18 21:11:21,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-11-18 21:11:21,541 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 141 [2022-11-18 21:11:21,543 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 218 transitions, 1145 flow. Second operand has 11 states, 11 states have (on average 113.18181818181819) internal successors, (1245), 11 states have internal predecessors, (1245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:11:21,543 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 21:11:21,543 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 141 [2022-11-18 21:11:21,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 21:11:27,189 INFO L130 PetriNetUnfolder]: 11258/34713 cut-off events. [2022-11-18 21:11:27,189 INFO L131 PetriNetUnfolder]: For 54196/56987 co-relation queries the response was YES. [2022-11-18 21:11:27,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93999 conditions, 34713 events. 11258/34713 cut-off events. For 54196/56987 co-relation queries the response was YES. Maximal size of possible extension queue 4234. Compared 521454 event pairs, 139 based on Foata normal form. 232/32733 useless extension candidates. Maximal degree in co-relation 93890. Up to 3692 conditions per place. [2022-11-18 21:11:27,614 INFO L137 encePairwiseOnDemand]: 129/141 looper letters, 52 selfloop transitions, 26 changer transitions 13/259 dead transitions. [2022-11-18 21:11:27,614 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 259 transitions, 1599 flow [2022-11-18 21:11:27,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-18 21:11:27,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-18 21:11:27,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1291 transitions. [2022-11-18 21:11:27,617 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8323662153449387 [2022-11-18 21:11:27,618 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1291 transitions. [2022-11-18 21:11:27,618 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1291 transitions. [2022-11-18 21:11:27,619 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 21:11:27,619 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1291 transitions. [2022-11-18 21:11:27,622 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 117.36363636363636) internal successors, (1291), 11 states have internal predecessors, (1291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:11:27,626 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 141.0) internal successors, (1692), 12 states have internal predecessors, (1692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:11:27,627 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 141.0) internal successors, (1692), 12 states have internal predecessors, (1692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:11:27,627 INFO L175 Difference]: Start difference. First operand has 209 places, 218 transitions, 1145 flow. Second operand 11 states and 1291 transitions. [2022-11-18 21:11:27,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 259 transitions, 1599 flow [2022-11-18 21:11:38,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 259 transitions, 1490 flow, removed 41 selfloop flow, removed 11 redundant places. [2022-11-18 21:11:38,238 INFO L231 Difference]: Finished difference. Result has 208 places, 225 transitions, 1221 flow [2022-11-18 21:11:38,239 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=1074, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1221, PETRI_PLACES=208, PETRI_TRANSITIONS=225} [2022-11-18 21:11:38,240 INFO L288 CegarLoopForPetriNet]: 148 programPoint places, 60 predicate places. [2022-11-18 21:11:38,240 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 225 transitions, 1221 flow [2022-11-18 21:11:38,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 113.18181818181819) internal successors, (1245), 11 states have internal predecessors, (1245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:11:38,241 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 21:11:38,242 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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] [2022-11-18 21:11:38,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-18 21:11:38,242 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 21:11:38,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:11:38,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1935502999, now seen corresponding path program 4 times [2022-11-18 21:11:38,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:11:38,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830014253] [2022-11-18 21:11:38,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:11:38,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:11:38,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:11:38,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 21:11:38,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:11:38,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830014253] [2022-11-18 21:11:38,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830014253] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:11:38,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:11:38,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-18 21:11:38,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854778788] [2022-11-18 21:11:38,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:11:38,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-18 21:11:38,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:11:38,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-18 21:11:38,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-11-18 21:11:38,620 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 141 [2022-11-18 21:11:38,622 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 225 transitions, 1221 flow. Second operand has 9 states, 9 states have (on average 116.22222222222223) internal successors, (1046), 9 states have internal predecessors, (1046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 21:11:38,622 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 21:11:38,622 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 141 [2022-11-18 21:11:38,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 21:11:42,348 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([427] L833-->L849: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_48 256) 0)) (.cse6 (= (mod v_~a$r_buff0_thd4~0_48 256) 0))) (let ((.cse7 (not .cse6)) (.cse3 (and .cse9 .cse6)) (.cse4 (and (= (mod v_~a$w_buff1_used~0_127 256) 0) .cse6)) (.cse12 (= (mod v_~a$w_buff0_used~0_138 256) 0))) (let ((.cse10 (or .cse3 .cse4 .cse12)) (.cse11 (and .cse7 (not .cse12)))) (let ((.cse1 (ite .cse10 v_~a~0_100 (ite .cse11 v_~a$w_buff0~0_59 v_~a$w_buff1~0_52))) (.cse5 (= (mod v_~a$w_buff1_used~0_126 256) 0)) (.cse2 (= (mod v_~a$w_buff0_used~0_137 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_26 256) 0)))) (and (= (ite .cse0 v_~a$mem_tmp~0_20 .cse1) v_~a~0_98) (= (ite .cse0 v_~a$w_buff1_used~0_127 (ite (or .cse2 .cse3 .cse4) v_~a$w_buff1_used~0_127 0)) v_~a$w_buff1_used~0_126) (= v_~a$r_buff0_thd4~0_47 (ite .cse0 v_~a$r_buff0_thd4~0_48 (ite (or .cse2 .cse3 (and .cse5 .cse6)) v_~a$r_buff0_thd4~0_48 (ite (and .cse7 (not .cse2)) 0 v_~a$r_buff0_thd4~0_48)))) (= v_~__unbuffered_p3_EBX~0_12 .cse1) (= |v_P3Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_7) (= v_~a$w_buff1~0_52 v_~a$w_buff1~0_51) (= v_~a$w_buff0~0_59 v_~a$w_buff0~0_58) (= (ite .cse0 v_~a$r_buff1_thd4~0_48 (ite (let ((.cse8 (= (mod v_~a$r_buff0_thd4~0_47 256) 0))) (or (and .cse5 .cse8) .cse2 (and .cse9 .cse8))) v_~a$r_buff1_thd4~0_48 0)) v_~a$r_buff1_thd4~0_47) (= v_~a$flush_delayed~0_33 0) (= v_~a~0_100 v_~a$mem_tmp~0_20) (= (ite .cse0 v_~a$w_buff0_used~0_138 (ite .cse10 v_~a$w_buff0_used~0_138 (ite .cse11 0 v_~a$w_buff0_used~0_138))) v_~a$w_buff0_used~0_137) (= v_~weak$$choice2~0_26 |v_P3Thread1of1ForFork2_#t~nondet4_1|)))))) InVars {P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_100, ~a$w_buff1~0=v_~a$w_buff1~0_52, ~a$w_buff0~0=v_~a$w_buff0~0_59, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_48, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_138, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_127, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_48, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_47, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_137, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_12, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_47, ~a~0=v_~a~0_98, ~a$mem_tmp~0=v_~a$mem_tmp~0_20, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_51, ~a$flush_delayed~0=v_~a$flush_delayed~0_33, ~a$w_buff0~0=v_~a$w_buff0~0_58, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_126, ~weak$$choice2~0=v_~weak$$choice2~0_26} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][187], [18#L849true, 456#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 185#(= ~__unbuffered_p3_EAX~0 0), 118#L813true, Black: 335#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 331#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 311#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), P2Thread1of1ForFork0InUse, Black: 306#true, Black: 372#(and (not (= ~a$w_buff1~0 ~a$w_buff0~0)) (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0_used~0 1) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1)), P3Thread1of1ForFork2InUse, Black: 373#(and (not (= ~a$w_buff1~0 ~a$w_buff0~0)) (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (= ~a$r_buff1_thd4~0 0) (< 0 (+ (div ~a$w_buff0_used~0 256) 1)) (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff1~0 0) (not (= ~a~0 ~a$w_buff1~0))), P0Thread1of1ForFork1InUse, P1Thread1of1ForFork3InUse, Black: 277#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 375#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), 351#(and (= ~a$r_buff1_thd4~0 0) (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1) (= ~a~0 ~a$w_buff0~0) (= ~a$r_buff0_thd4~0 0)), Black: 255#true, Black: 259#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 273#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 424#(and (= ~a$r_buff1_thd4~0 0) (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), 29#L790true, Black: 209#(= ~__unbuffered_p2_EAX~0 0), 77#L777true, 80#L884-1true, Black: 344#(and (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff0~0 1) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 345#(and (= ~a$r_buff1_thd4~0 0) (= ~a~0 1) (= ~a~0 ~a$w_buff0~0) (= ~a$r_buff0_thd4~0 0)), 267#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 161#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 287#(= ~z~0 1), Black: 172#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 428#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 414#(and (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff0~0 1) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 166#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)))), Black: 432#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 168#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 430#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 426#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 422#(and (= ~a$r_buff1_thd4~0 0) (= ~a~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 235#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 247#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 243#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 293#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 1)), Black: 232#true, 388#(and (not (= ~a$w_buff1~0 ~a$w_buff0~0)) (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (= ~a$r_buff1_thd4~0 0) (< 0 (+ (div ~a$w_buff0_used~0 256) 1)) (= ~a$r_buff1_thd3~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~a$w_buff1~0 0) (not (= ~a~0 ~a$w_buff1~0)))]) [2022-11-18 21:11:42,349 INFO L383 tUnfolder$Statistics]: this new event has 91 ancestors and is cut-off event [2022-11-18 21:11:42,349 INFO L386 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-11-18 21:11:42,349 INFO L386 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-11-18 21:11:42,350 INFO L386 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-11-18 21:11:43,864 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([427] L833-->L849: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_48 256) 0)) (.cse6 (= (mod v_~a$r_buff0_thd4~0_48 256) 0))) (let ((.cse7 (not .cse6)) (.cse3 (and .cse9 .cse6)) (.cse4 (and (= (mod v_~a$w_buff1_used~0_127 256) 0) .cse6)) (.cse12 (= (mod v_~a$w_buff0_used~0_138 256) 0))) (let ((.cse10 (or .cse3 .cse4 .cse12)) (.cse11 (and .cse7 (not .cse12)))) (let ((.cse1 (ite .cse10 v_~a~0_100 (ite .cse11 v_~a$w_buff0~0_59 v_~a$w_buff1~0_52))) (.cse5 (= (mod v_~a$w_buff1_used~0_126 256) 0)) (.cse2 (= (mod v_~a$w_buff0_used~0_137 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_26 256) 0)))) (and (= (ite .cse0 v_~a$mem_tmp~0_20 .cse1) v_~a~0_98) (= (ite .cse0 v_~a$w_buff1_used~0_127 (ite (or .cse2 .cse3 .cse4) v_~a$w_buff1_used~0_127 0)) v_~a$w_buff1_used~0_126) (= v_~a$r_buff0_thd4~0_47 (ite .cse0 v_~a$r_buff0_thd4~0_48 (ite (or .cse2 .cse3 (and .cse5 .cse6)) v_~a$r_buff0_thd4~0_48 (ite (and .cse7 (not .cse2)) 0 v_~a$r_buff0_thd4~0_48)))) (= v_~__unbuffered_p3_EBX~0_12 .cse1) (= |v_P3Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_7) (= v_~a$w_buff1~0_52 v_~a$w_buff1~0_51) (= v_~a$w_buff0~0_59 v_~a$w_buff0~0_58) (= (ite .cse0 v_~a$r_buff1_thd4~0_48 (ite (let ((.cse8 (= (mod v_~a$r_buff0_thd4~0_47 256) 0))) (or (and .cse5 .cse8) .cse2 (and .cse9 .cse8))) v_~a$r_buff1_thd4~0_48 0)) v_~a$r_buff1_thd4~0_47) (= v_~a$flush_delayed~0_33 0) (= v_~a~0_100 v_~a$mem_tmp~0_20) (= (ite .cse0 v_~a$w_buff0_used~0_138 (ite .cse10 v_~a$w_buff0_used~0_138 (ite .cse11 0 v_~a$w_buff0_used~0_138))) v_~a$w_buff0_used~0_137) (= v_~weak$$choice2~0_26 |v_P3Thread1of1ForFork2_#t~nondet4_1|)))))) InVars {P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_100, ~a$w_buff1~0=v_~a$w_buff1~0_52, ~a$w_buff0~0=v_~a$w_buff0~0_59, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_48, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_138, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_127, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_48, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_47, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_137, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_12, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_47, ~a~0=v_~a~0_98, ~a$mem_tmp~0=v_~a$mem_tmp~0_20, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_51, ~a$flush_delayed~0=v_~a$flush_delayed~0_33, ~a$w_buff0~0=v_~a$w_buff0~0_58, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_126, ~weak$$choice2~0=v_~weak$$choice2~0_26} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][187], [18#L849true, 456#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 185#(= ~__unbuffered_p3_EAX~0 0), 118#L813true, 81#L2true, Black: 335#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 331#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 311#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), P2Thread1of1ForFork0InUse, Black: 372#(and (not (= ~a$w_buff1~0 ~a$w_buff0~0)) (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0_used~0 1) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1)), Black: 306#true, P3Thread1of1ForFork2InUse, Black: 373#(and (not (= ~a$w_buff1~0 ~a$w_buff0~0)) (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (= ~a$r_buff1_thd4~0 0) (< 0 (+ (div ~a$w_buff0_used~0 256) 1)) (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff1~0 0) (not (= ~a~0 ~a$w_buff1~0))), P0Thread1of1ForFork1InUse, P1Thread1of1ForFork3InUse, Black: 277#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 351#(and (= ~a$r_buff1_thd4~0 0) (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1) (= ~a~0 ~a$w_buff0~0) (= ~a$r_buff0_thd4~0 0)), Black: 375#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 255#true, Black: 259#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 273#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 424#(and (= ~a$r_buff1_thd4~0 0) (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), 29#L790true, Black: 209#(= ~__unbuffered_p2_EAX~0 0), 77#L777true, Black: 344#(and (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff0~0 1) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 345#(and (= ~a$r_buff1_thd4~0 0) (= ~a~0 1) (= ~a~0 ~a$w_buff0~0) (= ~a$r_buff0_thd4~0 0)), 267#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 161#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 287#(= ~z~0 1), Black: 428#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 172#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 414#(and (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff0~0 1) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 432#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 166#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)))), Black: 430#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 168#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 426#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 422#(and (= ~a$r_buff1_thd4~0 0) (= ~a~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 235#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 247#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 243#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 232#true, 293#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 1)), 388#(and (not (= ~a$w_buff1~0 ~a$w_buff0~0)) (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (= ~a$r_buff1_thd4~0 0) (< 0 (+ (div ~a$w_buff0_used~0 256) 1)) (= ~a$r_buff1_thd3~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~a$w_buff1~0 0) (not (= ~a~0 ~a$w_buff1~0)))]) [2022-11-18 21:11:43,864 INFO L383 tUnfolder$Statistics]: this new event has 92 ancestors and is cut-off event [2022-11-18 21:11:43,864 INFO L386 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2022-11-18 21:11:43,865 INFO L386 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2022-11-18 21:11:43,865 INFO L386 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2022-11-18 21:11:45,548 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([427] L833-->L849: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_48 256) 0)) (.cse6 (= (mod v_~a$r_buff0_thd4~0_48 256) 0))) (let ((.cse7 (not .cse6)) (.cse3 (and .cse9 .cse6)) (.cse4 (and (= (mod v_~a$w_buff1_used~0_127 256) 0) .cse6)) (.cse12 (= (mod v_~a$w_buff0_used~0_138 256) 0))) (let ((.cse10 (or .cse3 .cse4 .cse12)) (.cse11 (and .cse7 (not .cse12)))) (let ((.cse1 (ite .cse10 v_~a~0_100 (ite .cse11 v_~a$w_buff0~0_59 v_~a$w_buff1~0_52))) (.cse5 (= (mod v_~a$w_buff1_used~0_126 256) 0)) (.cse2 (= (mod v_~a$w_buff0_used~0_137 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_26 256) 0)))) (and (= (ite .cse0 v_~a$mem_tmp~0_20 .cse1) v_~a~0_98) (= (ite .cse0 v_~a$w_buff1_used~0_127 (ite (or .cse2 .cse3 .cse4) v_~a$w_buff1_used~0_127 0)) v_~a$w_buff1_used~0_126) (= v_~a$r_buff0_thd4~0_47 (ite .cse0 v_~a$r_buff0_thd4~0_48 (ite (or .cse2 .cse3 (and .cse5 .cse6)) v_~a$r_buff0_thd4~0_48 (ite (and .cse7 (not .cse2)) 0 v_~a$r_buff0_thd4~0_48)))) (= v_~__unbuffered_p3_EBX~0_12 .cse1) (= |v_P3Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_7) (= v_~a$w_buff1~0_52 v_~a$w_buff1~0_51) (= v_~a$w_buff0~0_59 v_~a$w_buff0~0_58) (= (ite .cse0 v_~a$r_buff1_thd4~0_48 (ite (let ((.cse8 (= (mod v_~a$r_buff0_thd4~0_47 256) 0))) (or (and .cse5 .cse8) .cse2 (and .cse9 .cse8))) v_~a$r_buff1_thd4~0_48 0)) v_~a$r_buff1_thd4~0_47) (= v_~a$flush_delayed~0_33 0) (= v_~a~0_100 v_~a$mem_tmp~0_20) (= (ite .cse0 v_~a$w_buff0_used~0_138 (ite .cse10 v_~a$w_buff0_used~0_138 (ite .cse11 0 v_~a$w_buff0_used~0_138))) v_~a$w_buff0_used~0_137) (= v_~weak$$choice2~0_26 |v_P3Thread1of1ForFork2_#t~nondet4_1|)))))) InVars {P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_100, ~a$w_buff1~0=v_~a$w_buff1~0_52, ~a$w_buff0~0=v_~a$w_buff0~0_59, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_48, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_138, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_127, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_48, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_47, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_137, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_12, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_47, ~a~0=v_~a~0_98, ~a$mem_tmp~0=v_~a$mem_tmp~0_20, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_51, ~a$flush_delayed~0=v_~a$flush_delayed~0_33, ~a$w_buff0~0=v_~a$w_buff0~0_58, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_126, ~weak$$choice2~0=v_~weak$$choice2~0_26} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][221], [18#L849true, Black: 185#(= ~__unbuffered_p3_EAX~0 0), 118#L813true, Black: 335#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 331#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 311#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), P2Thread1of1ForFork0InUse, Black: 372#(and (not (= ~a$w_buff1~0 ~a$w_buff0~0)) (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0_used~0 1) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1)), Black: 306#true, P3Thread1of1ForFork2InUse, Black: 373#(and (not (= ~a$w_buff1~0 ~a$w_buff0~0)) (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (= ~a$r_buff1_thd4~0 0) (< 0 (+ (div ~a$w_buff0_used~0 256) 1)) (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff1~0 0) (not (= ~a~0 ~a$w_buff1~0))), P0Thread1of1ForFork1InUse, 67#L3true, P1Thread1of1ForFork3InUse, Black: 277#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 351#(and (= ~a$r_buff1_thd4~0 0) (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1) (= ~a~0 ~a$w_buff0~0) (= ~a$r_buff0_thd4~0 0)), Black: 375#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 255#true, Black: 259#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 273#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 424#(and (= ~a$r_buff1_thd4~0 0) (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), 29#L790true, Black: 209#(= ~__unbuffered_p2_EAX~0 0), 77#L777true, 269#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 344#(and (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff0~0 1) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 345#(and (= ~a$r_buff1_thd4~0 0) (= ~a~0 1) (= ~a~0 ~a$w_buff0~0) (= ~a$r_buff0_thd4~0 0)), Black: 161#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 287#(= ~z~0 1), Black: 428#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 172#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 414#(and (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff0~0 1) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), 458#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 432#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 166#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)))), Black: 430#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 168#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 426#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 422#(and (= ~a$r_buff1_thd4~0 0) (= ~a~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 235#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 247#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 232#true, 293#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 1)), 388#(and (not (= ~a$w_buff1~0 ~a$w_buff0~0)) (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (= ~a$r_buff1_thd4~0 0) (< 0 (+ (div ~a$w_buff0_used~0 256) 1)) (= ~a$r_buff1_thd3~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~a$w_buff1~0 0) (not (= ~a~0 ~a$w_buff1~0)))]) [2022-11-18 21:11:45,548 INFO L383 tUnfolder$Statistics]: this new event has 93 ancestors and is cut-off event [2022-11-18 21:11:45,548 INFO L386 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-11-18 21:11:45,548 INFO L386 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-11-18 21:11:45,548 INFO L386 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-11-18 21:11:47,174 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([427] L833-->L849: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_48 256) 0)) (.cse6 (= (mod v_~a$r_buff0_thd4~0_48 256) 0))) (let ((.cse7 (not .cse6)) (.cse3 (and .cse9 .cse6)) (.cse4 (and (= (mod v_~a$w_buff1_used~0_127 256) 0) .cse6)) (.cse12 (= (mod v_~a$w_buff0_used~0_138 256) 0))) (let ((.cse10 (or .cse3 .cse4 .cse12)) (.cse11 (and .cse7 (not .cse12)))) (let ((.cse1 (ite .cse10 v_~a~0_100 (ite .cse11 v_~a$w_buff0~0_59 v_~a$w_buff1~0_52))) (.cse5 (= (mod v_~a$w_buff1_used~0_126 256) 0)) (.cse2 (= (mod v_~a$w_buff0_used~0_137 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_26 256) 0)))) (and (= (ite .cse0 v_~a$mem_tmp~0_20 .cse1) v_~a~0_98) (= (ite .cse0 v_~a$w_buff1_used~0_127 (ite (or .cse2 .cse3 .cse4) v_~a$w_buff1_used~0_127 0)) v_~a$w_buff1_used~0_126) (= v_~a$r_buff0_thd4~0_47 (ite .cse0 v_~a$r_buff0_thd4~0_48 (ite (or .cse2 .cse3 (and .cse5 .cse6)) v_~a$r_buff0_thd4~0_48 (ite (and .cse7 (not .cse2)) 0 v_~a$r_buff0_thd4~0_48)))) (= v_~__unbuffered_p3_EBX~0_12 .cse1) (= |v_P3Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_7) (= v_~a$w_buff1~0_52 v_~a$w_buff1~0_51) (= v_~a$w_buff0~0_59 v_~a$w_buff0~0_58) (= (ite .cse0 v_~a$r_buff1_thd4~0_48 (ite (let ((.cse8 (= (mod v_~a$r_buff0_thd4~0_47 256) 0))) (or (and .cse5 .cse8) .cse2 (and .cse9 .cse8))) v_~a$r_buff1_thd4~0_48 0)) v_~a$r_buff1_thd4~0_47) (= v_~a$flush_delayed~0_33 0) (= v_~a~0_100 v_~a$mem_tmp~0_20) (= (ite .cse0 v_~a$w_buff0_used~0_138 (ite .cse10 v_~a$w_buff0_used~0_138 (ite .cse11 0 v_~a$w_buff0_used~0_138))) v_~a$w_buff0_used~0_137) (= v_~weak$$choice2~0_26 |v_P3Thread1of1ForFork2_#t~nondet4_1|)))))) InVars {P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_100, ~a$w_buff1~0=v_~a$w_buff1~0_52, ~a$w_buff0~0=v_~a$w_buff0~0_59, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_48, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_138, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_127, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_48, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_47, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_137, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_12, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_47, ~a~0=v_~a~0_98, ~a$mem_tmp~0=v_~a$mem_tmp~0_20, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_51, ~a$flush_delayed~0=v_~a$flush_delayed~0_33, ~a$w_buff0~0=v_~a$w_buff0~0_58, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_126, ~weak$$choice2~0=v_~weak$$choice2~0_26} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][221], [18#L849true, Black: 185#(= ~__unbuffered_p3_EAX~0 0), 118#L813true, Black: 335#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 331#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 311#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), P2Thread1of1ForFork0InUse, Black: 372#(and (not (= ~a$w_buff1~0 ~a$w_buff0~0)) (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0_used~0 1) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1)), Black: 306#true, P3Thread1of1ForFork2InUse, Black: 373#(and (not (= ~a$w_buff1~0 ~a$w_buff0~0)) (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (= ~a$r_buff1_thd4~0 0) (< 0 (+ (div ~a$w_buff0_used~0 256) 1)) (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff1~0 0) (not (= ~a~0 ~a$w_buff1~0))), P0Thread1of1ForFork1InUse, 351#(and (= ~a$r_buff1_thd4~0 0) (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1) (= ~a~0 ~a$w_buff0~0) (= ~a$r_buff0_thd4~0 0)), P1Thread1of1ForFork3InUse, Black: 277#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 375#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 255#true, Black: 259#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 273#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 142#L3-1true, 424#(and (= ~a$r_buff1_thd4~0 0) (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), 29#L790true, Black: 209#(= ~__unbuffered_p2_EAX~0 0), 77#L777true, 269#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 344#(and (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff0~0 1) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 345#(and (= ~a$r_buff1_thd4~0 0) (= ~a~0 1) (= ~a~0 ~a$w_buff0~0) (= ~a$r_buff0_thd4~0 0)), Black: 161#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 287#(= ~z~0 1), Black: 428#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 172#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 458#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 414#(and (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff0~0 1) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 432#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 166#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)))), Black: 430#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 168#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 426#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 422#(and (= ~a$r_buff1_thd4~0 0) (= ~a~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 235#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 247#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 232#true, 293#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 1)), 388#(and (not (= ~a$w_buff1~0 ~a$w_buff0~0)) (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (= ~a$r_buff1_thd4~0 0) (< 0 (+ (div ~a$w_buff0_used~0 256) 1)) (= ~a$r_buff1_thd3~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~a$w_buff1~0 0) (not (= ~a~0 ~a$w_buff1~0)))]) [2022-11-18 21:11:47,174 INFO L383 tUnfolder$Statistics]: this new event has 94 ancestors and is cut-off event [2022-11-18 21:11:47,174 INFO L386 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2022-11-18 21:11:47,174 INFO L386 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2022-11-18 21:11:47,175 INFO L386 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2022-11-18 21:11:48,134 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([427] L833-->L849: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_48 256) 0)) (.cse6 (= (mod v_~a$r_buff0_thd4~0_48 256) 0))) (let ((.cse7 (not .cse6)) (.cse3 (and .cse9 .cse6)) (.cse4 (and (= (mod v_~a$w_buff1_used~0_127 256) 0) .cse6)) (.cse12 (= (mod v_~a$w_buff0_used~0_138 256) 0))) (let ((.cse10 (or .cse3 .cse4 .cse12)) (.cse11 (and .cse7 (not .cse12)))) (let ((.cse1 (ite .cse10 v_~a~0_100 (ite .cse11 v_~a$w_buff0~0_59 v_~a$w_buff1~0_52))) (.cse5 (= (mod v_~a$w_buff1_used~0_126 256) 0)) (.cse2 (= (mod v_~a$w_buff0_used~0_137 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_26 256) 0)))) (and (= (ite .cse0 v_~a$mem_tmp~0_20 .cse1) v_~a~0_98) (= (ite .cse0 v_~a$w_buff1_used~0_127 (ite (or .cse2 .cse3 .cse4) v_~a$w_buff1_used~0_127 0)) v_~a$w_buff1_used~0_126) (= v_~a$r_buff0_thd4~0_47 (ite .cse0 v_~a$r_buff0_thd4~0_48 (ite (or .cse2 .cse3 (and .cse5 .cse6)) v_~a$r_buff0_thd4~0_48 (ite (and .cse7 (not .cse2)) 0 v_~a$r_buff0_thd4~0_48)))) (= v_~__unbuffered_p3_EBX~0_12 .cse1) (= |v_P3Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_7) (= v_~a$w_buff1~0_52 v_~a$w_buff1~0_51) (= v_~a$w_buff0~0_59 v_~a$w_buff0~0_58) (= (ite .cse0 v_~a$r_buff1_thd4~0_48 (ite (let ((.cse8 (= (mod v_~a$r_buff0_thd4~0_47 256) 0))) (or (and .cse5 .cse8) .cse2 (and .cse9 .cse8))) v_~a$r_buff1_thd4~0_48 0)) v_~a$r_buff1_thd4~0_47) (= v_~a$flush_delayed~0_33 0) (= v_~a~0_100 v_~a$mem_tmp~0_20) (= (ite .cse0 v_~a$w_buff0_used~0_138 (ite .cse10 v_~a$w_buff0_used~0_138 (ite .cse11 0 v_~a$w_buff0_used~0_138))) v_~a$w_buff0_used~0_137) (= v_~weak$$choice2~0_26 |v_P3Thread1of1ForFork2_#t~nondet4_1|)))))) InVars {P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_100, ~a$w_buff1~0=v_~a$w_buff1~0_52, ~a$w_buff0~0=v_~a$w_buff0~0_59, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_48, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_138, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_127, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_48, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_47, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_137, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_12, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_47, ~a~0=v_~a~0_98, ~a$mem_tmp~0=v_~a$mem_tmp~0_20, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_51, ~a$flush_delayed~0=v_~a$flush_delayed~0_33, ~a$w_buff0~0=v_~a$w_buff0~0_58, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_126, ~weak$$choice2~0=v_~weak$$choice2~0_26} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][221], [18#L849true, Black: 185#(= ~__unbuffered_p3_EAX~0 0), 118#L813true, Black: 335#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 331#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 311#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), P2Thread1of1ForFork0InUse, Black: 306#true, Black: 372#(and (not (= ~a$w_buff1~0 ~a$w_buff0~0)) (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0_used~0 1) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1)), P3Thread1of1ForFork2InUse, Black: 373#(and (not (= ~a$w_buff1~0 ~a$w_buff0~0)) (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (= ~a$r_buff1_thd4~0 0) (< 0 (+ (div ~a$w_buff0_used~0 256) 1)) (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff1~0 0) (not (= ~a~0 ~a$w_buff1~0))), P0Thread1of1ForFork1InUse, 67#L3true, P1Thread1of1ForFork3InUse, Black: 277#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 375#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), 128#L797true, 351#(and (= ~a$r_buff1_thd4~0 0) (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1) (= ~a~0 ~a$w_buff0~0) (= ~a$r_buff0_thd4~0 0)), Black: 255#true, Black: 259#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 273#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 424#(and (= ~a$r_buff1_thd4~0 0) (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 209#(= ~__unbuffered_p2_EAX~0 0), 77#L777true, 269#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 344#(and (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff0~0 1) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 345#(and (= ~a$r_buff1_thd4~0 0) (= ~a~0 1) (= ~a~0 ~a$w_buff0~0) (= ~a$r_buff0_thd4~0 0)), Black: 161#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 287#(= ~z~0 1), Black: 428#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 172#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 458#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 414#(and (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff0~0 1) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 432#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 166#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)))), Black: 430#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 168#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 426#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 422#(and (= ~a$r_buff1_thd4~0 0) (= ~a~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 235#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 247#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 293#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 1)), Black: 232#true, 388#(and (not (= ~a$w_buff1~0 ~a$w_buff0~0)) (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (= ~a$r_buff1_thd4~0 0) (< 0 (+ (div ~a$w_buff0_used~0 256) 1)) (= ~a$r_buff1_thd3~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~a$w_buff1~0 0) (not (= ~a~0 ~a$w_buff1~0)))]) [2022-11-18 21:11:48,134 INFO L383 tUnfolder$Statistics]: this new event has 94 ancestors and is cut-off event [2022-11-18 21:11:48,134 INFO L386 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2022-11-18 21:11:48,135 INFO L386 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2022-11-18 21:11:48,135 INFO L386 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2022-11-18 21:11:50,322 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([427] L833-->L849: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_48 256) 0)) (.cse6 (= (mod v_~a$r_buff0_thd4~0_48 256) 0))) (let ((.cse7 (not .cse6)) (.cse3 (and .cse9 .cse6)) (.cse4 (and (= (mod v_~a$w_buff1_used~0_127 256) 0) .cse6)) (.cse12 (= (mod v_~a$w_buff0_used~0_138 256) 0))) (let ((.cse10 (or .cse3 .cse4 .cse12)) (.cse11 (and .cse7 (not .cse12)))) (let ((.cse1 (ite .cse10 v_~a~0_100 (ite .cse11 v_~a$w_buff0~0_59 v_~a$w_buff1~0_52))) (.cse5 (= (mod v_~a$w_buff1_used~0_126 256) 0)) (.cse2 (= (mod v_~a$w_buff0_used~0_137 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_26 256) 0)))) (and (= (ite .cse0 v_~a$mem_tmp~0_20 .cse1) v_~a~0_98) (= (ite .cse0 v_~a$w_buff1_used~0_127 (ite (or .cse2 .cse3 .cse4) v_~a$w_buff1_used~0_127 0)) v_~a$w_buff1_used~0_126) (= v_~a$r_buff0_thd4~0_47 (ite .cse0 v_~a$r_buff0_thd4~0_48 (ite (or .cse2 .cse3 (and .cse5 .cse6)) v_~a$r_buff0_thd4~0_48 (ite (and .cse7 (not .cse2)) 0 v_~a$r_buff0_thd4~0_48)))) (= v_~__unbuffered_p3_EBX~0_12 .cse1) (= |v_P3Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_7) (= v_~a$w_buff1~0_52 v_~a$w_buff1~0_51) (= v_~a$w_buff0~0_59 v_~a$w_buff0~0_58) (= (ite .cse0 v_~a$r_buff1_thd4~0_48 (ite (let ((.cse8 (= (mod v_~a$r_buff0_thd4~0_47 256) 0))) (or (and .cse5 .cse8) .cse2 (and .cse9 .cse8))) v_~a$r_buff1_thd4~0_48 0)) v_~a$r_buff1_thd4~0_47) (= v_~a$flush_delayed~0_33 0) (= v_~a~0_100 v_~a$mem_tmp~0_20) (= (ite .cse0 v_~a$w_buff0_used~0_138 (ite .cse10 v_~a$w_buff0_used~0_138 (ite .cse11 0 v_~a$w_buff0_used~0_138))) v_~a$w_buff0_used~0_137) (= v_~weak$$choice2~0_26 |v_P3Thread1of1ForFork2_#t~nondet4_1|)))))) InVars {P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_100, ~a$w_buff1~0=v_~a$w_buff1~0_52, ~a$w_buff0~0=v_~a$w_buff0~0_59, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_48, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_138, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_127, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_48, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_47, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_137, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_12, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_47, ~a~0=v_~a~0_98, ~a$mem_tmp~0=v_~a$mem_tmp~0_20, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_51, ~a$flush_delayed~0=v_~a$flush_delayed~0_33, ~a$w_buff0~0=v_~a$w_buff0~0_58, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_126, ~weak$$choice2~0=v_~weak$$choice2~0_26} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][234], [139#L800true, 18#L849true, 247#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 185#(= ~__unbuffered_p3_EAX~0 0), 118#L813true, 273#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 335#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 331#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 311#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), P2Thread1of1ForFork0InUse, Black: 306#true, Black: 372#(and (not (= ~a$w_buff1~0 ~a$w_buff0~0)) (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0_used~0 1) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1)), P3Thread1of1ForFork2InUse, Black: 373#(and (not (= ~a$w_buff1~0 ~a$w_buff0~0)) (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (= ~a$r_buff1_thd4~0 0) (< 0 (+ (div ~a$w_buff0_used~0 256) 1)) (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff1~0 0) (not (= ~a~0 ~a$w_buff1~0))), P0Thread1of1ForFork1InUse, 67#L3true, P1Thread1of1ForFork3InUse, Black: 277#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 375#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), 351#(and (= ~a$r_buff1_thd4~0 0) (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1) (= ~a~0 ~a$w_buff0~0) (= ~a$r_buff0_thd4~0 0)), Black: 255#true, Black: 259#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 424#(and (= ~a$r_buff1_thd4~0 0) (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 209#(= ~__unbuffered_p2_EAX~0 0), 77#L777true, Black: 344#(and (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff0~0 1) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 345#(and (= ~a$r_buff1_thd4~0 0) (= ~a~0 1) (= ~a~0 ~a$w_buff0~0) (= ~a$r_buff0_thd4~0 0)), Black: 161#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 287#(= ~z~0 1), Black: 428#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 172#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 414#(and (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff0~0 1) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 432#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 166#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)))), Black: 430#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 168#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 426#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 422#(and (= ~a$r_buff1_thd4~0 0) (= ~a~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 235#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 464#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 243#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 293#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 1)), Black: 232#true, 388#(and (not (= ~a$w_buff1~0 ~a$w_buff0~0)) (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (= ~a$r_buff1_thd4~0 0) (< 0 (+ (div ~a$w_buff0_used~0 256) 1)) (= ~a$r_buff1_thd3~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~a$w_buff1~0 0) (not (= ~a~0 ~a$w_buff1~0)))]) [2022-11-18 21:11:50,322 INFO L383 tUnfolder$Statistics]: this new event has 95 ancestors and is cut-off event [2022-11-18 21:11:50,322 INFO L386 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-11-18 21:11:50,322 INFO L386 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-11-18 21:11:50,322 INFO L386 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-11-18 21:11:50,409 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([427] L833-->L849: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_48 256) 0)) (.cse6 (= (mod v_~a$r_buff0_thd4~0_48 256) 0))) (let ((.cse7 (not .cse6)) (.cse3 (and .cse9 .cse6)) (.cse4 (and (= (mod v_~a$w_buff1_used~0_127 256) 0) .cse6)) (.cse12 (= (mod v_~a$w_buff0_used~0_138 256) 0))) (let ((.cse10 (or .cse3 .cse4 .cse12)) (.cse11 (and .cse7 (not .cse12)))) (let ((.cse1 (ite .cse10 v_~a~0_100 (ite .cse11 v_~a$w_buff0~0_59 v_~a$w_buff1~0_52))) (.cse5 (= (mod v_~a$w_buff1_used~0_126 256) 0)) (.cse2 (= (mod v_~a$w_buff0_used~0_137 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_26 256) 0)))) (and (= (ite .cse0 v_~a$mem_tmp~0_20 .cse1) v_~a~0_98) (= (ite .cse0 v_~a$w_buff1_used~0_127 (ite (or .cse2 .cse3 .cse4) v_~a$w_buff1_used~0_127 0)) v_~a$w_buff1_used~0_126) (= v_~a$r_buff0_thd4~0_47 (ite .cse0 v_~a$r_buff0_thd4~0_48 (ite (or .cse2 .cse3 (and .cse5 .cse6)) v_~a$r_buff0_thd4~0_48 (ite (and .cse7 (not .cse2)) 0 v_~a$r_buff0_thd4~0_48)))) (= v_~__unbuffered_p3_EBX~0_12 .cse1) (= |v_P3Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_7) (= v_~a$w_buff1~0_52 v_~a$w_buff1~0_51) (= v_~a$w_buff0~0_59 v_~a$w_buff0~0_58) (= (ite .cse0 v_~a$r_buff1_thd4~0_48 (ite (let ((.cse8 (= (mod v_~a$r_buff0_thd4~0_47 256) 0))) (or (and .cse5 .cse8) .cse2 (and .cse9 .cse8))) v_~a$r_buff1_thd4~0_48 0)) v_~a$r_buff1_thd4~0_47) (= v_~a$flush_delayed~0_33 0) (= v_~a~0_100 v_~a$mem_tmp~0_20) (= (ite .cse0 v_~a$w_buff0_used~0_138 (ite .cse10 v_~a$w_buff0_used~0_138 (ite .cse11 0 v_~a$w_buff0_used~0_138))) v_~a$w_buff0_used~0_137) (= v_~weak$$choice2~0_26 |v_P3Thread1of1ForFork2_#t~nondet4_1|)))))) InVars {P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_100, ~a$w_buff1~0=v_~a$w_buff1~0_52, ~a$w_buff0~0=v_~a$w_buff0~0_59, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_48, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_138, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_127, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_48, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_47, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_137, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_12, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_47, ~a~0=v_~a~0_98, ~a$mem_tmp~0=v_~a$mem_tmp~0_20, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_51, ~a$flush_delayed~0=v_~a$flush_delayed~0_33, ~a$w_buff0~0=v_~a$w_buff0~0_58, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_126, ~weak$$choice2~0=v_~weak$$choice2~0_26} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][221], [18#L849true, Black: 185#(= ~__unbuffered_p3_EAX~0 0), 118#L813true, Black: 335#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 331#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 311#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), P2Thread1of1ForFork0InUse, Black: 306#true, Black: 372#(and (not (= ~a$w_buff1~0 ~a$w_buff0~0)) (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0_used~0 1) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1)), P3Thread1of1ForFork2InUse, Black: 373#(and (not (= ~a$w_buff1~0 ~a$w_buff0~0)) (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (= ~a$r_buff1_thd4~0 0) (< 0 (+ (div ~a$w_buff0_used~0 256) 1)) (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff1~0 0) (not (= ~a~0 ~a$w_buff1~0))), P0Thread1of1ForFork1InUse, P1Thread1of1ForFork3InUse, Black: 277#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 351#(and (= ~a$r_buff1_thd4~0 0) (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1) (= ~a~0 ~a$w_buff0~0) (= ~a$r_buff0_thd4~0 0)), Black: 375#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), 128#L797true, Black: 255#true, Black: 259#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 273#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 142#L3-1true, 424#(and (= ~a$r_buff1_thd4~0 0) (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 209#(= ~__unbuffered_p2_EAX~0 0), 77#L777true, 269#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 344#(and (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff0~0 1) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 345#(and (= ~a$r_buff1_thd4~0 0) (= ~a~0 1) (= ~a~0 ~a$w_buff0~0) (= ~a$r_buff0_thd4~0 0)), Black: 161#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 287#(= ~z~0 1), Black: 428#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 172#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 458#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 414#(and (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff0~0 1) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 432#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 166#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)))), Black: 430#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 168#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 426#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 422#(and (= ~a$r_buff1_thd4~0 0) (= ~a~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 235#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 247#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 232#true, 293#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 1)), 388#(and (not (= ~a$w_buff1~0 ~a$w_buff0~0)) (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (= ~a$r_buff1_thd4~0 0) (< 0 (+ (div ~a$w_buff0_used~0 256) 1)) (= ~a$r_buff1_thd3~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~a$w_buff1~0 0) (not (= ~a~0 ~a$w_buff1~0)))]) [2022-11-18 21:11:50,410 INFO L383 tUnfolder$Statistics]: this new event has 95 ancestors and is cut-off event [2022-11-18 21:11:50,410 INFO L386 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-11-18 21:11:50,410 INFO L386 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-11-18 21:11:50,410 INFO L386 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event