./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix026_power.opt_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version cf1a7837 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_cb3f10b7-08b4-432b-9c35-f8482bd7d241/bin/uautomizer-verify-uTZkv6EMXl/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3f10b7-08b4-432b-9c35-f8482bd7d241/bin/uautomizer-verify-uTZkv6EMXl/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3f10b7-08b4-432b-9c35-f8482bd7d241/bin/uautomizer-verify-uTZkv6EMXl/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3f10b7-08b4-432b-9c35-f8482bd7d241/bin/uautomizer-verify-uTZkv6EMXl/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix026_power.opt_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3f10b7-08b4-432b-9c35-f8482bd7d241/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3f10b7-08b4-432b-9c35-f8482bd7d241/bin/uautomizer-verify-uTZkv6EMXl --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 98d8aefe0e01e05845b14b6dd9685e093c9c5c7f8cc89a689bcb4822a773c420 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 02:04:52,669 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 02:04:52,754 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3f10b7-08b4-432b-9c35-f8482bd7d241/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-12 02:04:52,759 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 02:04:52,760 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 02:04:52,785 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 02:04:52,786 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 02:04:52,786 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 02:04:52,787 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 02:04:52,788 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 02:04:52,789 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 02:04:52,789 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 02:04:52,790 INFO L153 SettingsManager]: * Use SBE=true [2023-11-12 02:04:52,790 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 02:04:52,791 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 02:04:52,791 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 02:04:52,792 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 02:04:52,792 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 02:04:52,793 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-12 02:04:52,793 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-12 02:04:52,794 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-12 02:04:52,798 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 02:04:52,798 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-12 02:04:52,799 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-12 02:04:52,799 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 02:04:52,800 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 02:04:52,800 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 02:04:52,801 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-12 02:04:52,806 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 02:04:52,807 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:04:52,807 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 02:04:52,808 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 02:04:52,808 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-12 02:04:52,808 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 02:04:52,809 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-12 02:04:52,809 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-12 02:04:52,809 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 02:04:52,810 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-12 02:04:52,810 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3f10b7-08b4-432b-9c35-f8482bd7d241/bin/uautomizer-verify-uTZkv6EMXl/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_cb3f10b7-08b4-432b-9c35-f8482bd7d241/bin/uautomizer-verify-uTZkv6EMXl Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 98d8aefe0e01e05845b14b6dd9685e093c9c5c7f8cc89a689bcb4822a773c420 [2023-11-12 02:04:53,154 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 02:04:53,186 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 02:04:53,189 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 02:04:53,191 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 02:04:53,192 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 02:04:53,193 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3f10b7-08b4-432b-9c35-f8482bd7d241/bin/uautomizer-verify-uTZkv6EMXl/../../sv-benchmarks/c/pthread-wmm/mix026_power.opt_tso.opt.i [2023-11-12 02:04:56,269 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 02:04:56,604 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 02:04:56,605 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3f10b7-08b4-432b-9c35-f8482bd7d241/sv-benchmarks/c/pthread-wmm/mix026_power.opt_tso.opt.i [2023-11-12 02:04:56,625 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3f10b7-08b4-432b-9c35-f8482bd7d241/bin/uautomizer-verify-uTZkv6EMXl/data/86e0951a3/138451a756c644168036411b9b69f564/FLAG711695406 [2023-11-12 02:04:56,642 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3f10b7-08b4-432b-9c35-f8482bd7d241/bin/uautomizer-verify-uTZkv6EMXl/data/86e0951a3/138451a756c644168036411b9b69f564 [2023-11-12 02:04:56,645 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 02:04:56,647 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 02:04:56,648 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 02:04:56,648 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 02:04:56,654 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 02:04:56,655 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:04:56" (1/1) ... [2023-11-12 02:04:56,656 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1eac7d93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:04:56, skipping insertion in model container [2023-11-12 02:04:56,656 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:04:56" (1/1) ... [2023-11-12 02:04:56,710 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 02:04:57,344 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:04:57,358 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 02:04:57,453 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:04:57,488 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 02:04:57,488 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 02:04:57,496 INFO L206 MainTranslator]: Completed translation [2023-11-12 02:04:57,497 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:04:57 WrapperNode [2023-11-12 02:04:57,497 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 02:04:57,498 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 02:04:57,498 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 02:04:57,498 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 02:04:57,506 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:04:57" (1/1) ... [2023-11-12 02:04:57,532 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:04:57" (1/1) ... [2023-11-12 02:04:57,566 INFO L138 Inliner]: procedures = 177, calls = 70, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 150 [2023-11-12 02:04:57,569 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 02:04:57,570 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 02:04:57,570 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 02:04:57,571 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 02:04:57,582 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:04:57" (1/1) ... [2023-11-12 02:04:57,583 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:04:57" (1/1) ... [2023-11-12 02:04:57,589 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:04:57" (1/1) ... [2023-11-12 02:04:57,589 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:04:57" (1/1) ... [2023-11-12 02:04:57,599 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:04:57" (1/1) ... [2023-11-12 02:04:57,612 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:04:57" (1/1) ... [2023-11-12 02:04:57,615 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:04:57" (1/1) ... [2023-11-12 02:04:57,618 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:04:57" (1/1) ... [2023-11-12 02:04:57,624 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 02:04:57,625 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 02:04:57,625 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 02:04:57,626 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 02:04:57,627 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:04:57" (1/1) ... [2023-11-12 02:04:57,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:04:57,656 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3f10b7-08b4-432b-9c35-f8482bd7d241/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:04:57,676 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3f10b7-08b4-432b-9c35-f8482bd7d241/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 02:04:57,715 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3f10b7-08b4-432b-9c35-f8482bd7d241/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 02:04:57,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-12 02:04:57,726 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-12 02:04:57,726 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 02:04:57,727 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-12 02:04:57,727 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-12 02:04:57,727 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-12 02:04:57,727 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-12 02:04:57,727 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-12 02:04:57,727 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-12 02:04:57,728 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-12 02:04:57,728 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-12 02:04:57,728 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-12 02:04:57,728 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-12 02:04:57,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 02:04:57,728 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-12 02:04:57,730 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 02:04:57,730 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 02:04:57,732 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-12 02:04:57,961 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 02:04:57,964 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 02:04:58,369 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 02:04:58,554 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 02:04:58,555 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-12 02:04:58,557 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:04:58 BoogieIcfgContainer [2023-11-12 02:04:58,558 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 02:04:58,560 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 02:04:58,561 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 02:04:58,564 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 02:04:58,565 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:04:56" (1/3) ... [2023-11-12 02:04:58,565 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@751a4b2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:04:58, skipping insertion in model container [2023-11-12 02:04:58,566 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:04:57" (2/3) ... [2023-11-12 02:04:58,566 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@751a4b2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:04:58, skipping insertion in model container [2023-11-12 02:04:58,566 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:04:58" (3/3) ... [2023-11-12 02:04:58,568 INFO L112 eAbstractionObserver]: Analyzing ICFG mix026_power.opt_tso.opt.i [2023-11-12 02:04:58,590 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 02:04:58,590 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-11-12 02:04:58,590 INFO L521 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-12 02:04:58,682 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-12 02:04:58,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 160 places, 150 transitions, 316 flow [2023-11-12 02:04:58,823 INFO L124 PetriNetUnfolderBase]: 3/146 cut-off events. [2023-11-12 02:04:58,824 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-12 02:04:58,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 146 events. 3/146 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 118 event pairs, 0 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 105. Up to 2 conditions per place. [2023-11-12 02:04:58,831 INFO L82 GeneralOperation]: Start removeDead. Operand has 160 places, 150 transitions, 316 flow [2023-11-12 02:04:58,837 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 156 places, 146 transitions, 304 flow [2023-11-12 02:04:58,841 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-12 02:04:58,852 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 156 places, 146 transitions, 304 flow [2023-11-12 02:04:58,855 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 156 places, 146 transitions, 304 flow [2023-11-12 02:04:58,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 156 places, 146 transitions, 304 flow [2023-11-12 02:04:58,902 INFO L124 PetriNetUnfolderBase]: 3/146 cut-off events. [2023-11-12 02:04:58,902 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-12 02:04:58,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 146 events. 3/146 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 118 event pairs, 0 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 105. Up to 2 conditions per place. [2023-11-12 02:04:58,908 INFO L119 LiptonReduction]: Number of co-enabled transitions 3860 [2023-11-12 02:05:05,068 INFO L134 LiptonReduction]: Checked pairs total: 9954 [2023-11-12 02:05:05,069 INFO L136 LiptonReduction]: Total number of compositions: 141 [2023-11-12 02:05:05,104 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 02:05:05,113 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@750851f8, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-12 02:05:05,114 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-11-12 02:05:05,115 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-12 02:05:05,116 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-11-12 02:05:05,116 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-12 02:05:05,116 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:05:05,117 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-12 02:05:05,118 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-12 02:05:05,123 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:05:05,124 INFO L85 PathProgramCache]: Analyzing trace with hash 641, now seen corresponding path program 1 times [2023-11-12 02:05:05,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:05:05,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664999013] [2023-11-12 02:05:05,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:05:05,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:05:05,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:05:05,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:05:05,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:05:05,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664999013] [2023-11-12 02:05:05,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664999013] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:05:05,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:05:05,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-12 02:05:05,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323630255] [2023-11-12 02:05:05,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:05:05,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-12 02:05:05,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:05:05,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-12 02:05:05,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-12 02:05:05,341 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 291 [2023-11-12 02:05:05,346 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 92 flow. Second operand has 2 states, 2 states have (on average 135.5) internal successors, (271), 2 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:05:05,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:05:05,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 291 [2023-11-12 02:05:05,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:05:07,154 INFO L124 PetriNetUnfolderBase]: 6949/9556 cut-off events. [2023-11-12 02:05:07,154 INFO L125 PetriNetUnfolderBase]: For 84/84 co-relation queries the response was YES. [2023-11-12 02:05:07,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19170 conditions, 9556 events. 6949/9556 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 473. Compared 49685 event pairs, 6949 based on Foata normal form. 0/8247 useless extension candidates. Maximal degree in co-relation 19158. Up to 9399 conditions per place. [2023-11-12 02:05:07,249 INFO L140 encePairwiseOnDemand]: 282/291 looper letters, 27 selfloop transitions, 0 changer transitions 0/31 dead transitions. [2023-11-12 02:05:07,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 31 transitions, 128 flow [2023-11-12 02:05:07,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-12 02:05:07,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-12 02:05:07,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 306 transitions. [2023-11-12 02:05:07,271 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5257731958762887 [2023-11-12 02:05:07,272 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 306 transitions. [2023-11-12 02:05:07,272 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 306 transitions. [2023-11-12 02:05:07,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:05:07,279 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 306 transitions. [2023-11-12 02:05:07,286 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 153.0) internal successors, (306), 2 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:05:07,293 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 291.0) internal successors, (873), 3 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:05:07,295 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 291.0) internal successors, (873), 3 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:05:07,297 INFO L175 Difference]: Start difference. First operand has 52 places, 40 transitions, 92 flow. Second operand 2 states and 306 transitions. [2023-11-12 02:05:07,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 31 transitions, 128 flow [2023-11-12 02:05:07,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 31 transitions, 124 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-12 02:05:07,308 INFO L231 Difference]: Finished difference. Result has 41 places, 31 transitions, 70 flow [2023-11-12 02:05:07,310 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=70, PETRI_PLACES=41, PETRI_TRANSITIONS=31} [2023-11-12 02:05:07,315 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -11 predicate places. [2023-11-12 02:05:07,315 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 70 flow [2023-11-12 02:05:07,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 135.5) internal successors, (271), 2 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:05:07,316 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:05:07,316 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-12 02:05:07,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 02:05:07,317 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-12 02:05:07,317 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:05:07,317 INFO L85 PathProgramCache]: Analyzing trace with hash 608384640, now seen corresponding path program 1 times [2023-11-12 02:05:07,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:05:07,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357736367] [2023-11-12 02:05:07,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:05:07,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:05:07,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:05:07,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:05:07,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:05:07,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357736367] [2023-11-12 02:05:07,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357736367] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:05:07,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:05:07,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-12 02:05:07,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139029866] [2023-11-12 02:05:07,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:05:07,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:05:07,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:05:07,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:05:07,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:05:07,704 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 291 [2023-11-12 02:05:07,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:05:07,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:05:07,706 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 291 [2023-11-12 02:05:07,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:05:09,149 INFO L124 PetriNetUnfolderBase]: 5463/7720 cut-off events. [2023-11-12 02:05:09,150 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-12 02:05:09,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15317 conditions, 7720 events. 5463/7720 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 396. Compared 41524 event pairs, 1453 based on Foata normal form. 0/7156 useless extension candidates. Maximal degree in co-relation 15314. Up to 5923 conditions per place. [2023-11-12 02:05:09,214 INFO L140 encePairwiseOnDemand]: 288/291 looper letters, 41 selfloop transitions, 2 changer transitions 2/49 dead transitions. [2023-11-12 02:05:09,214 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 49 transitions, 200 flow [2023-11-12 02:05:09,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:05:09,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-12 02:05:09,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 448 transitions. [2023-11-12 02:05:09,223 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5131729667812142 [2023-11-12 02:05:09,223 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 448 transitions. [2023-11-12 02:05:09,223 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 448 transitions. [2023-11-12 02:05:09,223 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:05:09,224 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 448 transitions. [2023-11-12 02:05:09,226 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 149.33333333333334) internal successors, (448), 3 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:05:09,231 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 291.0) internal successors, (1164), 4 states have internal predecessors, (1164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:05:09,234 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 291.0) internal successors, (1164), 4 states have internal predecessors, (1164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:05:09,234 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 70 flow. Second operand 3 states and 448 transitions. [2023-11-12 02:05:09,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 49 transitions, 200 flow [2023-11-12 02:05:09,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 49 transitions, 200 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-12 02:05:09,238 INFO L231 Difference]: Finished difference. Result has 42 places, 29 transitions, 70 flow [2023-11-12 02:05:09,238 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=42, PETRI_TRANSITIONS=29} [2023-11-12 02:05:09,240 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -10 predicate places. [2023-11-12 02:05:09,240 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 70 flow [2023-11-12 02:05:09,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:05:09,247 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:05:09,247 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:05:09,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 02:05:09,247 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-12 02:05:09,249 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:05:09,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1245356569, now seen corresponding path program 1 times [2023-11-12 02:05:09,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:05:09,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277249022] [2023-11-12 02:05:09,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:05:09,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:05:09,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:05:09,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:05:09,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:05:09,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277249022] [2023-11-12 02:05:09,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277249022] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:05:09,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:05:09,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:05:09,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830660840] [2023-11-12 02:05:09,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:05:09,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:05:09,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:05:09,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:05:09,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:05:09,691 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 291 [2023-11-12 02:05:09,692 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 124.0) internal successors, (496), 4 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:05:09,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:05:09,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 291 [2023-11-12 02:05:09,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:05:13,628 INFO L124 PetriNetUnfolderBase]: 20389/27330 cut-off events. [2023-11-12 02:05:13,628 INFO L125 PetriNetUnfolderBase]: For 1340/1340 co-relation queries the response was YES. [2023-11-12 02:05:13,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56353 conditions, 27330 events. 20389/27330 cut-off events. For 1340/1340 co-relation queries the response was YES. Maximal size of possible extension queue 874. Compared 142608 event pairs, 6269 based on Foata normal form. 0/26402 useless extension candidates. Maximal degree in co-relation 56349. Up to 16507 conditions per place. [2023-11-12 02:05:13,817 INFO L140 encePairwiseOnDemand]: 281/291 looper letters, 74 selfloop transitions, 16 changer transitions 0/90 dead transitions. [2023-11-12 02:05:13,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 90 transitions, 384 flow [2023-11-12 02:05:13,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:05:13,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-12 02:05:13,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 697 transitions. [2023-11-12 02:05:13,821 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47903780068728524 [2023-11-12 02:05:13,821 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 697 transitions. [2023-11-12 02:05:13,821 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 697 transitions. [2023-11-12 02:05:13,822 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:05:13,822 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 697 transitions. [2023-11-12 02:05:13,824 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 139.4) internal successors, (697), 5 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:05:13,828 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 291.0) internal successors, (1746), 6 states have internal predecessors, (1746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:05:13,829 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 291.0) internal successors, (1746), 6 states have internal predecessors, (1746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:05:13,829 INFO L175 Difference]: Start difference. First operand has 42 places, 29 transitions, 70 flow. Second operand 5 states and 697 transitions. [2023-11-12 02:05:13,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 90 transitions, 384 flow [2023-11-12 02:05:13,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 90 transitions, 374 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-12 02:05:13,834 INFO L231 Difference]: Finished difference. Result has 47 places, 44 transitions, 194 flow [2023-11-12 02:05:13,834 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=194, PETRI_PLACES=47, PETRI_TRANSITIONS=44} [2023-11-12 02:05:13,835 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -5 predicate places. [2023-11-12 02:05:13,835 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 44 transitions, 194 flow [2023-11-12 02:05:13,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 124.0) internal successors, (496), 4 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:05:13,836 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:05:13,836 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:05:13,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-12 02:05:13,837 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-12 02:05:13,837 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:05:13,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1245356513, now seen corresponding path program 1 times [2023-11-12 02:05:13,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:05:13,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90891380] [2023-11-12 02:05:13,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:05:13,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:05:13,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:05:14,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:05:14,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:05:14,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90891380] [2023-11-12 02:05:14,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90891380] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:05:14,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:05:14,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:05:14,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794328803] [2023-11-12 02:05:14,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:05:14,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 02:05:14,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:05:14,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 02:05:14,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-12 02:05:14,890 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 291 [2023-11-12 02:05:14,891 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 44 transitions, 194 flow. Second operand has 6 states, 6 states have (on average 117.0) internal successors, (702), 6 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:05:14,892 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:05:14,892 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 291 [2023-11-12 02:05:14,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:05:16,326 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([567] L880-->L19-1: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_12| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_30|) (= (mod v_~main$tmp_guard1~0_8 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_12|) (= v_~main$tmp_guard1~0_8 (ite (= (ite (not (and (= 0 v_~__unbuffered_p3_EBX~0_10) (= v_~z~0_14 2) (= 2 v_~__unbuffered_p3_EAX~0_10) (= v_~__unbuffered_p1_EAX~0_10 0) (= v_~__unbuffered_p0_EAX~0_16 0))) 1 0) 0) 0 1))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_10, ~z~0=v_~z~0_14, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_30|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_12|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_10, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~z~0=v_~z~0_14, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][49], [P0Thread1of1ForFork2InUse, 111#L19-1true, 170#true, 186#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), 109#$Ultimate##0true, Black: 172#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 175#(and (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))), Black: 173#(or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)), 39#L770true, 31#L838true, 123#L822true, P1Thread1of1ForFork0InUse, P3Thread1of1ForFork1InUse, 163#true, P2Thread1of1ForFork3InUse]) [2023-11-12 02:05:16,326 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2023-11-12 02:05:16,326 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-12 02:05:16,327 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-12 02:05:16,327 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-12 02:05:16,327 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([460] L838-->L845: Formula: (let ((.cse5 (not (= (mod v_~x$r_buff0_thd4~0_28 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_115 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd4~0_24 256) 0)))) (let ((.cse2 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_105 256) 0)))) (.cse0 (and .cse5 .cse3)) (.cse1 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_116 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_28) v_~x$r_buff0_thd4~0_27) (= (ite .cse1 v_~x$w_buff0~0_39 (ite .cse2 v_~x$w_buff1~0_38 v_~x~0_55)) v_~x~0_54) (= v_~x$w_buff1_used~0_104 (ite (or .cse2 .cse0) 0 v_~x$w_buff1_used~0_105)) (= v_~x$r_buff1_thd4~0_23 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd4~0_27 256) 0))) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_104 256) 0)))) 0 v_~x$r_buff1_thd4~0_24)) (= (ite .cse1 0 v_~x$w_buff0_used~0_116) v_~x$w_buff0_used~0_115)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_39, ~x$w_buff1~0=v_~x$w_buff1~0_38, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_105, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_28, ~x~0=v_~x~0_55, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_24, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_116} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_39, ~x$w_buff1~0=v_~x$w_buff1~0_38, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_104, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_27, ~x~0=v_~x~0_54, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_23, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_115} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][51], [P0Thread1of1ForFork2InUse, 42#L880true, 170#true, 110#L845true, 186#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), 109#$Ultimate##0true, Black: 172#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 175#(and (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))), Black: 173#(or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)), 39#L770true, 123#L822true, P1Thread1of1ForFork0InUse, P3Thread1of1ForFork1InUse, 163#true, P2Thread1of1ForFork3InUse]) [2023-11-12 02:05:16,327 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2023-11-12 02:05:16,327 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-12 02:05:16,328 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-12 02:05:16,328 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-12 02:05:16,592 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([567] L880-->L19-1: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_12| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_30|) (= (mod v_~main$tmp_guard1~0_8 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_12|) (= v_~main$tmp_guard1~0_8 (ite (= (ite (not (and (= 0 v_~__unbuffered_p3_EBX~0_10) (= v_~z~0_14 2) (= 2 v_~__unbuffered_p3_EAX~0_10) (= v_~__unbuffered_p1_EAX~0_10 0) (= v_~__unbuffered_p0_EAX~0_16 0))) 1 0) 0) 0 1))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_10, ~z~0=v_~z~0_14, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_30|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_12|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_10, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~z~0=v_~z~0_14, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][49], [P0Thread1of1ForFork2InUse, 111#L19-1true, 170#true, 186#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), Black: 172#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 175#(and (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))), Black: 173#(or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)), 39#L770true, 31#L838true, 123#L822true, P1Thread1of1ForFork0InUse, 58#L792true, P3Thread1of1ForFork1InUse, 163#true, P2Thread1of1ForFork3InUse]) [2023-11-12 02:05:16,592 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-11-12 02:05:16,593 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-12 02:05:16,593 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-12 02:05:16,593 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-12 02:05:16,594 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([460] L838-->L845: Formula: (let ((.cse5 (not (= (mod v_~x$r_buff0_thd4~0_28 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_115 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd4~0_24 256) 0)))) (let ((.cse2 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_105 256) 0)))) (.cse0 (and .cse5 .cse3)) (.cse1 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_116 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_28) v_~x$r_buff0_thd4~0_27) (= (ite .cse1 v_~x$w_buff0~0_39 (ite .cse2 v_~x$w_buff1~0_38 v_~x~0_55)) v_~x~0_54) (= v_~x$w_buff1_used~0_104 (ite (or .cse2 .cse0) 0 v_~x$w_buff1_used~0_105)) (= v_~x$r_buff1_thd4~0_23 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd4~0_27 256) 0))) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_104 256) 0)))) 0 v_~x$r_buff1_thd4~0_24)) (= (ite .cse1 0 v_~x$w_buff0_used~0_116) v_~x$w_buff0_used~0_115)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_39, ~x$w_buff1~0=v_~x$w_buff1~0_38, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_105, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_28, ~x~0=v_~x~0_55, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_24, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_116} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_39, ~x$w_buff1~0=v_~x$w_buff1~0_38, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_104, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_27, ~x~0=v_~x~0_54, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_23, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_115} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][51], [P0Thread1of1ForFork2InUse, 42#L880true, 170#true, 110#L845true, 186#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), Black: 172#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 175#(and (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))), Black: 173#(or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)), 39#L770true, 123#L822true, P1Thread1of1ForFork0InUse, 58#L792true, P3Thread1of1ForFork1InUse, 163#true, P2Thread1of1ForFork3InUse]) [2023-11-12 02:05:16,594 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-11-12 02:05:16,594 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-12 02:05:16,594 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-12 02:05:16,594 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-12 02:05:16,617 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([567] L880-->L19-1: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_12| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_30|) (= (mod v_~main$tmp_guard1~0_8 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_12|) (= v_~main$tmp_guard1~0_8 (ite (= (ite (not (and (= 0 v_~__unbuffered_p3_EBX~0_10) (= v_~z~0_14 2) (= 2 v_~__unbuffered_p3_EAX~0_10) (= v_~__unbuffered_p1_EAX~0_10 0) (= v_~__unbuffered_p0_EAX~0_16 0))) 1 0) 0) 0 1))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_10, ~z~0=v_~z~0_14, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_30|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_12|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_10, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~z~0=v_~z~0_14, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][49], [P0Thread1of1ForFork2InUse, 111#L19-1true, 170#true, 186#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), 109#$Ultimate##0true, Black: 172#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 175#(and (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))), Black: 173#(or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)), 31#L838true, 123#L822true, P1Thread1of1ForFork0InUse, P3Thread1of1ForFork1InUse, 163#true, 92#P0EXITtrue, P2Thread1of1ForFork3InUse]) [2023-11-12 02:05:16,617 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-11-12 02:05:16,617 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-12 02:05:16,617 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-12 02:05:16,617 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-12 02:05:16,618 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([460] L838-->L845: Formula: (let ((.cse5 (not (= (mod v_~x$r_buff0_thd4~0_28 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_115 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd4~0_24 256) 0)))) (let ((.cse2 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_105 256) 0)))) (.cse0 (and .cse5 .cse3)) (.cse1 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_116 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_28) v_~x$r_buff0_thd4~0_27) (= (ite .cse1 v_~x$w_buff0~0_39 (ite .cse2 v_~x$w_buff1~0_38 v_~x~0_55)) v_~x~0_54) (= v_~x$w_buff1_used~0_104 (ite (or .cse2 .cse0) 0 v_~x$w_buff1_used~0_105)) (= v_~x$r_buff1_thd4~0_23 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd4~0_27 256) 0))) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_104 256) 0)))) 0 v_~x$r_buff1_thd4~0_24)) (= (ite .cse1 0 v_~x$w_buff0_used~0_116) v_~x$w_buff0_used~0_115)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_39, ~x$w_buff1~0=v_~x$w_buff1~0_38, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_105, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_28, ~x~0=v_~x~0_55, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_24, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_116} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_39, ~x$w_buff1~0=v_~x$w_buff1~0_38, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_104, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_27, ~x~0=v_~x~0_54, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_23, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_115} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][51], [P0Thread1of1ForFork2InUse, 42#L880true, 170#true, 110#L845true, 186#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), 109#$Ultimate##0true, Black: 172#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 175#(and (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))), Black: 173#(or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)), 123#L822true, P1Thread1of1ForFork0InUse, P3Thread1of1ForFork1InUse, 163#true, 92#P0EXITtrue, P2Thread1of1ForFork3InUse]) [2023-11-12 02:05:16,618 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-11-12 02:05:16,618 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-12 02:05:16,618 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-12 02:05:16,618 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-12 02:05:16,620 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([567] L880-->L19-1: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_12| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_30|) (= (mod v_~main$tmp_guard1~0_8 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_12|) (= v_~main$tmp_guard1~0_8 (ite (= (ite (not (and (= 0 v_~__unbuffered_p3_EBX~0_10) (= v_~z~0_14 2) (= 2 v_~__unbuffered_p3_EAX~0_10) (= v_~__unbuffered_p1_EAX~0_10 0) (= v_~__unbuffered_p0_EAX~0_16 0))) 1 0) 0) 0 1))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_10, ~z~0=v_~z~0_14, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_30|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_12|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_10, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~z~0=v_~z~0_14, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][49], [111#L19-1true, P0Thread1of1ForFork2InUse, 170#true, 186#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), 109#$Ultimate##0true, Black: 172#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 175#(and (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))), Black: 173#(or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)), 39#L770true, 76#P2EXITtrue, 31#L838true, P1Thread1of1ForFork0InUse, P3Thread1of1ForFork1InUse, 163#true, P2Thread1of1ForFork3InUse]) [2023-11-12 02:05:16,620 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-11-12 02:05:16,620 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-12 02:05:16,621 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-12 02:05:16,621 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-12 02:05:16,622 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([460] L838-->L845: Formula: (let ((.cse5 (not (= (mod v_~x$r_buff0_thd4~0_28 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_115 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd4~0_24 256) 0)))) (let ((.cse2 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_105 256) 0)))) (.cse0 (and .cse5 .cse3)) (.cse1 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_116 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_28) v_~x$r_buff0_thd4~0_27) (= (ite .cse1 v_~x$w_buff0~0_39 (ite .cse2 v_~x$w_buff1~0_38 v_~x~0_55)) v_~x~0_54) (= v_~x$w_buff1_used~0_104 (ite (or .cse2 .cse0) 0 v_~x$w_buff1_used~0_105)) (= v_~x$r_buff1_thd4~0_23 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd4~0_27 256) 0))) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_104 256) 0)))) 0 v_~x$r_buff1_thd4~0_24)) (= (ite .cse1 0 v_~x$w_buff0_used~0_116) v_~x$w_buff0_used~0_115)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_39, ~x$w_buff1~0=v_~x$w_buff1~0_38, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_105, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_28, ~x~0=v_~x~0_55, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_24, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_116} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_39, ~x$w_buff1~0=v_~x$w_buff1~0_38, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_104, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_27, ~x~0=v_~x~0_54, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_23, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_115} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][51], [P0Thread1of1ForFork2InUse, 42#L880true, 170#true, 110#L845true, 186#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), 109#$Ultimate##0true, Black: 172#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 175#(and (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))), Black: 173#(or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)), 39#L770true, 76#P2EXITtrue, P1Thread1of1ForFork0InUse, P3Thread1of1ForFork1InUse, 163#true, P2Thread1of1ForFork3InUse]) [2023-11-12 02:05:16,622 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-11-12 02:05:16,622 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-12 02:05:16,622 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-12 02:05:16,622 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-12 02:05:16,995 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([567] L880-->L19-1: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_12| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_30|) (= (mod v_~main$tmp_guard1~0_8 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_12|) (= v_~main$tmp_guard1~0_8 (ite (= (ite (not (and (= 0 v_~__unbuffered_p3_EBX~0_10) (= v_~z~0_14 2) (= 2 v_~__unbuffered_p3_EAX~0_10) (= v_~__unbuffered_p1_EAX~0_10 0) (= v_~__unbuffered_p0_EAX~0_16 0))) 1 0) 0) 0 1))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_10, ~z~0=v_~z~0_14, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_30|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_12|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_10, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~z~0=v_~z~0_14, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][49], [111#L19-1true, P0Thread1of1ForFork2InUse, 170#true, 186#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), Black: 172#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 175#(and (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))), Black: 173#(or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)), 31#L838true, 123#L822true, P1Thread1of1ForFork0InUse, 58#L792true, P3Thread1of1ForFork1InUse, 163#true, 92#P0EXITtrue, P2Thread1of1ForFork3InUse]) [2023-11-12 02:05:16,995 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-11-12 02:05:16,995 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-12 02:05:16,995 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-12 02:05:16,996 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-12 02:05:16,996 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([460] L838-->L845: Formula: (let ((.cse5 (not (= (mod v_~x$r_buff0_thd4~0_28 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_115 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd4~0_24 256) 0)))) (let ((.cse2 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_105 256) 0)))) (.cse0 (and .cse5 .cse3)) (.cse1 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_116 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_28) v_~x$r_buff0_thd4~0_27) (= (ite .cse1 v_~x$w_buff0~0_39 (ite .cse2 v_~x$w_buff1~0_38 v_~x~0_55)) v_~x~0_54) (= v_~x$w_buff1_used~0_104 (ite (or .cse2 .cse0) 0 v_~x$w_buff1_used~0_105)) (= v_~x$r_buff1_thd4~0_23 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd4~0_27 256) 0))) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_104 256) 0)))) 0 v_~x$r_buff1_thd4~0_24)) (= (ite .cse1 0 v_~x$w_buff0_used~0_116) v_~x$w_buff0_used~0_115)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_39, ~x$w_buff1~0=v_~x$w_buff1~0_38, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_105, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_28, ~x~0=v_~x~0_55, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_24, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_116} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_39, ~x$w_buff1~0=v_~x$w_buff1~0_38, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_104, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_27, ~x~0=v_~x~0_54, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_23, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_115} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][51], [P0Thread1of1ForFork2InUse, 42#L880true, 170#true, 110#L845true, 186#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), Black: 172#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 175#(and (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))), Black: 173#(or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)), 123#L822true, P1Thread1of1ForFork0InUse, 58#L792true, P3Thread1of1ForFork1InUse, 163#true, 92#P0EXITtrue, P2Thread1of1ForFork3InUse]) [2023-11-12 02:05:16,996 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-11-12 02:05:16,996 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-12 02:05:16,996 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-12 02:05:16,996 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-12 02:05:16,997 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([567] L880-->L19-1: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_12| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_30|) (= (mod v_~main$tmp_guard1~0_8 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_12|) (= v_~main$tmp_guard1~0_8 (ite (= (ite (not (and (= 0 v_~__unbuffered_p3_EBX~0_10) (= v_~z~0_14 2) (= 2 v_~__unbuffered_p3_EAX~0_10) (= v_~__unbuffered_p1_EAX~0_10 0) (= v_~__unbuffered_p0_EAX~0_16 0))) 1 0) 0) 0 1))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_10, ~z~0=v_~z~0_14, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_30|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_12|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_10, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~z~0=v_~z~0_14, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][49], [P0Thread1of1ForFork2InUse, 111#L19-1true, 170#true, 186#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), Black: 172#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 175#(and (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))), Black: 173#(or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)), 39#L770true, 31#L838true, 76#P2EXITtrue, P1Thread1of1ForFork0InUse, 58#L792true, P3Thread1of1ForFork1InUse, 163#true, P2Thread1of1ForFork3InUse]) [2023-11-12 02:05:16,998 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-11-12 02:05:16,998 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-12 02:05:16,998 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-12 02:05:16,998 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-12 02:05:16,999 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([460] L838-->L845: Formula: (let ((.cse5 (not (= (mod v_~x$r_buff0_thd4~0_28 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_115 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd4~0_24 256) 0)))) (let ((.cse2 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_105 256) 0)))) (.cse0 (and .cse5 .cse3)) (.cse1 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_116 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_28) v_~x$r_buff0_thd4~0_27) (= (ite .cse1 v_~x$w_buff0~0_39 (ite .cse2 v_~x$w_buff1~0_38 v_~x~0_55)) v_~x~0_54) (= v_~x$w_buff1_used~0_104 (ite (or .cse2 .cse0) 0 v_~x$w_buff1_used~0_105)) (= v_~x$r_buff1_thd4~0_23 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd4~0_27 256) 0))) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_104 256) 0)))) 0 v_~x$r_buff1_thd4~0_24)) (= (ite .cse1 0 v_~x$w_buff0_used~0_116) v_~x$w_buff0_used~0_115)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_39, ~x$w_buff1~0=v_~x$w_buff1~0_38, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_105, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_28, ~x~0=v_~x~0_55, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_24, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_116} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_39, ~x$w_buff1~0=v_~x$w_buff1~0_38, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_104, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_27, ~x~0=v_~x~0_54, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_23, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_115} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][51], [P0Thread1of1ForFork2InUse, 42#L880true, 170#true, 110#L845true, 186#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), Black: 172#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 175#(and (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))), Black: 173#(or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)), 39#L770true, 76#P2EXITtrue, P1Thread1of1ForFork0InUse, 58#L792true, P3Thread1of1ForFork1InUse, 163#true, P2Thread1of1ForFork3InUse]) [2023-11-12 02:05:16,999 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-11-12 02:05:16,999 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-12 02:05:16,999 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-12 02:05:16,999 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-12 02:05:17,012 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([567] L880-->L19-1: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_12| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_30|) (= (mod v_~main$tmp_guard1~0_8 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_12|) (= v_~main$tmp_guard1~0_8 (ite (= (ite (not (and (= 0 v_~__unbuffered_p3_EBX~0_10) (= v_~z~0_14 2) (= 2 v_~__unbuffered_p3_EAX~0_10) (= v_~__unbuffered_p1_EAX~0_10 0) (= v_~__unbuffered_p0_EAX~0_16 0))) 1 0) 0) 0 1))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_10, ~z~0=v_~z~0_14, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_30|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_12|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_10, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~z~0=v_~z~0_14, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][49], [P0Thread1of1ForFork2InUse, 111#L19-1true, 170#true, 186#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), 109#$Ultimate##0true, Black: 172#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 175#(and (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))), Black: 173#(or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)), 76#P2EXITtrue, 31#L838true, P1Thread1of1ForFork0InUse, P3Thread1of1ForFork1InUse, 92#P0EXITtrue, 163#true, P2Thread1of1ForFork3InUse]) [2023-11-12 02:05:17,012 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-11-12 02:05:17,012 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-12 02:05:17,012 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-12 02:05:17,012 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-12 02:05:17,012 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([460] L838-->L845: Formula: (let ((.cse5 (not (= (mod v_~x$r_buff0_thd4~0_28 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_115 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd4~0_24 256) 0)))) (let ((.cse2 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_105 256) 0)))) (.cse0 (and .cse5 .cse3)) (.cse1 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_116 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_28) v_~x$r_buff0_thd4~0_27) (= (ite .cse1 v_~x$w_buff0~0_39 (ite .cse2 v_~x$w_buff1~0_38 v_~x~0_55)) v_~x~0_54) (= v_~x$w_buff1_used~0_104 (ite (or .cse2 .cse0) 0 v_~x$w_buff1_used~0_105)) (= v_~x$r_buff1_thd4~0_23 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd4~0_27 256) 0))) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_104 256) 0)))) 0 v_~x$r_buff1_thd4~0_24)) (= (ite .cse1 0 v_~x$w_buff0_used~0_116) v_~x$w_buff0_used~0_115)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_39, ~x$w_buff1~0=v_~x$w_buff1~0_38, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_105, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_28, ~x~0=v_~x~0_55, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_24, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_116} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_39, ~x$w_buff1~0=v_~x$w_buff1~0_38, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_104, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_27, ~x~0=v_~x~0_54, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_23, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_115} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][51], [P0Thread1of1ForFork2InUse, 42#L880true, 170#true, 110#L845true, 186#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), 109#$Ultimate##0true, Black: 172#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 175#(and (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))), Black: 173#(or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)), 76#P2EXITtrue, P1Thread1of1ForFork0InUse, P3Thread1of1ForFork1InUse, 92#P0EXITtrue, 163#true, P2Thread1of1ForFork3InUse]) [2023-11-12 02:05:17,012 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-11-12 02:05:17,013 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-12 02:05:17,013 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-12 02:05:17,013 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-12 02:05:17,191 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([567] L880-->L19-1: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_12| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_30|) (= (mod v_~main$tmp_guard1~0_8 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_12|) (= v_~main$tmp_guard1~0_8 (ite (= (ite (not (and (= 0 v_~__unbuffered_p3_EBX~0_10) (= v_~z~0_14 2) (= 2 v_~__unbuffered_p3_EAX~0_10) (= v_~__unbuffered_p1_EAX~0_10 0) (= v_~__unbuffered_p0_EAX~0_16 0))) 1 0) 0) 0 1))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_10, ~z~0=v_~z~0_14, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_30|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_12|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_10, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~z~0=v_~z~0_14, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][49], [111#L19-1true, P0Thread1of1ForFork2InUse, 170#true, 186#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), Black: 172#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 175#(and (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))), Black: 173#(or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)), 31#L838true, 76#P2EXITtrue, P1Thread1of1ForFork0InUse, 58#L792true, P3Thread1of1ForFork1InUse, 163#true, 92#P0EXITtrue, P2Thread1of1ForFork3InUse]) [2023-11-12 02:05:17,191 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-11-12 02:05:17,192 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-12 02:05:17,192 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-12 02:05:17,192 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-12 02:05:17,193 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([460] L838-->L845: Formula: (let ((.cse5 (not (= (mod v_~x$r_buff0_thd4~0_28 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_115 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd4~0_24 256) 0)))) (let ((.cse2 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_105 256) 0)))) (.cse0 (and .cse5 .cse3)) (.cse1 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_116 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_28) v_~x$r_buff0_thd4~0_27) (= (ite .cse1 v_~x$w_buff0~0_39 (ite .cse2 v_~x$w_buff1~0_38 v_~x~0_55)) v_~x~0_54) (= v_~x$w_buff1_used~0_104 (ite (or .cse2 .cse0) 0 v_~x$w_buff1_used~0_105)) (= v_~x$r_buff1_thd4~0_23 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd4~0_27 256) 0))) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_104 256) 0)))) 0 v_~x$r_buff1_thd4~0_24)) (= (ite .cse1 0 v_~x$w_buff0_used~0_116) v_~x$w_buff0_used~0_115)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_39, ~x$w_buff1~0=v_~x$w_buff1~0_38, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_105, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_28, ~x~0=v_~x~0_55, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_24, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_116} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_39, ~x$w_buff1~0=v_~x$w_buff1~0_38, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_104, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_27, ~x~0=v_~x~0_54, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_23, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_115} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][51], [P0Thread1of1ForFork2InUse, 42#L880true, 170#true, 110#L845true, 186#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), Black: 172#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 175#(and (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))), Black: 173#(or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)), 76#P2EXITtrue, P1Thread1of1ForFork0InUse, 58#L792true, P3Thread1of1ForFork1InUse, 163#true, 92#P0EXITtrue, P2Thread1of1ForFork3InUse]) [2023-11-12 02:05:17,193 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-11-12 02:05:17,193 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-12 02:05:17,193 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-12 02:05:17,194 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-12 02:05:17,530 INFO L124 PetriNetUnfolderBase]: 12157/17492 cut-off events. [2023-11-12 02:05:17,531 INFO L125 PetriNetUnfolderBase]: For 10551/11048 co-relation queries the response was YES. [2023-11-12 02:05:17,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44981 conditions, 17492 events. 12157/17492 cut-off events. For 10551/11048 co-relation queries the response was YES. Maximal size of possible extension queue 877. Compared 106390 event pairs, 3250 based on Foata normal form. 872/17747 useless extension candidates. Maximal degree in co-relation 44974. Up to 15269 conditions per place. [2023-11-12 02:05:17,686 INFO L140 encePairwiseOnDemand]: 286/291 looper letters, 42 selfloop transitions, 4 changer transitions 7/61 dead transitions. [2023-11-12 02:05:17,687 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 61 transitions, 334 flow [2023-11-12 02:05:17,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 02:05:17,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-12 02:05:17,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 733 transitions. [2023-11-12 02:05:17,691 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4198167239404353 [2023-11-12 02:05:17,691 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 733 transitions. [2023-11-12 02:05:17,691 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 733 transitions. [2023-11-12 02:05:17,692 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:05:17,692 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 733 transitions. [2023-11-12 02:05:17,694 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 122.16666666666667) internal successors, (733), 6 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:05:17,699 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 291.0) internal successors, (2037), 7 states have internal predecessors, (2037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:05:17,701 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 291.0) internal successors, (2037), 7 states have internal predecessors, (2037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:05:17,701 INFO L175 Difference]: Start difference. First operand has 47 places, 44 transitions, 194 flow. Second operand 6 states and 733 transitions. [2023-11-12 02:05:17,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 61 transitions, 334 flow [2023-11-12 02:05:17,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 61 transitions, 334 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-12 02:05:17,737 INFO L231 Difference]: Finished difference. Result has 51 places, 34 transitions, 142 flow [2023-11-12 02:05:17,737 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=142, PETRI_PLACES=51, PETRI_TRANSITIONS=34} [2023-11-12 02:05:17,739 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -1 predicate places. [2023-11-12 02:05:17,740 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 34 transitions, 142 flow [2023-11-12 02:05:17,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 117.0) internal successors, (702), 6 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:05:17,741 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:05:17,741 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:05:17,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-12 02:05:17,742 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-12 02:05:17,742 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:05:17,742 INFO L85 PathProgramCache]: Analyzing trace with hash -37190235, now seen corresponding path program 1 times [2023-11-12 02:05:17,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:05:17,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646525328] [2023-11-12 02:05:17,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:05:17,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:05:17,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:05:17,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:05:17,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:05:17,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646525328] [2023-11-12 02:05:17,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646525328] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:05:17,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:05:17,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:05:17,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897786470] [2023-11-12 02:05:17,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:05:17,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:05:17,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:05:17,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:05:17,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:05:18,011 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 291 [2023-11-12 02:05:18,012 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 34 transitions, 142 flow. Second operand has 5 states, 5 states have (on average 123.6) internal successors, (618), 5 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:05:18,012 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:05:18,012 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 291 [2023-11-12 02:05:18,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:05:20,672 INFO L124 PetriNetUnfolderBase]: 14489/19886 cut-off events. [2023-11-12 02:05:20,672 INFO L125 PetriNetUnfolderBase]: For 12217/12217 co-relation queries the response was YES. [2023-11-12 02:05:20,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52609 conditions, 19886 events. 14489/19886 cut-off events. For 12217/12217 co-relation queries the response was YES. Maximal size of possible extension queue 643. Compared 103135 event pairs, 3175 based on Foata normal form. 928/20814 useless extension candidates. Maximal degree in co-relation 52601. Up to 8721 conditions per place. [2023-11-12 02:05:20,832 INFO L140 encePairwiseOnDemand]: 283/291 looper letters, 54 selfloop transitions, 7 changer transitions 44/105 dead transitions. [2023-11-12 02:05:20,832 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 105 transitions, 584 flow [2023-11-12 02:05:20,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 02:05:20,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-12 02:05:20,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 946 transitions. [2023-11-12 02:05:20,838 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4644084437898871 [2023-11-12 02:05:20,838 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 946 transitions. [2023-11-12 02:05:20,838 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 946 transitions. [2023-11-12 02:05:20,839 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:05:20,839 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 946 transitions. [2023-11-12 02:05:20,843 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 135.14285714285714) internal successors, (946), 7 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:05:20,849 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 291.0) internal successors, (2328), 8 states have internal predecessors, (2328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:05:20,851 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 291.0) internal successors, (2328), 8 states have internal predecessors, (2328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:05:20,851 INFO L175 Difference]: Start difference. First operand has 51 places, 34 transitions, 142 flow. Second operand 7 states and 946 transitions. [2023-11-12 02:05:20,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 105 transitions, 584 flow [2023-11-12 02:05:20,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 105 transitions, 535 flow, removed 2 selfloop flow, removed 6 redundant places. [2023-11-12 02:05:20,979 INFO L231 Difference]: Finished difference. Result has 55 places, 37 transitions, 179 flow [2023-11-12 02:05:20,979 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=179, PETRI_PLACES=55, PETRI_TRANSITIONS=37} [2023-11-12 02:05:20,982 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 3 predicate places. [2023-11-12 02:05:20,982 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 37 transitions, 179 flow [2023-11-12 02:05:20,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 123.6) internal successors, (618), 5 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:05:20,983 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:05:20,983 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:05:20,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-12 02:05:20,984 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-12 02:05:20,984 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:05:20,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1153001047, now seen corresponding path program 1 times [2023-11-12 02:05:20,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:05:20,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401323776] [2023-11-12 02:05:20,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:05:20,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:05:21,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:05:21,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:05:21,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:05:21,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401323776] [2023-11-12 02:05:21,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401323776] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:05:21,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:05:21,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:05:21,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957148022] [2023-11-12 02:05:21,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:05:21,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:05:21,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:05:21,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:05:21,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:05:21,190 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 291 [2023-11-12 02:05:21,191 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 37 transitions, 179 flow. Second operand has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:05:21,191 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:05:21,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 291 [2023-11-12 02:05:21,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:05:21,849 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([460] L838-->L845: Formula: (let ((.cse5 (not (= (mod v_~x$r_buff0_thd4~0_28 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_115 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd4~0_24 256) 0)))) (let ((.cse2 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_105 256) 0)))) (.cse0 (and .cse5 .cse3)) (.cse1 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_116 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_28) v_~x$r_buff0_thd4~0_27) (= (ite .cse1 v_~x$w_buff0~0_39 (ite .cse2 v_~x$w_buff1~0_38 v_~x~0_55)) v_~x~0_54) (= v_~x$w_buff1_used~0_104 (ite (or .cse2 .cse0) 0 v_~x$w_buff1_used~0_105)) (= v_~x$r_buff1_thd4~0_23 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd4~0_27 256) 0))) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_104 256) 0)))) 0 v_~x$r_buff1_thd4~0_24)) (= (ite .cse1 0 v_~x$w_buff0_used~0_116) v_~x$w_buff0_used~0_115)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_39, ~x$w_buff1~0=v_~x$w_buff1~0_38, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_105, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_28, ~x~0=v_~x~0_55, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_24, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_116} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_39, ~x$w_buff1~0=v_~x$w_buff1~0_38, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_104, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_27, ~x~0=v_~x~0_54, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_23, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_115} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][51], [P0Thread1of1ForFork2InUse, Black: 194#(and (= ~__unbuffered_p3_EAX~0 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0))), 110#L845true, Black: 190#(= ~__unbuffered_p3_EAX~0 0), Black: 192#(or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)), Black: 191#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 186#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), Black: 196#(and (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))), 38#L795true, Black: 172#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 175#(and (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))), Black: 173#(or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)), 90#L873-1true, 39#L770true, 76#P2EXITtrue, P1Thread1of1ForFork0InUse, P3Thread1of1ForFork1InUse, 188#true, 163#true, 204#true, P2Thread1of1ForFork3InUse]) [2023-11-12 02:05:21,849 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-11-12 02:05:21,849 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-12 02:05:21,849 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-12 02:05:21,849 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-12 02:05:21,972 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([460] L838-->L845: Formula: (let ((.cse5 (not (= (mod v_~x$r_buff0_thd4~0_28 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_115 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd4~0_24 256) 0)))) (let ((.cse2 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_105 256) 0)))) (.cse0 (and .cse5 .cse3)) (.cse1 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_116 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_28) v_~x$r_buff0_thd4~0_27) (= (ite .cse1 v_~x$w_buff0~0_39 (ite .cse2 v_~x$w_buff1~0_38 v_~x~0_55)) v_~x~0_54) (= v_~x$w_buff1_used~0_104 (ite (or .cse2 .cse0) 0 v_~x$w_buff1_used~0_105)) (= v_~x$r_buff1_thd4~0_23 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd4~0_27 256) 0))) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_104 256) 0)))) 0 v_~x$r_buff1_thd4~0_24)) (= (ite .cse1 0 v_~x$w_buff0_used~0_116) v_~x$w_buff0_used~0_115)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_39, ~x$w_buff1~0=v_~x$w_buff1~0_38, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_105, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_28, ~x~0=v_~x~0_55, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_24, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_116} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_39, ~x$w_buff1~0=v_~x$w_buff1~0_38, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_104, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_27, ~x~0=v_~x~0_54, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_23, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_115} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][51], [P0Thread1of1ForFork2InUse, Black: 194#(and (= ~__unbuffered_p3_EAX~0 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0))), 110#L845true, Black: 190#(= ~__unbuffered_p3_EAX~0 0), Black: 192#(or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)), Black: 191#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 186#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), Black: 196#(and (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))), 38#L795true, Black: 172#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 175#(and (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))), Black: 173#(or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)), 90#L873-1true, 76#P2EXITtrue, P1Thread1of1ForFork0InUse, P3Thread1of1ForFork1InUse, 188#true, 163#true, 92#P0EXITtrue, 204#true, P2Thread1of1ForFork3InUse]) [2023-11-12 02:05:21,972 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-11-12 02:05:21,972 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-12 02:05:21,972 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-12 02:05:21,972 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-12 02:05:21,974 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([460] L838-->L845: Formula: (let ((.cse5 (not (= (mod v_~x$r_buff0_thd4~0_28 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_115 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd4~0_24 256) 0)))) (let ((.cse2 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_105 256) 0)))) (.cse0 (and .cse5 .cse3)) (.cse1 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_116 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_28) v_~x$r_buff0_thd4~0_27) (= (ite .cse1 v_~x$w_buff0~0_39 (ite .cse2 v_~x$w_buff1~0_38 v_~x~0_55)) v_~x~0_54) (= v_~x$w_buff1_used~0_104 (ite (or .cse2 .cse0) 0 v_~x$w_buff1_used~0_105)) (= v_~x$r_buff1_thd4~0_23 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd4~0_27 256) 0))) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_104 256) 0)))) 0 v_~x$r_buff1_thd4~0_24)) (= (ite .cse1 0 v_~x$w_buff0_used~0_116) v_~x$w_buff0_used~0_115)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_39, ~x$w_buff1~0=v_~x$w_buff1~0_38, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_105, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_28, ~x~0=v_~x~0_55, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_24, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_116} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_39, ~x$w_buff1~0=v_~x$w_buff1~0_38, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_104, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_27, ~x~0=v_~x~0_54, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_23, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_115} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][51], [P0Thread1of1ForFork2InUse, 42#L880true, Black: 194#(and (= ~__unbuffered_p3_EAX~0 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0))), 110#L845true, Black: 190#(= ~__unbuffered_p3_EAX~0 0), Black: 192#(or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)), Black: 191#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 186#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), Black: 196#(and (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))), 38#L795true, Black: 172#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 175#(and (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))), Black: 173#(or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)), 39#L770true, 76#P2EXITtrue, P1Thread1of1ForFork0InUse, P3Thread1of1ForFork1InUse, 188#true, 163#true, 204#true, P2Thread1of1ForFork3InUse]) [2023-11-12 02:05:21,974 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-11-12 02:05:21,974 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-12 02:05:21,974 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-12 02:05:21,977 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-12 02:05:21,977 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([567] L880-->L19-1: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_12| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_30|) (= (mod v_~main$tmp_guard1~0_8 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_12|) (= v_~main$tmp_guard1~0_8 (ite (= (ite (not (and (= 0 v_~__unbuffered_p3_EBX~0_10) (= v_~z~0_14 2) (= 2 v_~__unbuffered_p3_EAX~0_10) (= v_~__unbuffered_p1_EAX~0_10 0) (= v_~__unbuffered_p0_EAX~0_16 0))) 1 0) 0) 0 1))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_10, ~z~0=v_~z~0_14, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_30|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_12|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_10, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~z~0=v_~z~0_14, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][54], [111#L19-1true, P0Thread1of1ForFork2InUse, Black: 194#(and (= ~__unbuffered_p3_EAX~0 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0))), Black: 190#(= ~__unbuffered_p3_EAX~0 0), Black: 192#(or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)), Black: 191#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 186#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), Black: 196#(and (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))), 38#L795true, Black: 172#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 175#(and (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))), Black: 173#(or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)), 39#L770true, 76#P2EXITtrue, 31#L838true, P1Thread1of1ForFork0InUse, P3Thread1of1ForFork1InUse, 188#true, 204#true, 163#true, P2Thread1of1ForFork3InUse]) [2023-11-12 02:05:21,978 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-11-12 02:05:21,978 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-12 02:05:21,978 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-12 02:05:21,978 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-12 02:05:22,060 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([460] L838-->L845: Formula: (let ((.cse5 (not (= (mod v_~x$r_buff0_thd4~0_28 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_115 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd4~0_24 256) 0)))) (let ((.cse2 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_105 256) 0)))) (.cse0 (and .cse5 .cse3)) (.cse1 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_116 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_28) v_~x$r_buff0_thd4~0_27) (= (ite .cse1 v_~x$w_buff0~0_39 (ite .cse2 v_~x$w_buff1~0_38 v_~x~0_55)) v_~x~0_54) (= v_~x$w_buff1_used~0_104 (ite (or .cse2 .cse0) 0 v_~x$w_buff1_used~0_105)) (= v_~x$r_buff1_thd4~0_23 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd4~0_27 256) 0))) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_104 256) 0)))) 0 v_~x$r_buff1_thd4~0_24)) (= (ite .cse1 0 v_~x$w_buff0_used~0_116) v_~x$w_buff0_used~0_115)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_39, ~x$w_buff1~0=v_~x$w_buff1~0_38, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_105, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_28, ~x~0=v_~x~0_55, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_24, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_116} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_39, ~x$w_buff1~0=v_~x$w_buff1~0_38, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_104, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_27, ~x~0=v_~x~0_54, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_23, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_115} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][51], [P0Thread1of1ForFork2InUse, 42#L880true, Black: 194#(and (= ~__unbuffered_p3_EAX~0 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0))), 110#L845true, Black: 190#(= ~__unbuffered_p3_EAX~0 0), Black: 192#(or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)), Black: 191#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 186#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), Black: 196#(and (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))), 38#L795true, Black: 172#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 175#(and (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))), Black: 173#(or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)), 76#P2EXITtrue, P1Thread1of1ForFork0InUse, P3Thread1of1ForFork1InUse, 188#true, 163#true, 92#P0EXITtrue, 204#true, P2Thread1of1ForFork3InUse]) [2023-11-12 02:05:22,061 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-11-12 02:05:22,061 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-12 02:05:22,061 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-12 02:05:22,061 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-12 02:05:22,062 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([567] L880-->L19-1: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_12| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_30|) (= (mod v_~main$tmp_guard1~0_8 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_12|) (= v_~main$tmp_guard1~0_8 (ite (= (ite (not (and (= 0 v_~__unbuffered_p3_EBX~0_10) (= v_~z~0_14 2) (= 2 v_~__unbuffered_p3_EAX~0_10) (= v_~__unbuffered_p1_EAX~0_10 0) (= v_~__unbuffered_p0_EAX~0_16 0))) 1 0) 0) 0 1))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_10, ~z~0=v_~z~0_14, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_30|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_12|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_10, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~z~0=v_~z~0_14, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][54], [P0Thread1of1ForFork2InUse, 111#L19-1true, Black: 194#(and (= ~__unbuffered_p3_EAX~0 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0))), Black: 190#(= ~__unbuffered_p3_EAX~0 0), Black: 192#(or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)), Black: 191#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 186#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), Black: 196#(and (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))), 38#L795true, Black: 172#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 175#(and (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))), Black: 173#(or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)), 76#P2EXITtrue, 31#L838true, P1Thread1of1ForFork0InUse, P3Thread1of1ForFork1InUse, 188#true, 163#true, 92#P0EXITtrue, 204#true, P2Thread1of1ForFork3InUse]) [2023-11-12 02:05:22,062 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-11-12 02:05:22,062 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-12 02:05:22,062 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-12 02:05:22,062 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-12 02:05:22,172 INFO L124 PetriNetUnfolderBase]: 5846/8624 cut-off events. [2023-11-12 02:05:22,172 INFO L125 PetriNetUnfolderBase]: For 7424/7794 co-relation queries the response was YES. [2023-11-12 02:05:22,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22669 conditions, 8624 events. 5846/8624 cut-off events. For 7424/7794 co-relation queries the response was YES. Maximal size of possible extension queue 453. Compared 49250 event pairs, 1389 based on Foata normal form. 280/8619 useless extension candidates. Maximal degree in co-relation 22657. Up to 7271 conditions per place. [2023-11-12 02:05:22,264 INFO L140 encePairwiseOnDemand]: 285/291 looper letters, 43 selfloop transitions, 5 changer transitions 0/58 dead transitions. [2023-11-12 02:05:22,264 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 58 transitions, 346 flow [2023-11-12 02:05:22,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:05:22,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-12 02:05:22,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 433 transitions. [2023-11-12 02:05:22,268 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4959908361970218 [2023-11-12 02:05:22,268 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 433 transitions. [2023-11-12 02:05:22,268 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 433 transitions. [2023-11-12 02:05:22,269 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:05:22,269 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 433 transitions. [2023-11-12 02:05:22,270 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:05:22,273 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 291.0) internal successors, (1164), 4 states have internal predecessors, (1164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:05:22,273 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 291.0) internal successors, (1164), 4 states have internal predecessors, (1164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:05:22,273 INFO L175 Difference]: Start difference. First operand has 55 places, 37 transitions, 179 flow. Second operand 3 states and 433 transitions. [2023-11-12 02:05:22,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 58 transitions, 346 flow [2023-11-12 02:05:22,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 58 transitions, 335 flow, removed 4 selfloop flow, removed 3 redundant places. [2023-11-12 02:05:22,320 INFO L231 Difference]: Finished difference. Result has 52 places, 41 transitions, 201 flow [2023-11-12 02:05:22,320 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=201, PETRI_PLACES=52, PETRI_TRANSITIONS=41} [2023-11-12 02:05:22,324 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 0 predicate places. [2023-11-12 02:05:22,328 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 41 transitions, 201 flow [2023-11-12 02:05:22,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:05:22,329 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:05:22,329 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:05:22,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-12 02:05:22,330 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-12 02:05:22,330 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:05:22,330 INFO L85 PathProgramCache]: Analyzing trace with hash 827802098, now seen corresponding path program 1 times [2023-11-12 02:05:22,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:05:22,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819127668] [2023-11-12 02:05:22,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:05:22,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:05:22,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:05:22,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:05:22,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:05:22,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819127668] [2023-11-12 02:05:22,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819127668] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:05:22,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:05:22,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:05:22,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143830364] [2023-11-12 02:05:22,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:05:22,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:05:22,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:05:22,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:05:22,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:05:22,561 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 291 [2023-11-12 02:05:22,562 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 41 transitions, 201 flow. Second operand has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:05:22,562 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:05:22,563 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 291 [2023-11-12 02:05:22,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:05:23,182 INFO L124 PetriNetUnfolderBase]: 2913/4604 cut-off events. [2023-11-12 02:05:23,182 INFO L125 PetriNetUnfolderBase]: For 2836/2948 co-relation queries the response was YES. [2023-11-12 02:05:23,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13495 conditions, 4604 events. 2913/4604 cut-off events. For 2836/2948 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 25812 event pairs, 589 based on Foata normal form. 304/4802 useless extension candidates. Maximal degree in co-relation 13483. Up to 2234 conditions per place. [2023-11-12 02:05:23,215 INFO L140 encePairwiseOnDemand]: 285/291 looper letters, 58 selfloop transitions, 9 changer transitions 0/77 dead transitions. [2023-11-12 02:05:23,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 77 transitions, 471 flow [2023-11-12 02:05:23,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:05:23,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-12 02:05:23,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 579 transitions. [2023-11-12 02:05:23,218 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49742268041237114 [2023-11-12 02:05:23,218 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 579 transitions. [2023-11-12 02:05:23,218 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 579 transitions. [2023-11-12 02:05:23,219 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:05:23,219 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 579 transitions. [2023-11-12 02:05:23,221 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 144.75) internal successors, (579), 4 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:05:23,224 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 291.0) internal successors, (1455), 5 states have internal predecessors, (1455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:05:23,225 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 291.0) internal successors, (1455), 5 states have internal predecessors, (1455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:05:23,225 INFO L175 Difference]: Start difference. First operand has 52 places, 41 transitions, 201 flow. Second operand 4 states and 579 transitions. [2023-11-12 02:05:23,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 77 transitions, 471 flow [2023-11-12 02:05:23,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 77 transitions, 456 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-11-12 02:05:23,237 INFO L231 Difference]: Finished difference. Result has 53 places, 45 transitions, 242 flow [2023-11-12 02:05:23,237 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=242, PETRI_PLACES=53, PETRI_TRANSITIONS=45} [2023-11-12 02:05:23,238 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 1 predicate places. [2023-11-12 02:05:23,238 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 45 transitions, 242 flow [2023-11-12 02:05:23,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:05:23,238 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:05:23,239 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:05:23,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-12 02:05:23,239 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-12 02:05:23,239 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:05:23,240 INFO L85 PathProgramCache]: Analyzing trace with hash 408037007, now seen corresponding path program 1 times [2023-11-12 02:05:23,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:05:23,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848728913] [2023-11-12 02:05:23,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:05:23,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:05:23,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:05:23,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:05:23,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:05:23,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848728913] [2023-11-12 02:05:23,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848728913] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:05:23,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:05:23,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:05:23,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853866827] [2023-11-12 02:05:23,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:05:23,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:05:23,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:05:23,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:05:23,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:05:23,593 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 291 [2023-11-12 02:05:23,594 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 45 transitions, 242 flow. Second operand has 5 states, 5 states have (on average 123.0) internal successors, (615), 5 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:05:23,594 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:05:23,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 291 [2023-11-12 02:05:23,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:05:24,725 INFO L124 PetriNetUnfolderBase]: 4764/7245 cut-off events. [2023-11-12 02:05:24,725 INFO L125 PetriNetUnfolderBase]: For 9914/9914 co-relation queries the response was YES. [2023-11-12 02:05:24,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24547 conditions, 7245 events. 4764/7245 cut-off events. For 9914/9914 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 39307 event pairs, 515 based on Foata normal form. 129/7374 useless extension candidates. Maximal degree in co-relation 24536. Up to 3346 conditions per place. [2023-11-12 02:05:24,772 INFO L140 encePairwiseOnDemand]: 281/291 looper letters, 111 selfloop transitions, 21 changer transitions 27/159 dead transitions. [2023-11-12 02:05:24,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 159 transitions, 1113 flow [2023-11-12 02:05:24,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 02:05:24,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-12 02:05:24,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 956 transitions. [2023-11-12 02:05:24,778 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4693176239567992 [2023-11-12 02:05:24,778 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 956 transitions. [2023-11-12 02:05:24,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 956 transitions. [2023-11-12 02:05:24,779 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:05:24,780 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 956 transitions. [2023-11-12 02:05:24,783 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 136.57142857142858) internal successors, (956), 7 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:05:24,787 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 291.0) internal successors, (2328), 8 states have internal predecessors, (2328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:05:24,789 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 291.0) internal successors, (2328), 8 states have internal predecessors, (2328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:05:24,789 INFO L175 Difference]: Start difference. First operand has 53 places, 45 transitions, 242 flow. Second operand 7 states and 956 transitions. [2023-11-12 02:05:24,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 159 transitions, 1113 flow [2023-11-12 02:05:24,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 159 transitions, 1055 flow, removed 14 selfloop flow, removed 2 redundant places. [2023-11-12 02:05:24,810 INFO L231 Difference]: Finished difference. Result has 62 places, 57 transitions, 394 flow [2023-11-12 02:05:24,811 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=394, PETRI_PLACES=62, PETRI_TRANSITIONS=57} [2023-11-12 02:05:24,811 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 10 predicate places. [2023-11-12 02:05:24,812 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 57 transitions, 394 flow [2023-11-12 02:05:24,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 123.0) internal successors, (615), 5 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:05:24,812 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:05:24,813 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:05:24,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-12 02:05:24,813 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-12 02:05:24,813 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:05:24,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1719952025, now seen corresponding path program 2 times [2023-11-12 02:05:24,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:05:24,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246272432] [2023-11-12 02:05:24,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:05:24,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:05:24,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:05:25,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:05:25,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:05:25,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246272432] [2023-11-12 02:05:25,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246272432] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:05:25,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:05:25,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:05:25,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212539691] [2023-11-12 02:05:25,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:05:25,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 02:05:25,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:05:25,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 02:05:25,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-12 02:05:25,124 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 291 [2023-11-12 02:05:25,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 57 transitions, 394 flow. Second operand has 6 states, 6 states have (on average 122.33333333333333) internal successors, (734), 6 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:05:25,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:05:25,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 291 [2023-11-12 02:05:25,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:05:26,438 INFO L124 PetriNetUnfolderBase]: 5766/8800 cut-off events. [2023-11-12 02:05:26,438 INFO L125 PetriNetUnfolderBase]: For 20690/20690 co-relation queries the response was YES. [2023-11-12 02:05:26,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33014 conditions, 8800 events. 5766/8800 cut-off events. For 20690/20690 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 49637 event pairs, 707 based on Foata normal form. 90/8890 useless extension candidates. Maximal degree in co-relation 32998. Up to 3174 conditions per place. [2023-11-12 02:05:26,496 INFO L140 encePairwiseOnDemand]: 281/291 looper letters, 122 selfloop transitions, 20 changer transitions 30/172 dead transitions. [2023-11-12 02:05:26,497 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 172 transitions, 1308 flow [2023-11-12 02:05:26,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 02:05:26,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-12 02:05:26,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 958 transitions. [2023-11-12 02:05:26,501 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47029945999018163 [2023-11-12 02:05:26,501 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 958 transitions. [2023-11-12 02:05:26,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 958 transitions. [2023-11-12 02:05:26,503 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:05:26,503 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 958 transitions. [2023-11-12 02:05:26,506 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 136.85714285714286) internal successors, (958), 7 states have internal predecessors, (958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:05:26,511 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 291.0) internal successors, (2328), 8 states have internal predecessors, (2328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:05:26,512 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 291.0) internal successors, (2328), 8 states have internal predecessors, (2328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:05:26,512 INFO L175 Difference]: Start difference. First operand has 62 places, 57 transitions, 394 flow. Second operand 7 states and 958 transitions. [2023-11-12 02:05:26,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 172 transitions, 1308 flow [2023-11-12 02:05:26,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 172 transitions, 1274 flow, removed 17 selfloop flow, removed 2 redundant places. [2023-11-12 02:05:26,634 INFO L231 Difference]: Finished difference. Result has 66 places, 57 transitions, 432 flow [2023-11-12 02:05:26,635 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=386, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=432, PETRI_PLACES=66, PETRI_TRANSITIONS=57} [2023-11-12 02:05:26,635 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 14 predicate places. [2023-11-12 02:05:26,636 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 57 transitions, 432 flow [2023-11-12 02:05:26,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 122.33333333333333) internal successors, (734), 6 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:05:26,636 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:05:26,636 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:05:26,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-12 02:05:26,637 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-12 02:05:26,637 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:05:26,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1990863497, now seen corresponding path program 3 times [2023-11-12 02:05:26,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:05:26,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074938656] [2023-11-12 02:05:26,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:05:26,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:05:26,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:05:26,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:05:26,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:05:26,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074938656] [2023-11-12 02:05:26,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074938656] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:05:26,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:05:26,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:05:26,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455904678] [2023-11-12 02:05:26,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:05:26,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:05:26,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:05:26,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:05:26,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:05:26,852 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 291 [2023-11-12 02:05:26,853 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 57 transitions, 432 flow. Second operand has 5 states, 5 states have (on average 133.6) internal successors, (668), 5 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:05:26,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:05:26,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 291 [2023-11-12 02:05:26,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:05:27,683 INFO L124 PetriNetUnfolderBase]: 2990/4790 cut-off events. [2023-11-12 02:05:27,684 INFO L125 PetriNetUnfolderBase]: For 9519/9628 co-relation queries the response was YES. [2023-11-12 02:05:27,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16542 conditions, 4790 events. 2990/4790 cut-off events. For 9519/9628 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 28066 event pairs, 559 based on Foata normal form. 298/4987 useless extension candidates. Maximal degree in co-relation 16525. Up to 1768 conditions per place. [2023-11-12 02:05:27,724 INFO L140 encePairwiseOnDemand]: 285/291 looper letters, 79 selfloop transitions, 13 changer transitions 2/113 dead transitions. [2023-11-12 02:05:27,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 113 transitions, 944 flow [2023-11-12 02:05:27,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:05:27,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-12 02:05:27,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 723 transitions. [2023-11-12 02:05:27,729 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49690721649484537 [2023-11-12 02:05:27,729 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 723 transitions. [2023-11-12 02:05:27,729 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 723 transitions. [2023-11-12 02:05:27,730 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:05:27,730 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 723 transitions. [2023-11-12 02:05:27,733 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 144.6) internal successors, (723), 5 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:05:27,736 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 291.0) internal successors, (1746), 6 states have internal predecessors, (1746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:05:27,737 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 291.0) internal successors, (1746), 6 states have internal predecessors, (1746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:05:27,737 INFO L175 Difference]: Start difference. First operand has 66 places, 57 transitions, 432 flow. Second operand 5 states and 723 transitions. [2023-11-12 02:05:27,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 113 transitions, 944 flow [2023-11-12 02:05:27,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 113 transitions, 872 flow, removed 2 selfloop flow, removed 5 redundant places. [2023-11-12 02:05:27,760 INFO L231 Difference]: Finished difference. Result has 65 places, 61 transitions, 457 flow [2023-11-12 02:05:27,761 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=389, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=457, PETRI_PLACES=65, PETRI_TRANSITIONS=61} [2023-11-12 02:05:27,761 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 13 predicate places. [2023-11-12 02:05:27,762 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 61 transitions, 457 flow [2023-11-12 02:05:27,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 133.6) internal successors, (668), 5 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:05:27,762 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:05:27,763 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:05:27,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-12 02:05:27,763 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-12 02:05:27,764 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:05:27,764 INFO L85 PathProgramCache]: Analyzing trace with hash -650373562, now seen corresponding path program 1 times [2023-11-12 02:05:27,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:05:27,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221448713] [2023-11-12 02:05:27,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:05:27,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:05:27,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:05:28,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:05:28,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:05:28,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221448713] [2023-11-12 02:05:28,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221448713] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:05:28,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:05:28,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:05:28,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968309579] [2023-11-12 02:05:28,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:05:28,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:05:28,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:05:28,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:05:28,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:05:28,104 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 291 [2023-11-12 02:05:28,106 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 61 transitions, 457 flow. Second operand has 5 states, 5 states have (on average 125.8) internal successors, (629), 5 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:05:28,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:05:28,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 291 [2023-11-12 02:05:28,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:05:29,496 INFO L124 PetriNetUnfolderBase]: 4931/7587 cut-off events. [2023-11-12 02:05:29,497 INFO L125 PetriNetUnfolderBase]: For 21051/21051 co-relation queries the response was YES. [2023-11-12 02:05:29,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29796 conditions, 7587 events. 4931/7587 cut-off events. For 21051/21051 co-relation queries the response was YES. Maximal size of possible extension queue 316. Compared 42447 event pairs, 1151 based on Foata normal form. 16/7603 useless extension candidates. Maximal degree in co-relation 29780. Up to 4138 conditions per place. [2023-11-12 02:05:29,543 INFO L140 encePairwiseOnDemand]: 284/291 looper letters, 73 selfloop transitions, 12 changer transitions 37/122 dead transitions. [2023-11-12 02:05:29,543 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 122 transitions, 1089 flow [2023-11-12 02:05:29,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:05:29,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-12 02:05:29,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 679 transitions. [2023-11-12 02:05:29,547 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2023-11-12 02:05:29,547 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 679 transitions. [2023-11-12 02:05:29,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 679 transitions. [2023-11-12 02:05:29,548 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:05:29,549 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 679 transitions. [2023-11-12 02:05:29,551 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 135.8) internal successors, (679), 5 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:05:29,555 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 291.0) internal successors, (1746), 6 states have internal predecessors, (1746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:05:29,556 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 291.0) internal successors, (1746), 6 states have internal predecessors, (1746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:05:29,556 INFO L175 Difference]: Start difference. First operand has 65 places, 61 transitions, 457 flow. Second operand 5 states and 679 transitions. [2023-11-12 02:05:29,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 122 transitions, 1089 flow [2023-11-12 02:05:29,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 122 transitions, 1023 flow, removed 16 selfloop flow, removed 3 redundant places. [2023-11-12 02:05:29,768 INFO L231 Difference]: Finished difference. Result has 69 places, 55 transitions, 398 flow [2023-11-12 02:05:29,769 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=423, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=398, PETRI_PLACES=69, PETRI_TRANSITIONS=55} [2023-11-12 02:05:29,769 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 17 predicate places. [2023-11-12 02:05:29,769 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 55 transitions, 398 flow [2023-11-12 02:05:29,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 125.8) internal successors, (629), 5 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:05:29,770 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:05:29,770 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:05:29,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-12 02:05:29,771 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-12 02:05:29,771 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:05:29,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1904930227, now seen corresponding path program 1 times [2023-11-12 02:05:29,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:05:29,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430667579] [2023-11-12 02:05:29,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:05:29,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:05:29,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:05:30,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:05:30,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:05:30,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430667579] [2023-11-12 02:05:30,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430667579] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:05:30,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:05:30,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:05:30,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791023547] [2023-11-12 02:05:30,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:05:30,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 02:05:30,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:05:30,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 02:05:30,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-12 02:05:30,613 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 291 [2023-11-12 02:05:30,615 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 55 transitions, 398 flow. Second operand has 6 states, 6 states have (on average 129.5) internal successors, (777), 6 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:05:30,615 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:05:30,615 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 291 [2023-11-12 02:05:30,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:05:32,188 INFO L124 PetriNetUnfolderBase]: 4229/7193 cut-off events. [2023-11-12 02:05:32,189 INFO L125 PetriNetUnfolderBase]: For 13997/14172 co-relation queries the response was YES. [2023-11-12 02:05:32,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25509 conditions, 7193 events. 4229/7193 cut-off events. For 13997/14172 co-relation queries the response was YES. Maximal size of possible extension queue 376. Compared 49031 event pairs, 938 based on Foata normal form. 49/7048 useless extension candidates. Maximal degree in co-relation 25490. Up to 3814 conditions per place. [2023-11-12 02:05:32,241 INFO L140 encePairwiseOnDemand]: 283/291 looper letters, 95 selfloop transitions, 11 changer transitions 64/182 dead transitions. [2023-11-12 02:05:32,241 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 182 transitions, 1485 flow [2023-11-12 02:05:32,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 02:05:32,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-12 02:05:32,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 977 transitions. [2023-11-12 02:05:32,246 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4796269023073147 [2023-11-12 02:05:32,246 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 977 transitions. [2023-11-12 02:05:32,246 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 977 transitions. [2023-11-12 02:05:32,247 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:05:32,248 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 977 transitions. [2023-11-12 02:05:32,251 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 139.57142857142858) internal successors, (977), 7 states have internal predecessors, (977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:05:32,256 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 291.0) internal successors, (2328), 8 states have internal predecessors, (2328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:05:32,257 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 291.0) internal successors, (2328), 8 states have internal predecessors, (2328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:05:32,257 INFO L175 Difference]: Start difference. First operand has 69 places, 55 transitions, 398 flow. Second operand 7 states and 977 transitions. [2023-11-12 02:05:32,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 182 transitions, 1485 flow [2023-11-12 02:05:32,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 182 transitions, 1440 flow, removed 13 selfloop flow, removed 3 redundant places. [2023-11-12 02:05:32,445 INFO L231 Difference]: Finished difference. Result has 75 places, 65 transitions, 475 flow [2023-11-12 02:05:32,445 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=475, PETRI_PLACES=75, PETRI_TRANSITIONS=65} [2023-11-12 02:05:32,446 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 23 predicate places. [2023-11-12 02:05:32,446 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 65 transitions, 475 flow [2023-11-12 02:05:32,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 129.5) internal successors, (777), 6 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:05:32,447 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:05:32,447 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:05:32,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-12 02:05:32,447 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-12 02:05:32,447 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:05:32,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1248463581, now seen corresponding path program 2 times [2023-11-12 02:05:32,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:05:32,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468432520] [2023-11-12 02:05:32,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:05:32,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:05:32,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:05:33,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:05:33,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:05:33,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468432520] [2023-11-12 02:05:33,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468432520] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:05:33,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:05:33,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-12 02:05:33,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768289444] [2023-11-12 02:05:33,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:05:33,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-12 02:05:33,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:05:33,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-12 02:05:33,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-12 02:05:33,620 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 291 [2023-11-12 02:05:33,622 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 65 transitions, 475 flow. Second operand has 8 states, 8 states have (on average 119.0) internal successors, (952), 8 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:05:33,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:05:33,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 291 [2023-11-12 02:05:33,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:05:35,495 INFO L124 PetriNetUnfolderBase]: 5544/8946 cut-off events. [2023-11-12 02:05:35,496 INFO L125 PetriNetUnfolderBase]: For 24130/24130 co-relation queries the response was YES. [2023-11-12 02:05:35,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36839 conditions, 8946 events. 5544/8946 cut-off events. For 24130/24130 co-relation queries the response was YES. Maximal size of possible extension queue 378. Compared 56722 event pairs, 579 based on Foata normal form. 11/8957 useless extension candidates. Maximal degree in co-relation 36817. Up to 2559 conditions per place. [2023-11-12 02:05:35,596 INFO L140 encePairwiseOnDemand]: 280/291 looper letters, 137 selfloop transitions, 43 changer transitions 53/233 dead transitions. [2023-11-12 02:05:35,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 233 transitions, 1983 flow [2023-11-12 02:05:35,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-12 02:05:35,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-12 02:05:35,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1179 transitions. [2023-11-12 02:05:35,602 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45017182130584193 [2023-11-12 02:05:35,602 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1179 transitions. [2023-11-12 02:05:35,602 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1179 transitions. [2023-11-12 02:05:35,603 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:05:35,603 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1179 transitions. [2023-11-12 02:05:35,607 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 131.0) internal successors, (1179), 9 states have internal predecessors, (1179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:05:35,612 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 291.0) internal successors, (2910), 10 states have internal predecessors, (2910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:05:35,613 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 291.0) internal successors, (2910), 10 states have internal predecessors, (2910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:05:35,613 INFO L175 Difference]: Start difference. First operand has 75 places, 65 transitions, 475 flow. Second operand 9 states and 1179 transitions. [2023-11-12 02:05:35,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 233 transitions, 1983 flow [2023-11-12 02:05:35,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 233 transitions, 1936 flow, removed 8 selfloop flow, removed 3 redundant places. [2023-11-12 02:05:35,866 INFO L231 Difference]: Finished difference. Result has 83 places, 88 transitions, 784 flow [2023-11-12 02:05:35,867 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=784, PETRI_PLACES=83, PETRI_TRANSITIONS=88} [2023-11-12 02:05:35,868 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 31 predicate places. [2023-11-12 02:05:35,868 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 88 transitions, 784 flow [2023-11-12 02:05:35,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 119.0) internal successors, (952), 8 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:05:35,869 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:05:35,869 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:05:35,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-12 02:05:35,869 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-12 02:05:35,870 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:05:35,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1709957279, now seen corresponding path program 3 times [2023-11-12 02:05:35,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:05:35,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87566658] [2023-11-12 02:05:35,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:05:35,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:05:35,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:05:36,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:05:36,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:05:36,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87566658] [2023-11-12 02:05:36,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87566658] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:05:36,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:05:36,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:05:36,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909633375] [2023-11-12 02:05:36,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:05:36,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 02:05:36,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:05:36,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 02:05:36,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-12 02:05:36,118 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 291 [2023-11-12 02:05:36,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 88 transitions, 784 flow. Second operand has 6 states, 6 states have (on average 133.5) internal successors, (801), 6 states have internal predecessors, (801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:05:36,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:05:36,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 291 [2023-11-12 02:05:36,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:05:37,119 INFO L124 PetriNetUnfolderBase]: 3479/5807 cut-off events. [2023-11-12 02:05:37,119 INFO L125 PetriNetUnfolderBase]: For 20290/20621 co-relation queries the response was YES. [2023-11-12 02:05:37,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25530 conditions, 5807 events. 3479/5807 cut-off events. For 20290/20621 co-relation queries the response was YES. Maximal size of possible extension queue 353. Compared 38474 event pairs, 356 based on Foata normal form. 182/5838 useless extension candidates. Maximal degree in co-relation 25503. Up to 2293 conditions per place. [2023-11-12 02:05:37,176 INFO L140 encePairwiseOnDemand]: 285/291 looper letters, 93 selfloop transitions, 17 changer transitions 58/177 dead transitions. [2023-11-12 02:05:37,176 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 177 transitions, 1812 flow [2023-11-12 02:05:37,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 02:05:37,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-12 02:05:37,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 853 transitions. [2023-11-12 02:05:37,180 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.488545246277205 [2023-11-12 02:05:37,181 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 853 transitions. [2023-11-12 02:05:37,181 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 853 transitions. [2023-11-12 02:05:37,182 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:05:37,182 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 853 transitions. [2023-11-12 02:05:37,184 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 142.16666666666666) internal successors, (853), 6 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:05:37,188 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 291.0) internal successors, (2037), 7 states have internal predecessors, (2037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:05:37,189 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 291.0) internal successors, (2037), 7 states have internal predecessors, (2037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:05:37,189 INFO L175 Difference]: Start difference. First operand has 83 places, 88 transitions, 784 flow. Second operand 6 states and 853 transitions. [2023-11-12 02:05:37,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 177 transitions, 1812 flow [2023-11-12 02:05:37,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 177 transitions, 1737 flow, removed 11 selfloop flow, removed 5 redundant places. [2023-11-12 02:05:37,418 INFO L231 Difference]: Finished difference. Result has 83 places, 64 transitions, 498 flow [2023-11-12 02:05:37,418 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=725, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=498, PETRI_PLACES=83, PETRI_TRANSITIONS=64} [2023-11-12 02:05:37,419 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 31 predicate places. [2023-11-12 02:05:37,419 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 64 transitions, 498 flow [2023-11-12 02:05:37,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 133.5) internal successors, (801), 6 states have internal predecessors, (801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:05:37,420 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:05:37,420 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:05:37,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-12 02:05:37,421 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-12 02:05:37,421 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:05:37,421 INFO L85 PathProgramCache]: Analyzing trace with hash -686855442, now seen corresponding path program 1 times [2023-11-12 02:05:37,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:05:37,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373599616] [2023-11-12 02:05:37,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:05:37,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:05:37,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:05:38,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:05:38,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:05:38,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373599616] [2023-11-12 02:05:38,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373599616] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:05:38,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:05:38,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-12 02:05:38,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272950868] [2023-11-12 02:05:38,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:05:38,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-12 02:05:38,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:05:38,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-12 02:05:38,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-12 02:05:38,444 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 291 [2023-11-12 02:05:38,445 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 64 transitions, 498 flow. Second operand has 8 states, 8 states have (on average 128.0) internal successors, (1024), 8 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:05:38,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:05:38,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 291 [2023-11-12 02:05:38,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:05:39,181 INFO L124 PetriNetUnfolderBase]: 1476/2527 cut-off events. [2023-11-12 02:05:39,181 INFO L125 PetriNetUnfolderBase]: For 9522/9620 co-relation queries the response was YES. [2023-11-12 02:05:39,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11971 conditions, 2527 events. 1476/2527 cut-off events. For 9522/9620 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 14021 event pairs, 130 based on Foata normal form. 30/2518 useless extension candidates. Maximal degree in co-relation 11947. Up to 1084 conditions per place. [2023-11-12 02:05:39,201 INFO L140 encePairwiseOnDemand]: 283/291 looper letters, 91 selfloop transitions, 14 changer transitions 42/156 dead transitions. [2023-11-12 02:05:39,202 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 156 transitions, 1485 flow [2023-11-12 02:05:39,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-12 02:05:39,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-12 02:05:39,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1072 transitions. [2023-11-12 02:05:39,206 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46048109965635736 [2023-11-12 02:05:39,206 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1072 transitions. [2023-11-12 02:05:39,206 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1072 transitions. [2023-11-12 02:05:39,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:05:39,207 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1072 transitions. [2023-11-12 02:05:39,210 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 134.0) internal successors, (1072), 8 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:05:39,214 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 291.0) internal successors, (2619), 9 states have internal predecessors, (2619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:05:39,215 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 291.0) internal successors, (2619), 9 states have internal predecessors, (2619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:05:39,215 INFO L175 Difference]: Start difference. First operand has 83 places, 64 transitions, 498 flow. Second operand 8 states and 1072 transitions. [2023-11-12 02:05:39,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 156 transitions, 1485 flow [2023-11-12 02:05:39,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 156 transitions, 1205 flow, removed 67 selfloop flow, removed 10 redundant places. [2023-11-12 02:05:39,272 INFO L231 Difference]: Finished difference. Result has 82 places, 70 transitions, 495 flow [2023-11-12 02:05:39,272 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=397, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=495, PETRI_PLACES=82, PETRI_TRANSITIONS=70} [2023-11-12 02:05:39,273 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 30 predicate places. [2023-11-12 02:05:39,273 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 70 transitions, 495 flow [2023-11-12 02:05:39,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 128.0) internal successors, (1024), 8 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:05:39,274 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:05:39,274 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:05:39,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-12 02:05:39,275 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-12 02:05:39,275 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:05:39,275 INFO L85 PathProgramCache]: Analyzing trace with hash 513604376, now seen corresponding path program 2 times [2023-11-12 02:05:39,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:05:39,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341973607] [2023-11-12 02:05:39,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:05:39,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:05:39,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:05:39,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:05:39,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:05:39,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341973607] [2023-11-12 02:05:39,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341973607] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:05:39,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:05:39,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:05:39,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077277554] [2023-11-12 02:05:39,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:05:39,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:05:39,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:05:39,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:05:39,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:05:39,566 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 291 [2023-11-12 02:05:39,567 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 70 transitions, 495 flow. Second operand has 5 states, 5 states have (on average 132.0) internal successors, (660), 5 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:05:39,567 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:05:39,568 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 291 [2023-11-12 02:05:39,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:05:40,162 INFO L124 PetriNetUnfolderBase]: 1851/3117 cut-off events. [2023-11-12 02:05:40,162 INFO L125 PetriNetUnfolderBase]: For 10609/10638 co-relation queries the response was YES. [2023-11-12 02:05:40,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13841 conditions, 3117 events. 1851/3117 cut-off events. For 10609/10638 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 17350 event pairs, 394 based on Foata normal form. 4/3102 useless extension candidates. Maximal degree in co-relation 13816. Up to 1895 conditions per place. [2023-11-12 02:05:40,181 INFO L140 encePairwiseOnDemand]: 287/291 looper letters, 56 selfloop transitions, 1 changer transitions 64/125 dead transitions. [2023-11-12 02:05:40,181 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 125 transitions, 1139 flow [2023-11-12 02:05:40,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:05:40,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-12 02:05:40,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 685 transitions. [2023-11-12 02:05:40,184 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47079037800687284 [2023-11-12 02:05:40,185 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 685 transitions. [2023-11-12 02:05:40,185 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 685 transitions. [2023-11-12 02:05:40,185 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:05:40,186 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 685 transitions. [2023-11-12 02:05:40,188 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 137.0) internal successors, (685), 5 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:05:40,191 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 291.0) internal successors, (1746), 6 states have internal predecessors, (1746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:05:40,191 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 291.0) internal successors, (1746), 6 states have internal predecessors, (1746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:05:40,192 INFO L175 Difference]: Start difference. First operand has 82 places, 70 transitions, 495 flow. Second operand 5 states and 685 transitions. [2023-11-12 02:05:40,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 125 transitions, 1139 flow [2023-11-12 02:05:40,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 125 transitions, 1100 flow, removed 13 selfloop flow, removed 6 redundant places. [2023-11-12 02:05:40,251 INFO L231 Difference]: Finished difference. Result has 80 places, 57 transitions, 386 flow [2023-11-12 02:05:40,251 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=386, PETRI_PLACES=80, PETRI_TRANSITIONS=57} [2023-11-12 02:05:40,252 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 28 predicate places. [2023-11-12 02:05:40,252 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 57 transitions, 386 flow [2023-11-12 02:05:40,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 132.0) internal successors, (660), 5 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:05:40,253 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:05:40,253 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:05:40,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-12 02:05:40,253 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-12 02:05:40,254 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:05:40,254 INFO L85 PathProgramCache]: Analyzing trace with hash -2108894624, now seen corresponding path program 3 times [2023-11-12 02:05:40,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:05:40,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125530366] [2023-11-12 02:05:40,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:05:40,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:05:40,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat