./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix051_power.oepc_power.opt_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 9bd2c7ff 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_798f10f5-172c-4277-9ad3-393ce8e89116/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_798f10f5-172c-4277-9ad3-393ce8e89116/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_798f10f5-172c-4277-9ad3-393ce8e89116/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_798f10f5-172c-4277-9ad3-393ce8e89116/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix051_power.oepc_power.opt_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_798f10f5-172c-4277-9ad3-393ce8e89116/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_798f10f5-172c-4277-9ad3-393ce8e89116/bin/uautomizer-verify-uCwYo4JHxu --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 76dbb78f4fe406633111c7d7e2c1e8bd933a1f67e6e1cf5d4cbd1b0379bfe086 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 08:03:53,852 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 08:03:53,978 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_798f10f5-172c-4277-9ad3-393ce8e89116/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-19 08:03:53,987 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 08:03:53,988 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 08:03:54,029 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 08:03:54,030 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 08:03:54,031 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 08:03:54,032 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 08:03:54,038 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 08:03:54,039 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 08:03:54,040 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 08:03:54,040 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 08:03:54,042 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 08:03:54,043 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 08:03:54,043 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 08:03:54,043 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 08:03:54,044 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 08:03:54,044 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-19 08:03:54,045 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-19 08:03:54,045 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-19 08:03:54,046 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 08:03:54,046 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-19 08:03:54,047 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-19 08:03:54,047 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 08:03:54,049 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 08:03:54,050 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 08:03:54,051 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 08:03:54,051 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 08:03:54,052 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 08:03:54,053 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 08:03:54,054 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 08:03:54,054 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 08:03:54,054 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 08:03:54,054 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 08:03:54,055 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 08:03:54,055 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 08:03:54,055 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 08:03:54,056 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_798f10f5-172c-4277-9ad3-393ce8e89116/bin/uautomizer-verify-uCwYo4JHxu/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_798f10f5-172c-4277-9ad3-393ce8e89116/bin/uautomizer-verify-uCwYo4JHxu 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 -> 76dbb78f4fe406633111c7d7e2c1e8bd933a1f67e6e1cf5d4cbd1b0379bfe086 [2023-11-19 08:03:54,414 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 08:03:54,451 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 08:03:54,455 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 08:03:54,456 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 08:03:54,457 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 08:03:54,459 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_798f10f5-172c-4277-9ad3-393ce8e89116/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/pthread-wmm/mix051_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2023-11-19 08:03:58,088 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 08:03:58,481 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 08:03:58,482 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_798f10f5-172c-4277-9ad3-393ce8e89116/sv-benchmarks/c/pthread-wmm/mix051_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2023-11-19 08:03:58,520 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_798f10f5-172c-4277-9ad3-393ce8e89116/bin/uautomizer-verify-uCwYo4JHxu/data/32a785351/6fcec259df8c401385f99f592554a7d8/FLAGc7bc54dcf [2023-11-19 08:03:58,542 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_798f10f5-172c-4277-9ad3-393ce8e89116/bin/uautomizer-verify-uCwYo4JHxu/data/32a785351/6fcec259df8c401385f99f592554a7d8 [2023-11-19 08:03:58,549 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 08:03:58,552 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 08:03:58,559 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 08:03:58,559 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 08:03:58,566 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 08:03:58,567 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:03:58" (1/1) ... [2023-11-19 08:03:58,568 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a429ec1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:58, skipping insertion in model container [2023-11-19 08:03:58,568 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:03:58" (1/1) ... [2023-11-19 08:03:58,666 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 08:03:59,330 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 08:03:59,344 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 08:03:59,407 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 08:03:59,448 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 08:03:59,448 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 08:03:59,457 INFO L206 MainTranslator]: Completed translation [2023-11-19 08:03:59,457 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:59 WrapperNode [2023-11-19 08:03:59,458 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 08:03:59,459 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 08:03:59,459 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 08:03:59,459 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 08:03:59,467 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:59" (1/1) ... [2023-11-19 08:03:59,487 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:59" (1/1) ... [2023-11-19 08:03:59,540 INFO L138 Inliner]: procedures = 177, calls = 68, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 149 [2023-11-19 08:03:59,541 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 08:03:59,542 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 08:03:59,542 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 08:03:59,542 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 08:03:59,556 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:59" (1/1) ... [2023-11-19 08:03:59,557 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:59" (1/1) ... [2023-11-19 08:03:59,562 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:59" (1/1) ... [2023-11-19 08:03:59,562 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:59" (1/1) ... [2023-11-19 08:03:59,587 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:59" (1/1) ... [2023-11-19 08:03:59,595 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:59" (1/1) ... [2023-11-19 08:03:59,598 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:59" (1/1) ... [2023-11-19 08:03:59,602 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:59" (1/1) ... [2023-11-19 08:03:59,607 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 08:03:59,608 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 08:03:59,609 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 08:03:59,609 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 08:03:59,610 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:59" (1/1) ... [2023-11-19 08:03:59,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 08:03:59,628 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_798f10f5-172c-4277-9ad3-393ce8e89116/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 08:03:59,643 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_798f10f5-172c-4277-9ad3-393ce8e89116/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 08:03:59,647 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_798f10f5-172c-4277-9ad3-393ce8e89116/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 08:03:59,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 08:03:59,681 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-19 08:03:59,682 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 08:03:59,682 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 08:03:59,683 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 08:03:59,683 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-19 08:03:59,683 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-19 08:03:59,683 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-19 08:03:59,684 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-19 08:03:59,684 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-19 08:03:59,684 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-19 08:03:59,684 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-19 08:03:59,692 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-19 08:03:59,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 08:03:59,693 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-19 08:03:59,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 08:03:59,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 08:03:59,698 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-19 08:03:59,939 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 08:03:59,943 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 08:04:00,624 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 08:04:00,826 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 08:04:00,826 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-19 08:04:00,831 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:04:00 BoogieIcfgContainer [2023-11-19 08:04:00,831 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 08:04:00,834 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 08:04:00,835 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 08:04:00,838 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 08:04:00,839 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 08:03:58" (1/3) ... [2023-11-19 08:04:00,839 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d7873a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:04:00, skipping insertion in model container [2023-11-19 08:04:00,840 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:59" (2/3) ... [2023-11-19 08:04:00,840 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d7873a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:04:00, skipping insertion in model container [2023-11-19 08:04:00,840 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:04:00" (3/3) ... [2023-11-19 08:04:00,842 INFO L112 eAbstractionObserver]: Analyzing ICFG mix051_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2023-11-19 08:04:00,865 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 08:04:00,866 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-11-19 08:04:00,866 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-19 08:04:00,943 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-19 08:04:00,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 159 places, 150 transitions, 316 flow [2023-11-19 08:04:01,115 INFO L124 PetriNetUnfolderBase]: 4/146 cut-off events. [2023-11-19 08:04:01,118 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 08:04:01,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 146 events. 4/146 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 120 event pairs, 0 based on Foata normal form. 0/131 useless extension candidates. Maximal degree in co-relation 106. Up to 2 conditions per place. [2023-11-19 08:04:01,126 INFO L82 GeneralOperation]: Start removeDead. Operand has 159 places, 150 transitions, 316 flow [2023-11-19 08:04:01,133 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 155 places, 146 transitions, 304 flow [2023-11-19 08:04:01,137 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-19 08:04:01,149 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 155 places, 146 transitions, 304 flow [2023-11-19 08:04:01,152 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 155 places, 146 transitions, 304 flow [2023-11-19 08:04:01,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 155 places, 146 transitions, 304 flow [2023-11-19 08:04:01,196 INFO L124 PetriNetUnfolderBase]: 4/146 cut-off events. [2023-11-19 08:04:01,196 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 08:04:01,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 146 events. 4/146 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 120 event pairs, 0 based on Foata normal form. 0/131 useless extension candidates. Maximal degree in co-relation 106. Up to 2 conditions per place. [2023-11-19 08:04:01,203 INFO L119 LiptonReduction]: Number of co-enabled transitions 4116 [2023-11-19 08:04:07,251 INFO L134 LiptonReduction]: Checked pairs total: 10312 [2023-11-19 08:04:07,252 INFO L136 LiptonReduction]: Total number of compositions: 140 [2023-11-19 08:04:07,267 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 08:04:07,274 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;@7982f68b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 08:04:07,274 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-11-19 08:04:07,276 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-19 08:04:07,276 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-11-19 08:04:07,276 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 08:04:07,277 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:04:07,277 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-19 08:04:07,278 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 08:04:07,283 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:04:07,283 INFO L85 PathProgramCache]: Analyzing trace with hash 648, now seen corresponding path program 1 times [2023-11-19 08:04:07,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:04:07,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211827380] [2023-11-19 08:04:07,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:04:07,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:04:07,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:04:07,408 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-19 08:04:07,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:04:07,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211827380] [2023-11-19 08:04:07,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211827380] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:04:07,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:04:07,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-19 08:04:07,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920663672] [2023-11-19 08:04:07,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:04:07,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 08:04:07,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:04:07,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 08:04:07,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 08:04:07,453 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 290 [2023-11-19 08:04:07,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 92 flow. Second operand has 2 states, 2 states have (on average 133.5) internal successors, (267), 2 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:07,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:04:07,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 290 [2023-11-19 08:04:07,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:04:09,638 INFO L124 PetriNetUnfolderBase]: 8719/11755 cut-off events. [2023-11-19 08:04:09,638 INFO L125 PetriNetUnfolderBase]: For 55/55 co-relation queries the response was YES. [2023-11-19 08:04:09,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23703 conditions, 11755 events. 8719/11755 cut-off events. For 55/55 co-relation queries the response was YES. Maximal size of possible extension queue 532. Compared 59506 event pairs, 8719 based on Foata normal form. 0/10333 useless extension candidates. Maximal degree in co-relation 23691. Up to 11731 conditions per place. [2023-11-19 08:04:09,748 INFO L140 encePairwiseOnDemand]: 281/290 looper letters, 28 selfloop transitions, 0 changer transitions 0/31 dead transitions. [2023-11-19 08:04:09,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 31 transitions, 130 flow [2023-11-19 08:04:09,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 08:04:09,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-19 08:04:09,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 303 transitions. [2023-11-19 08:04:09,771 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5224137931034483 [2023-11-19 08:04:09,771 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 303 transitions. [2023-11-19 08:04:09,772 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 303 transitions. [2023-11-19 08:04:09,776 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:04:09,779 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 303 transitions. [2023-11-19 08:04:09,786 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 151.5) internal successors, (303), 2 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:09,791 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 290.0) internal successors, (870), 3 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:09,792 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 290.0) internal successors, (870), 3 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:09,794 INFO L175 Difference]: Start difference. First operand has 52 places, 40 transitions, 92 flow. Second operand 2 states and 303 transitions. [2023-11-19 08:04:09,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 31 transitions, 130 flow [2023-11-19 08:04:09,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 31 transitions, 126 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-19 08:04:09,806 INFO L231 Difference]: Finished difference. Result has 41 places, 31 transitions, 70 flow [2023-11-19 08:04:09,809 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, 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-19 08:04:09,813 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -11 predicate places. [2023-11-19 08:04:09,814 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 70 flow [2023-11-19 08:04:09,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 133.5) internal successors, (267), 2 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:09,814 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:04:09,815 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-11-19 08:04:09,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 08:04:09,815 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 08:04:09,816 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:04:09,816 INFO L85 PathProgramCache]: Analyzing trace with hash 637010, now seen corresponding path program 1 times [2023-11-19 08:04:09,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:04:09,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853071928] [2023-11-19 08:04:09,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:04:09,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:04:09,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:04:10,247 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-19 08:04:10,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:04:10,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853071928] [2023-11-19 08:04:10,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853071928] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:04:10,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:04:10,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 08:04:10,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062745446] [2023-11-19 08:04:10,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:04:10,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 08:04:10,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:04:10,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 08:04:10,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 08:04:10,255 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 290 [2023-11-19 08:04:10,256 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:10,256 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:04:10,256 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 290 [2023-11-19 08:04:10,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:04:12,029 INFO L124 PetriNetUnfolderBase]: 6855/9423 cut-off events. [2023-11-19 08:04:12,029 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 08:04:12,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18860 conditions, 9423 events. 6855/9423 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 431. Compared 48168 event pairs, 2603 based on Foata normal form. 0/8779 useless extension candidates. Maximal degree in co-relation 18857. Up to 7399 conditions per place. [2023-11-19 08:04:12,107 INFO L140 encePairwiseOnDemand]: 287/290 looper letters, 45 selfloop transitions, 2 changer transitions 2/52 dead transitions. [2023-11-19 08:04:12,108 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 52 transitions, 216 flow [2023-11-19 08:04:12,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 08:04:12,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 08:04:12,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 446 transitions. [2023-11-19 08:04:12,112 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5126436781609195 [2023-11-19 08:04:12,112 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 446 transitions. [2023-11-19 08:04:12,112 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 446 transitions. [2023-11-19 08:04:12,113 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:04:12,113 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 446 transitions. [2023-11-19 08:04:12,115 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:12,120 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 290.0) internal successors, (1160), 4 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:12,121 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 290.0) internal successors, (1160), 4 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:12,122 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 70 flow. Second operand 3 states and 446 transitions. [2023-11-19 08:04:12,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 52 transitions, 216 flow [2023-11-19 08:04:12,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 52 transitions, 216 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-19 08:04:12,124 INFO L231 Difference]: Finished difference. Result has 42 places, 29 transitions, 70 flow [2023-11-19 08:04:12,125 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, 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-19 08:04:12,126 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -10 predicate places. [2023-11-19 08:04:12,126 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 70 flow [2023-11-19 08:04:12,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:12,127 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:04:12,128 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:04:12,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 08:04:12,128 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 08:04:12,129 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:04:12,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1066163637, now seen corresponding path program 1 times [2023-11-19 08:04:12,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:04:12,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047058310] [2023-11-19 08:04:12,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:04:12,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:04:12,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:04:12,668 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-19 08:04:12,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:04:12,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047058310] [2023-11-19 08:04:12,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047058310] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:04:12,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:04:12,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 08:04:12,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058791560] [2023-11-19 08:04:12,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:04:12,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 08:04:12,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:04:12,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 08:04:12,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 08:04:12,700 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 290 [2023-11-19 08:04:12,701 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:12,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:04:12,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 290 [2023-11-19 08:04:12,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:04:16,856 INFO L124 PetriNetUnfolderBase]: 19634/26499 cut-off events. [2023-11-19 08:04:16,857 INFO L125 PetriNetUnfolderBase]: For 1049/1049 co-relation queries the response was YES. [2023-11-19 08:04:16,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54527 conditions, 26499 events. 19634/26499 cut-off events. For 1049/1049 co-relation queries the response was YES. Maximal size of possible extension queue 880. Compared 142318 event pairs, 7140 based on Foata normal form. 0/25894 useless extension candidates. Maximal degree in co-relation 54523. Up to 16403 conditions per place. [2023-11-19 08:04:17,066 INFO L140 encePairwiseOnDemand]: 282/290 looper letters, 46 selfloop transitions, 7 changer transitions 0/53 dead transitions. [2023-11-19 08:04:17,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 53 transitions, 230 flow [2023-11-19 08:04:17,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 08:04:17,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 08:04:17,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 429 transitions. [2023-11-19 08:04:17,070 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49310344827586206 [2023-11-19 08:04:17,070 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 429 transitions. [2023-11-19 08:04:17,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 429 transitions. [2023-11-19 08:04:17,071 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:04:17,072 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 429 transitions. [2023-11-19 08:04:17,074 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.0) internal successors, (429), 3 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:17,077 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 290.0) internal successors, (1160), 4 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:17,078 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 290.0) internal successors, (1160), 4 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:17,079 INFO L175 Difference]: Start difference. First operand has 42 places, 29 transitions, 70 flow. Second operand 3 states and 429 transitions. [2023-11-19 08:04:17,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 53 transitions, 230 flow [2023-11-19 08:04:17,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 53 transitions, 224 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 08:04:17,083 INFO L231 Difference]: Finished difference. Result has 43 places, 35 transitions, 120 flow [2023-11-19 08:04:17,083 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, 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=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=43, PETRI_TRANSITIONS=35} [2023-11-19 08:04:17,085 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -9 predicate places. [2023-11-19 08:04:17,085 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 35 transitions, 120 flow [2023-11-19 08:04:17,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:17,086 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:04:17,086 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:04:17,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 08:04:17,093 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 08:04:17,094 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:04:17,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1308664018, now seen corresponding path program 1 times [2023-11-19 08:04:17,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:04:17,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419905121] [2023-11-19 08:04:17,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:04:17,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:04:17,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:04:17,462 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-19 08:04:17,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:04:17,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419905121] [2023-11-19 08:04:17,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419905121] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:04:17,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:04:17,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 08:04:17,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574481346] [2023-11-19 08:04:17,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:04:17,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 08:04:17,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:04:17,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 08:04:17,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 08:04:17,481 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 290 [2023-11-19 08:04:17,482 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 35 transitions, 120 flow. Second operand has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:17,483 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:04:17,483 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 290 [2023-11-19 08:04:17,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:04:19,642 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([452] L784-->L791: Formula: (let ((.cse2 (not (= (mod v_~a$w_buff0_used~0_97 256) 0))) (.cse3 (not (= (mod v_~a$r_buff1_thd2~0_18 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd2~0_20 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_98 256) 0)))) (.cse1 (and .cse3 (not (= (mod v_~a$w_buff1_used~0_83 256) 0)))) (.cse4 (and .cse5 .cse2))) (and (= v_~a~0_44 (ite .cse0 v_~a$w_buff0~0_22 (ite .cse1 v_~a$w_buff1~0_25 v_~a~0_45))) (= (ite (or (and (not (= (mod v_~a$r_buff0_thd2~0_19 256) 0)) .cse2) (and .cse3 (not (= (mod v_~a$w_buff1_used~0_82 256) 0)))) 0 v_~a$r_buff1_thd2~0_18) v_~a$r_buff1_thd2~0_17) (= (ite .cse0 0 v_~a$w_buff0_used~0_98) v_~a$w_buff0_used~0_97) (= v_~a$w_buff1_used~0_82 (ite (or .cse1 .cse4) 0 v_~a$w_buff1_used~0_83)) (= v_~a$r_buff0_thd2~0_19 (ite .cse4 0 v_~a$r_buff0_thd2~0_20))))) InVars {~a~0=v_~a~0_45, ~a$w_buff1~0=v_~a$w_buff1~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_18, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_20, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_98, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_83} OutVars{~a~0=v_~a~0_44, ~a$w_buff1~0=v_~a$w_buff1~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_17, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_19, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_97, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_82} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, ~a$w_buff0_used~0, ~a$w_buff1_used~0][30], [P3Thread1of1ForFork1InUse, 162#true, 110#L791true, 77#P2EXITtrue, 41#P3EXITtrue, Black: 171#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))), 115#ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAKtrue, 27#L764true, 175#true, 169#true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork3InUse, P0Thread1of1ForFork2InUse]) [2023-11-19 08:04:19,642 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2023-11-19 08:04:19,643 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-19 08:04:19,643 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-19 08:04:19,643 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-19 08:04:19,677 INFO L124 PetriNetUnfolderBase]: 8888/12940 cut-off events. [2023-11-19 08:04:19,677 INFO L125 PetriNetUnfolderBase]: For 3030/3063 co-relation queries the response was YES. [2023-11-19 08:04:19,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30131 conditions, 12940 events. 8888/12940 cut-off events. For 3030/3063 co-relation queries the response was YES. Maximal size of possible extension queue 692. Compared 77596 event pairs, 1977 based on Foata normal form. 244/12744 useless extension candidates. Maximal degree in co-relation 30126. Up to 11290 conditions per place. [2023-11-19 08:04:19,758 INFO L140 encePairwiseOnDemand]: 284/290 looper letters, 45 selfloop transitions, 5 changer transitions 0/56 dead transitions. [2023-11-19 08:04:19,759 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 56 transitions, 280 flow [2023-11-19 08:04:19,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 08:04:19,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 08:04:19,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 430 transitions. [2023-11-19 08:04:19,761 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4942528735632184 [2023-11-19 08:04:19,762 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 430 transitions. [2023-11-19 08:04:19,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 430 transitions. [2023-11-19 08:04:19,762 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:04:19,762 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 430 transitions. [2023-11-19 08:04:19,764 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:19,766 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 290.0) internal successors, (1160), 4 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:19,767 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 290.0) internal successors, (1160), 4 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:19,768 INFO L175 Difference]: Start difference. First operand has 43 places, 35 transitions, 120 flow. Second operand 3 states and 430 transitions. [2023-11-19 08:04:19,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 56 transitions, 280 flow [2023-11-19 08:04:19,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 56 transitions, 262 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 08:04:19,792 INFO L231 Difference]: Finished difference. Result has 44 places, 39 transitions, 139 flow [2023-11-19 08:04:19,793 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=139, PETRI_PLACES=44, PETRI_TRANSITIONS=39} [2023-11-19 08:04:19,794 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -8 predicate places. [2023-11-19 08:04:19,794 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 39 transitions, 139 flow [2023-11-19 08:04:19,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:19,795 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:04:19,795 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:04:19,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 08:04:19,795 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 08:04:19,796 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:04:19,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1977663250, now seen corresponding path program 1 times [2023-11-19 08:04:19,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:04:19,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549980797] [2023-11-19 08:04:19,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:04:19,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:04:19,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:04:20,092 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-19 08:04:20,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:04:20,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549980797] [2023-11-19 08:04:20,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549980797] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:04:20,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:04:20,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 08:04:20,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716348194] [2023-11-19 08:04:20,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:04:20,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 08:04:20,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:04:20,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 08:04:20,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 08:04:20,117 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 290 [2023-11-19 08:04:20,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 39 transitions, 139 flow. Second operand has 4 states, 4 states have (on average 131.5) internal successors, (526), 4 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:20,119 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:04:20,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 290 [2023-11-19 08:04:20,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:04:20,980 INFO L124 PetriNetUnfolderBase]: 3727/5785 cut-off events. [2023-11-19 08:04:20,980 INFO L125 PetriNetUnfolderBase]: For 1130/1132 co-relation queries the response was YES. [2023-11-19 08:04:20,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15000 conditions, 5785 events. 3727/5785 cut-off events. For 1130/1132 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 33628 event pairs, 825 based on Foata normal form. 332/5813 useless extension candidates. Maximal degree in co-relation 14994. Up to 3037 conditions per place. [2023-11-19 08:04:21,020 INFO L140 encePairwiseOnDemand]: 284/290 looper letters, 60 selfloop transitions, 9 changer transitions 0/75 dead transitions. [2023-11-19 08:04:21,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 75 transitions, 383 flow [2023-11-19 08:04:21,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 08:04:21,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 08:04:21,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 575 transitions. [2023-11-19 08:04:21,024 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4956896551724138 [2023-11-19 08:04:21,024 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 575 transitions. [2023-11-19 08:04:21,024 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 575 transitions. [2023-11-19 08:04:21,025 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:04:21,025 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 575 transitions. [2023-11-19 08:04:21,027 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 143.75) internal successors, (575), 4 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:21,030 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 290.0) internal successors, (1450), 5 states have internal predecessors, (1450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:21,031 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 290.0) internal successors, (1450), 5 states have internal predecessors, (1450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:21,031 INFO L175 Difference]: Start difference. First operand has 44 places, 39 transitions, 139 flow. Second operand 4 states and 575 transitions. [2023-11-19 08:04:21,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 75 transitions, 383 flow [2023-11-19 08:04:21,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 75 transitions, 378 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-19 08:04:21,034 INFO L231 Difference]: Finished difference. Result has 47 places, 43 transitions, 186 flow [2023-11-19 08:04:21,035 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=186, PETRI_PLACES=47, PETRI_TRANSITIONS=43} [2023-11-19 08:04:21,036 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -5 predicate places. [2023-11-19 08:04:21,036 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 43 transitions, 186 flow [2023-11-19 08:04:21,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 131.5) internal successors, (526), 4 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:21,037 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:04:21,037 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:04:21,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 08:04:21,037 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 08:04:21,038 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:04:21,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1648389649, now seen corresponding path program 1 times [2023-11-19 08:04:21,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:04:21,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505914678] [2023-11-19 08:04:21,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:04:21,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:04:21,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:04:21,358 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-19 08:04:21,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:04:21,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505914678] [2023-11-19 08:04:21,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505914678] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:04:21,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:04:21,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 08:04:21,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166943232] [2023-11-19 08:04:21,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:04:21,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 08:04:21,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:04:21,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 08:04:21,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-19 08:04:21,372 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 290 [2023-11-19 08:04:21,373 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 43 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 131.4) internal successors, (657), 5 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:21,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:04:21,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 290 [2023-11-19 08:04:21,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:04:22,155 INFO L124 PetriNetUnfolderBase]: 2384/3686 cut-off events. [2023-11-19 08:04:22,156 INFO L125 PetriNetUnfolderBase]: For 2789/2791 co-relation queries the response was YES. [2023-11-19 08:04:22,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10727 conditions, 3686 events. 2384/3686 cut-off events. For 2789/2791 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 20304 event pairs, 603 based on Foata normal form. 153/3668 useless extension candidates. Maximal degree in co-relation 10720. Up to 1435 conditions per place. [2023-11-19 08:04:22,185 INFO L140 encePairwiseOnDemand]: 284/290 looper letters, 73 selfloop transitions, 13 changer transitions 0/92 dead transitions. [2023-11-19 08:04:22,186 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 92 transitions, 508 flow [2023-11-19 08:04:22,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 08:04:22,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-19 08:04:22,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 718 transitions. [2023-11-19 08:04:22,190 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49517241379310345 [2023-11-19 08:04:22,190 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 718 transitions. [2023-11-19 08:04:22,191 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 718 transitions. [2023-11-19 08:04:22,191 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:04:22,192 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 718 transitions. [2023-11-19 08:04:22,194 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 143.6) internal successors, (718), 5 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:22,199 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 290.0) internal successors, (1740), 6 states have internal predecessors, (1740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:22,200 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 290.0) internal successors, (1740), 6 states have internal predecessors, (1740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:22,200 INFO L175 Difference]: Start difference. First operand has 47 places, 43 transitions, 186 flow. Second operand 5 states and 718 transitions. [2023-11-19 08:04:22,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 92 transitions, 508 flow [2023-11-19 08:04:22,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 92 transitions, 490 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-11-19 08:04:22,208 INFO L231 Difference]: Finished difference. Result has 50 places, 47 transitions, 236 flow [2023-11-19 08:04:22,209 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=236, PETRI_PLACES=50, PETRI_TRANSITIONS=47} [2023-11-19 08:04:22,210 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -2 predicate places. [2023-11-19 08:04:22,210 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 47 transitions, 236 flow [2023-11-19 08:04:22,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 131.4) internal successors, (657), 5 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:22,211 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:04:22,211 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:04:22,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 08:04:22,212 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 08:04:22,212 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:04:22,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1101124413, now seen corresponding path program 1 times [2023-11-19 08:04:22,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:04:22,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766522616] [2023-11-19 08:04:22,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:04:22,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:04:22,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:04:22,944 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-19 08:04:22,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:04:22,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766522616] [2023-11-19 08:04:22,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766522616] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:04:22,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:04:22,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 08:04:22,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799947570] [2023-11-19 08:04:22,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:04:22,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 08:04:22,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:04:22,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 08:04:22,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 08:04:22,989 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 290 [2023-11-19 08:04:22,991 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 47 transitions, 236 flow. Second operand has 5 states, 5 states have (on average 125.6) internal successors, (628), 5 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:22,991 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:04:22,991 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 290 [2023-11-19 08:04:22,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:04:24,603 INFO L124 PetriNetUnfolderBase]: 5192/7683 cut-off events. [2023-11-19 08:04:24,603 INFO L125 PetriNetUnfolderBase]: For 9147/9147 co-relation queries the response was YES. [2023-11-19 08:04:24,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23320 conditions, 7683 events. 5192/7683 cut-off events. For 9147/9147 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 41293 event pairs, 153 based on Foata normal form. 0/7665 useless extension candidates. Maximal degree in co-relation 23312. Up to 2861 conditions per place. [2023-11-19 08:04:24,682 INFO L140 encePairwiseOnDemand]: 275/290 looper letters, 166 selfloop transitions, 52 changer transitions 0/218 dead transitions. [2023-11-19 08:04:24,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 218 transitions, 1500 flow [2023-11-19 08:04:24,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-19 08:04:24,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-19 08:04:24,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1249 transitions. [2023-11-19 08:04:24,693 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.478544061302682 [2023-11-19 08:04:24,693 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1249 transitions. [2023-11-19 08:04:24,693 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1249 transitions. [2023-11-19 08:04:24,694 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:04:24,695 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1249 transitions. [2023-11-19 08:04:24,700 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 138.77777777777777) internal successors, (1249), 9 states have internal predecessors, (1249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:24,706 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 290.0) internal successors, (2900), 10 states have internal predecessors, (2900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:24,708 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 290.0) internal successors, (2900), 10 states have internal predecessors, (2900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:24,708 INFO L175 Difference]: Start difference. First operand has 50 places, 47 transitions, 236 flow. Second operand 9 states and 1249 transitions. [2023-11-19 08:04:24,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 218 transitions, 1500 flow [2023-11-19 08:04:24,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 218 transitions, 1326 flow, removed 40 selfloop flow, removed 3 redundant places. [2023-11-19 08:04:24,820 INFO L231 Difference]: Finished difference. Result has 62 places, 96 transitions, 609 flow [2023-11-19 08:04:24,821 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=609, PETRI_PLACES=62, PETRI_TRANSITIONS=96} [2023-11-19 08:04:24,821 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 10 predicate places. [2023-11-19 08:04:24,822 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 96 transitions, 609 flow [2023-11-19 08:04:24,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 125.6) internal successors, (628), 5 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:24,823 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:04:24,823 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:04:24,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 08:04:24,823 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 08:04:24,824 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:04:24,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1233250599, now seen corresponding path program 2 times [2023-11-19 08:04:24,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:04:24,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188495523] [2023-11-19 08:04:24,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:04:24,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:04:24,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:04:25,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:04:25,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:04:25,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188495523] [2023-11-19 08:04:25,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188495523] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:04:25,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:04:25,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 08:04:25,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077268491] [2023-11-19 08:04:25,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:04:25,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 08:04:25,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:04:25,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 08:04:25,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-19 08:04:25,227 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 290 [2023-11-19 08:04:25,228 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 96 transitions, 609 flow. Second operand has 6 states, 6 states have (on average 131.33333333333334) internal successors, (788), 6 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:25,228 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:04:25,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 290 [2023-11-19 08:04:25,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:04:26,647 INFO L124 PetriNetUnfolderBase]: 4112/6221 cut-off events. [2023-11-19 08:04:26,647 INFO L125 PetriNetUnfolderBase]: For 18675/19130 co-relation queries the response was YES. [2023-11-19 08:04:26,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25997 conditions, 6221 events. 4112/6221 cut-off events. For 18675/19130 co-relation queries the response was YES. Maximal size of possible extension queue 361. Compared 36409 event pairs, 511 based on Foata normal form. 269/6309 useless extension candidates. Maximal degree in co-relation 25982. Up to 2578 conditions per place. [2023-11-19 08:04:26,712 INFO L140 encePairwiseOnDemand]: 284/290 looper letters, 157 selfloop transitions, 17 changer transitions 0/192 dead transitions. [2023-11-19 08:04:26,712 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 192 transitions, 1546 flow [2023-11-19 08:04:26,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 08:04:26,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-19 08:04:26,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 846 transitions. [2023-11-19 08:04:26,717 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4862068965517241 [2023-11-19 08:04:26,718 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 846 transitions. [2023-11-19 08:04:26,718 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 846 transitions. [2023-11-19 08:04:26,719 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:04:26,719 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 846 transitions. [2023-11-19 08:04:26,722 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 141.0) internal successors, (846), 6 states have internal predecessors, (846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:26,726 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 290.0) internal successors, (2030), 7 states have internal predecessors, (2030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:26,727 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 290.0) internal successors, (2030), 7 states have internal predecessors, (2030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:26,728 INFO L175 Difference]: Start difference. First operand has 62 places, 96 transitions, 609 flow. Second operand 6 states and 846 transitions. [2023-11-19 08:04:26,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 192 transitions, 1546 flow [2023-11-19 08:04:26,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 192 transitions, 1540 flow, removed 3 selfloop flow, removed 0 redundant places. [2023-11-19 08:04:26,948 INFO L231 Difference]: Finished difference. Result has 68 places, 91 transitions, 614 flow [2023-11-19 08:04:26,948 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=570, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=614, PETRI_PLACES=68, PETRI_TRANSITIONS=91} [2023-11-19 08:04:26,949 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 16 predicate places. [2023-11-19 08:04:26,949 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 91 transitions, 614 flow [2023-11-19 08:04:26,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 131.33333333333334) internal successors, (788), 6 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:26,950 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:04:26,951 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:04:26,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-19 08:04:26,951 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 08:04:26,951 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:04:26,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1144015376, now seen corresponding path program 1 times [2023-11-19 08:04:26,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:04:26,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653811362] [2023-11-19 08:04:26,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:04:26,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:04:27,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:04:27,746 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-19 08:04:27,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:04:27,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653811362] [2023-11-19 08:04:27,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653811362] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:04:27,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:04:27,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 08:04:27,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448928337] [2023-11-19 08:04:27,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:04:27,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 08:04:27,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:04:27,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 08:04:27,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-19 08:04:27,804 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 290 [2023-11-19 08:04:27,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 91 transitions, 614 flow. Second operand has 6 states, 6 states have (on average 124.5) internal successors, (747), 6 states have internal predecessors, (747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:27,806 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:04:27,806 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 290 [2023-11-19 08:04:27,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:04:29,573 INFO L124 PetriNetUnfolderBase]: 5759/8444 cut-off events. [2023-11-19 08:04:29,573 INFO L125 PetriNetUnfolderBase]: For 26243/26243 co-relation queries the response was YES. [2023-11-19 08:04:29,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38115 conditions, 8444 events. 5759/8444 cut-off events. For 26243/26243 co-relation queries the response was YES. Maximal size of possible extension queue 359. Compared 45320 event pairs, 275 based on Foata normal form. 1/8445 useless extension candidates. Maximal degree in co-relation 38098. Up to 2297 conditions per place. [2023-11-19 08:04:29,662 INFO L140 encePairwiseOnDemand]: 276/290 looper letters, 208 selfloop transitions, 114 changer transitions 0/322 dead transitions. [2023-11-19 08:04:29,662 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 322 transitions, 2822 flow [2023-11-19 08:04:29,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-19 08:04:29,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-11-19 08:04:29,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1739 transitions. [2023-11-19 08:04:29,675 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46127320954907164 [2023-11-19 08:04:29,676 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1739 transitions. [2023-11-19 08:04:29,676 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1739 transitions. [2023-11-19 08:04:29,677 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:04:29,678 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1739 transitions. [2023-11-19 08:04:29,682 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 133.76923076923077) internal successors, (1739), 13 states have internal predecessors, (1739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:29,690 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 290.0) internal successors, (4060), 14 states have internal predecessors, (4060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:29,694 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 290.0) internal successors, (4060), 14 states have internal predecessors, (4060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:29,694 INFO L175 Difference]: Start difference. First operand has 68 places, 91 transitions, 614 flow. Second operand 13 states and 1739 transitions. [2023-11-19 08:04:29,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 322 transitions, 2822 flow [2023-11-19 08:04:29,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 322 transitions, 2610 flow, removed 24 selfloop flow, removed 4 redundant places. [2023-11-19 08:04:29,985 INFO L231 Difference]: Finished difference. Result has 85 places, 166 transitions, 1502 flow [2023-11-19 08:04:29,986 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=564, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1502, PETRI_PLACES=85, PETRI_TRANSITIONS=166} [2023-11-19 08:04:29,986 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 33 predicate places. [2023-11-19 08:04:29,986 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 166 transitions, 1502 flow [2023-11-19 08:04:29,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 124.5) internal successors, (747), 6 states have internal predecessors, (747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:29,987 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:04:29,987 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:04:29,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-19 08:04:29,987 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 08:04:29,988 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:04:29,988 INFO L85 PathProgramCache]: Analyzing trace with hash 176935888, now seen corresponding path program 2 times [2023-11-19 08:04:29,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:04:29,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479900459] [2023-11-19 08:04:29,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:04:29,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:04:30,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:04:31,442 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-19 08:04:31,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:04:31,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479900459] [2023-11-19 08:04:31,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479900459] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:04:31,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:04:31,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 08:04:31,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307524035] [2023-11-19 08:04:31,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:04:31,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-19 08:04:31,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:04:31,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-19 08:04:31,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-19 08:04:31,615 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 290 [2023-11-19 08:04:31,616 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 166 transitions, 1502 flow. Second operand has 8 states, 8 states have (on average 131.0) internal successors, (1048), 8 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:31,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:04:31,617 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 290 [2023-11-19 08:04:31,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:04:33,201 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([452] L784-->L791: Formula: (let ((.cse2 (not (= (mod v_~a$w_buff0_used~0_97 256) 0))) (.cse3 (not (= (mod v_~a$r_buff1_thd2~0_18 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd2~0_20 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_98 256) 0)))) (.cse1 (and .cse3 (not (= (mod v_~a$w_buff1_used~0_83 256) 0)))) (.cse4 (and .cse5 .cse2))) (and (= v_~a~0_44 (ite .cse0 v_~a$w_buff0~0_22 (ite .cse1 v_~a$w_buff1~0_25 v_~a~0_45))) (= (ite (or (and (not (= (mod v_~a$r_buff0_thd2~0_19 256) 0)) .cse2) (and .cse3 (not (= (mod v_~a$w_buff1_used~0_82 256) 0)))) 0 v_~a$r_buff1_thd2~0_18) v_~a$r_buff1_thd2~0_17) (= (ite .cse0 0 v_~a$w_buff0_used~0_98) v_~a$w_buff0_used~0_97) (= v_~a$w_buff1_used~0_82 (ite (or .cse1 .cse4) 0 v_~a$w_buff1_used~0_83)) (= v_~a$r_buff0_thd2~0_19 (ite .cse4 0 v_~a$r_buff0_thd2~0_20))))) InVars {~a~0=v_~a~0_45, ~a$w_buff1~0=v_~a$w_buff1~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_18, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_20, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_98, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_83} OutVars{~a~0=v_~a~0_44, ~a$w_buff1~0=v_~a$w_buff1~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_17, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_19, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_97, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_82} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, ~a$w_buff0_used~0, ~a$w_buff1_used~0][134], [Black: 190#(<= ~__unbuffered_cnt~0 2), Black: 245#(and (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (not (= ~z~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1)), Black: 238#(and (= ~a$w_buff0~0 0) (not (= ~z~0 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0)))), Black: 230#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))), 189#(<= ~__unbuffered_cnt~0 1), Black: 232#(and (= ~a$w_buff0~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0)))), 229#(not (= ~z~0 0)), 263#(and (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (not (= ~a~0 0))) (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd2~0 0) (or (not (= ~a$w_buff0~0 0)) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (= ~a$r_buff1_thd3~0 0) (or (= ~a$r_buff1_thd1~0 (* 256 (div ~a$r_buff1_thd1~0 256))) (= (* 256 (div ~a$w_buff1_used~0 256)) ~a$w_buff1_used~0) (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))))) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 195#(and (<= (div ~a$w_buff0_used~0 256) 0) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd1~0 1)), Black: 199#(and (<= (div ~a$w_buff0_used~0 256) 0) (<= 1 ~a$w_buff0_used~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd1~0 1)), Black: 206#(and (<= (div ~a$w_buff0_used~0 256) 0) (<= 1 ~a$w_buff0_used~0) (not (= ~y~0 0)) (= ~a$r_buff0_thd1~0 1)), Black: 196#(not (= ~y~0 0)), Black: 204#(and (<= (div ~a$w_buff0_used~0 256) 0) (<= 1 ~a$w_buff0_used~0) (not (= ~y~0 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd1~0 1)), Black: 197#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))), 128#L811true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork3InUse, P0Thread1of1ForFork2InUse, 202#(and (not (= ~y~0 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0)))), Black: 222#(<= ~__unbuffered_cnt~0 3), P3Thread1of1ForFork1InUse, 162#true, 110#L791true, 41#P3EXITtrue, Black: 171#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))), 150#L868-3true, 27#L764true, Black: 177#(<= ~__unbuffered_cnt~0 0), Black: 248#(and (not (= ~z~0 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0)))), Black: 240#(and (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (not (= ~z~0 0)) (= ~a$w_buff1~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd1~0 1)), Black: 242#(and (= ~a$w_buff0~0 0) (not (= ~z~0 0))), Black: 234#(and (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd1~0 1))]) [2023-11-19 08:04:33,201 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-11-19 08:04:33,201 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-19 08:04:33,201 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-19 08:04:33,201 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-19 08:04:33,254 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([445] L764-->L771: Formula: (let ((.cse4 (not (= (mod v_~a$w_buff0_used~0_101 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd1~0_23 256) 0))) (.cse3 (not (= (mod v_~a$r_buff1_thd1~0_16 256) 0)))) (let ((.cse1 (and (not (= (mod v_~a$w_buff1_used~0_87 256) 0)) .cse3)) (.cse0 (and (not (= (mod v_~a$w_buff0_used~0_102 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5))) (and (= v_~a~0_48 (ite .cse0 v_~a$w_buff0~0_24 (ite .cse1 v_~a$w_buff1~0_27 v_~a~0_49))) (= (ite (or .cse2 .cse1) 0 v_~a$w_buff1_used~0_87) v_~a$w_buff1_used~0_86) (= v_~a$w_buff0_used~0_101 (ite .cse0 0 v_~a$w_buff0_used~0_102)) (= (ite (or (and (not (= (mod v_~a$w_buff1_used~0_86 256) 0)) .cse3) (and .cse4 (not (= (mod v_~a$r_buff0_thd1~0_22 256) 0)))) 0 v_~a$r_buff1_thd1~0_16) v_~a$r_buff1_thd1~0_15) (= v_~a$r_buff0_thd1~0_22 (ite .cse2 0 v_~a$r_buff0_thd1~0_23))))) InVars {~a~0=v_~a~0_49, ~a$w_buff1~0=v_~a$w_buff1~0_27, ~a$w_buff0~0=v_~a$w_buff0~0_24, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_16, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_102, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_23, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_87} OutVars{~a~0=v_~a~0_48, ~a$w_buff1~0=v_~a$w_buff1~0_27, ~a$w_buff0~0=v_~a$w_buff0~0_24, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_15, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_101, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_22, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_86} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0][56], [Black: 190#(<= ~__unbuffered_cnt~0 2), Black: 245#(and (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (not (= ~z~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1)), Black: 238#(and (= ~a$w_buff0~0 0) (not (= ~z~0 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0)))), Black: 230#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))), 189#(<= ~__unbuffered_cnt~0 1), Black: 232#(and (= ~a$w_buff0~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0)))), 56#L771true, Black: 195#(and (<= (div ~a$w_buff0_used~0 256) 0) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd1~0 1)), Black: 199#(and (<= (div ~a$w_buff0_used~0 256) 0) (<= 1 ~a$w_buff0_used~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd1~0 1)), Black: 206#(and (<= (div ~a$w_buff0_used~0 256) 0) (<= 1 ~a$w_buff0_used~0) (not (= ~y~0 0)) (= ~a$r_buff0_thd1~0 1)), Black: 196#(not (= ~y~0 0)), Black: 204#(and (<= (div ~a$w_buff0_used~0 256) 0) (<= 1 ~a$w_buff0_used~0) (not (= ~y~0 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd1~0 1)), Black: 197#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))), P1Thread1of1ForFork0InUse, P2Thread1of1ForFork3InUse, 202#(and (not (= ~y~0 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0)))), P0Thread1of1ForFork2InUse, Black: 222#(<= ~__unbuffered_cnt~0 3), P3Thread1of1ForFork1InUse, 248#(and (not (= ~z~0 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0)))), 162#true, 110#L791true, 41#P3EXITtrue, 269#(and (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd2~0 0) (or (not (= ~a$w_buff0~0 0)) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (= ~a$r_buff1_thd3~0 0) (or (= ~a$r_buff1_thd1~0 (* 256 (div ~a$r_buff1_thd1~0 256))) (= (* 256 (div ~a$w_buff1_used~0 256)) ~a$w_buff1_used~0) (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))))) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), 149#L804true, Black: 169#true, 150#L868-3true, Black: 177#(<= ~__unbuffered_cnt~0 0), Black: 240#(and (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (not (= ~z~0 0)) (= ~a$w_buff1~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd1~0 1)), Black: 229#(not (= ~z~0 0)), Black: 242#(and (= ~a$w_buff0~0 0) (not (= ~z~0 0))), Black: 234#(and (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd1~0 1))]) [2023-11-19 08:04:33,254 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is not cut-off event [2023-11-19 08:04:33,254 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is not cut-off event [2023-11-19 08:04:33,255 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is not cut-off event [2023-11-19 08:04:33,255 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is not cut-off event [2023-11-19 08:04:33,266 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([445] L764-->L771: Formula: (let ((.cse4 (not (= (mod v_~a$w_buff0_used~0_101 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd1~0_23 256) 0))) (.cse3 (not (= (mod v_~a$r_buff1_thd1~0_16 256) 0)))) (let ((.cse1 (and (not (= (mod v_~a$w_buff1_used~0_87 256) 0)) .cse3)) (.cse0 (and (not (= (mod v_~a$w_buff0_used~0_102 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5))) (and (= v_~a~0_48 (ite .cse0 v_~a$w_buff0~0_24 (ite .cse1 v_~a$w_buff1~0_27 v_~a~0_49))) (= (ite (or .cse2 .cse1) 0 v_~a$w_buff1_used~0_87) v_~a$w_buff1_used~0_86) (= v_~a$w_buff0_used~0_101 (ite .cse0 0 v_~a$w_buff0_used~0_102)) (= (ite (or (and (not (= (mod v_~a$w_buff1_used~0_86 256) 0)) .cse3) (and .cse4 (not (= (mod v_~a$r_buff0_thd1~0_22 256) 0)))) 0 v_~a$r_buff1_thd1~0_16) v_~a$r_buff1_thd1~0_15) (= v_~a$r_buff0_thd1~0_22 (ite .cse2 0 v_~a$r_buff0_thd1~0_23))))) InVars {~a~0=v_~a~0_49, ~a$w_buff1~0=v_~a$w_buff1~0_27, ~a$w_buff0~0=v_~a$w_buff0~0_24, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_16, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_102, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_23, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_87} OutVars{~a~0=v_~a~0_48, ~a$w_buff1~0=v_~a$w_buff1~0_27, ~a$w_buff0~0=v_~a$w_buff0~0_24, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_15, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_101, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_22, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_86} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0][56], [Black: 245#(and (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (not (= ~z~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1)), Black: 238#(and (= ~a$w_buff0~0 0) (not (= ~z~0 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0)))), Black: 230#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))), Black: 232#(and (= ~a$w_buff0~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0)))), 190#(<= ~__unbuffered_cnt~0 2), 56#L771true, Black: 195#(and (<= (div ~a$w_buff0_used~0 256) 0) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd1~0 1)), Black: 199#(and (<= (div ~a$w_buff0_used~0 256) 0) (<= 1 ~a$w_buff0_used~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd1~0 1)), Black: 206#(and (<= (div ~a$w_buff0_used~0 256) 0) (<= 1 ~a$w_buff0_used~0) (not (= ~y~0 0)) (= ~a$r_buff0_thd1~0 1)), Black: 196#(not (= ~y~0 0)), Black: 204#(and (<= (div ~a$w_buff0_used~0 256) 0) (<= 1 ~a$w_buff0_used~0) (not (= ~y~0 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd1~0 1)), Black: 197#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))), P1Thread1of1ForFork0InUse, P2Thread1of1ForFork3InUse, P0Thread1of1ForFork2InUse, 202#(and (not (= ~y~0 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0)))), Black: 222#(<= ~__unbuffered_cnt~0 3), P3Thread1of1ForFork1InUse, 248#(and (not (= ~z~0 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0)))), 162#true, 41#P3EXITtrue, 269#(and (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd2~0 0) (or (not (= ~a$w_buff0~0 0)) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (= ~a$r_buff1_thd3~0 0) (or (= ~a$r_buff1_thd1~0 (* 256 (div ~a$r_buff1_thd1~0 256))) (= (* 256 (div ~a$w_buff1_used~0 256)) ~a$w_buff1_used~0) (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))))) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), 149#L804true, 43#P1EXITtrue, Black: 169#true, 150#L868-3true, Black: 177#(<= ~__unbuffered_cnt~0 0), Black: 183#(<= ~__unbuffered_cnt~0 1), Black: 240#(and (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (not (= ~z~0 0)) (= ~a$w_buff1~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd1~0 1)), Black: 229#(not (= ~z~0 0)), Black: 242#(and (= ~a$w_buff0~0 0) (not (= ~z~0 0))), Black: 234#(and (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd1~0 1))]) [2023-11-19 08:04:33,266 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-11-19 08:04:33,266 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-19 08:04:33,266 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-19 08:04:33,266 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-19 08:04:33,268 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([452] L784-->L791: Formula: (let ((.cse2 (not (= (mod v_~a$w_buff0_used~0_97 256) 0))) (.cse3 (not (= (mod v_~a$r_buff1_thd2~0_18 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd2~0_20 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_98 256) 0)))) (.cse1 (and .cse3 (not (= (mod v_~a$w_buff1_used~0_83 256) 0)))) (.cse4 (and .cse5 .cse2))) (and (= v_~a~0_44 (ite .cse0 v_~a$w_buff0~0_22 (ite .cse1 v_~a$w_buff1~0_25 v_~a~0_45))) (= (ite (or (and (not (= (mod v_~a$r_buff0_thd2~0_19 256) 0)) .cse2) (and .cse3 (not (= (mod v_~a$w_buff1_used~0_82 256) 0)))) 0 v_~a$r_buff1_thd2~0_18) v_~a$r_buff1_thd2~0_17) (= (ite .cse0 0 v_~a$w_buff0_used~0_98) v_~a$w_buff0_used~0_97) (= v_~a$w_buff1_used~0_82 (ite (or .cse1 .cse4) 0 v_~a$w_buff1_used~0_83)) (= v_~a$r_buff0_thd2~0_19 (ite .cse4 0 v_~a$r_buff0_thd2~0_20))))) InVars {~a~0=v_~a~0_45, ~a$w_buff1~0=v_~a$w_buff1~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_18, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_20, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_98, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_83} OutVars{~a~0=v_~a~0_44, ~a$w_buff1~0=v_~a$w_buff1~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_17, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_19, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_97, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_82} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, ~a$w_buff0_used~0, ~a$w_buff1_used~0][134], [Black: 245#(and (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (not (= ~z~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1)), Black: 238#(and (= ~a$w_buff0~0 0) (not (= ~z~0 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0)))), Black: 230#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))), Black: 232#(and (= ~a$w_buff0~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0)))), 229#(not (= ~z~0 0)), 190#(<= ~__unbuffered_cnt~0 2), 263#(and (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (not (= ~a~0 0))) (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd2~0 0) (or (not (= ~a$w_buff0~0 0)) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (= ~a$r_buff1_thd3~0 0) (or (= ~a$r_buff1_thd1~0 (* 256 (div ~a$r_buff1_thd1~0 256))) (= (* 256 (div ~a$w_buff1_used~0 256)) ~a$w_buff1_used~0) (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))))) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 195#(and (<= (div ~a$w_buff0_used~0 256) 0) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd1~0 1)), Black: 199#(and (<= (div ~a$w_buff0_used~0 256) 0) (<= 1 ~a$w_buff0_used~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd1~0 1)), Black: 206#(and (<= (div ~a$w_buff0_used~0 256) 0) (<= 1 ~a$w_buff0_used~0) (not (= ~y~0 0)) (= ~a$r_buff0_thd1~0 1)), Black: 196#(not (= ~y~0 0)), Black: 204#(and (<= (div ~a$w_buff0_used~0 256) 0) (<= 1 ~a$w_buff0_used~0) (not (= ~y~0 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd1~0 1)), Black: 197#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))), P1Thread1of1ForFork0InUse, P2Thread1of1ForFork3InUse, P0Thread1of1ForFork2InUse, 202#(and (not (= ~y~0 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0)))), Black: 222#(<= ~__unbuffered_cnt~0 3), P3Thread1of1ForFork1InUse, 162#true, 110#L791true, 77#P2EXITtrue, 41#P3EXITtrue, Black: 171#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))), 150#L868-3true, 27#L764true, Black: 177#(<= ~__unbuffered_cnt~0 0), Black: 183#(<= ~__unbuffered_cnt~0 1), Black: 248#(and (not (= ~z~0 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0)))), Black: 240#(and (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (not (= ~z~0 0)) (= ~a$w_buff1~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd1~0 1)), Black: 242#(and (= ~a$w_buff0~0 0) (not (= ~z~0 0))), Black: 234#(and (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd1~0 1))]) [2023-11-19 08:04:33,268 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-11-19 08:04:33,269 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-19 08:04:33,269 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-19 08:04:33,269 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-19 08:04:33,294 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([452] L784-->L791: Formula: (let ((.cse2 (not (= (mod v_~a$w_buff0_used~0_97 256) 0))) (.cse3 (not (= (mod v_~a$r_buff1_thd2~0_18 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd2~0_20 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_98 256) 0)))) (.cse1 (and .cse3 (not (= (mod v_~a$w_buff1_used~0_83 256) 0)))) (.cse4 (and .cse5 .cse2))) (and (= v_~a~0_44 (ite .cse0 v_~a$w_buff0~0_22 (ite .cse1 v_~a$w_buff1~0_25 v_~a~0_45))) (= (ite (or (and (not (= (mod v_~a$r_buff0_thd2~0_19 256) 0)) .cse2) (and .cse3 (not (= (mod v_~a$w_buff1_used~0_82 256) 0)))) 0 v_~a$r_buff1_thd2~0_18) v_~a$r_buff1_thd2~0_17) (= (ite .cse0 0 v_~a$w_buff0_used~0_98) v_~a$w_buff0_used~0_97) (= v_~a$w_buff1_used~0_82 (ite (or .cse1 .cse4) 0 v_~a$w_buff1_used~0_83)) (= v_~a$r_buff0_thd2~0_19 (ite .cse4 0 v_~a$r_buff0_thd2~0_20))))) InVars {~a~0=v_~a~0_45, ~a$w_buff1~0=v_~a$w_buff1~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_18, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_20, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_98, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_83} OutVars{~a~0=v_~a~0_44, ~a$w_buff1~0=v_~a$w_buff1~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_17, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_19, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_97, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_82} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, ~a$w_buff0_used~0, ~a$w_buff1_used~0][55], [Black: 190#(<= ~__unbuffered_cnt~0 2), Black: 245#(and (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (not (= ~z~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1)), Black: 238#(and (= ~a$w_buff0~0 0) (not (= ~z~0 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0)))), Black: 230#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))), Black: 232#(and (= ~a$w_buff0~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0)))), 189#(<= ~__unbuffered_cnt~0 1), 229#(not (= ~z~0 0)), Black: 195#(and (<= (div ~a$w_buff0_used~0 256) 0) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd1~0 1)), Black: 199#(and (<= (div ~a$w_buff0_used~0 256) 0) (<= 1 ~a$w_buff0_used~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd1~0 1)), Black: 206#(and (<= (div ~a$w_buff0_used~0 256) 0) (<= 1 ~a$w_buff0_used~0) (not (= ~y~0 0)) (= ~a$r_buff0_thd1~0 1)), Black: 196#(not (= ~y~0 0)), Black: 204#(and (<= (div ~a$w_buff0_used~0 256) 0) (<= 1 ~a$w_buff0_used~0) (not (= ~y~0 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd1~0 1)), Black: 197#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))), 128#L811true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork3InUse, 202#(and (not (= ~y~0 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0)))), P0Thread1of1ForFork2InUse, Black: 222#(<= ~__unbuffered_cnt~0 3), P3Thread1of1ForFork1InUse, 162#true, 110#L791true, 269#(and (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd2~0 0) (or (not (= ~a$w_buff0~0 0)) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (= ~a$r_buff1_thd3~0 0) (or (= ~a$r_buff1_thd1~0 (* 256 (div ~a$r_buff1_thd1~0 256))) (= (* 256 (div ~a$w_buff1_used~0 256)) ~a$w_buff1_used~0) (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))))) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 171#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))), 150#L868-3true, 25#L844true, Black: 177#(<= ~__unbuffered_cnt~0 0), Black: 248#(and (not (= ~z~0 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0)))), 93#P0EXITtrue, Black: 240#(and (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (not (= ~z~0 0)) (= ~a$w_buff1~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd1~0 1)), Black: 242#(and (= ~a$w_buff0~0 0) (not (= ~z~0 0))), Black: 234#(and (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd1~0 1))]) [2023-11-19 08:04:33,294 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is not cut-off event [2023-11-19 08:04:33,294 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2023-11-19 08:04:33,294 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2023-11-19 08:04:33,294 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2023-11-19 08:04:33,305 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([452] L784-->L791: Formula: (let ((.cse2 (not (= (mod v_~a$w_buff0_used~0_97 256) 0))) (.cse3 (not (= (mod v_~a$r_buff1_thd2~0_18 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd2~0_20 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_98 256) 0)))) (.cse1 (and .cse3 (not (= (mod v_~a$w_buff1_used~0_83 256) 0)))) (.cse4 (and .cse5 .cse2))) (and (= v_~a~0_44 (ite .cse0 v_~a$w_buff0~0_22 (ite .cse1 v_~a$w_buff1~0_25 v_~a~0_45))) (= (ite (or (and (not (= (mod v_~a$r_buff0_thd2~0_19 256) 0)) .cse2) (and .cse3 (not (= (mod v_~a$w_buff1_used~0_82 256) 0)))) 0 v_~a$r_buff1_thd2~0_18) v_~a$r_buff1_thd2~0_17) (= (ite .cse0 0 v_~a$w_buff0_used~0_98) v_~a$w_buff0_used~0_97) (= v_~a$w_buff1_used~0_82 (ite (or .cse1 .cse4) 0 v_~a$w_buff1_used~0_83)) (= v_~a$r_buff0_thd2~0_19 (ite .cse4 0 v_~a$r_buff0_thd2~0_20))))) InVars {~a~0=v_~a~0_45, ~a$w_buff1~0=v_~a$w_buff1~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_18, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_20, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_98, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_83} OutVars{~a~0=v_~a~0_44, ~a$w_buff1~0=v_~a$w_buff1~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_17, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_19, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_97, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_82} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, ~a$w_buff0_used~0, ~a$w_buff1_used~0][55], [Black: 245#(and (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (not (= ~z~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1)), Black: 238#(and (= ~a$w_buff0~0 0) (not (= ~z~0 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0)))), Black: 230#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))), Black: 232#(and (= ~a$w_buff0~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0)))), 229#(not (= ~z~0 0)), 190#(<= ~__unbuffered_cnt~0 2), Black: 195#(and (<= (div ~a$w_buff0_used~0 256) 0) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd1~0 1)), Black: 199#(and (<= (div ~a$w_buff0_used~0 256) 0) (<= 1 ~a$w_buff0_used~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd1~0 1)), Black: 206#(and (<= (div ~a$w_buff0_used~0 256) 0) (<= 1 ~a$w_buff0_used~0) (not (= ~y~0 0)) (= ~a$r_buff0_thd1~0 1)), Black: 196#(not (= ~y~0 0)), Black: 204#(and (<= (div ~a$w_buff0_used~0 256) 0) (<= 1 ~a$w_buff0_used~0) (not (= ~y~0 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd1~0 1)), Black: 197#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))), P1Thread1of1ForFork0InUse, P2Thread1of1ForFork3InUse, 202#(and (not (= ~y~0 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0)))), P0Thread1of1ForFork2InUse, Black: 222#(<= ~__unbuffered_cnt~0 3), P3Thread1of1ForFork1InUse, 162#true, 110#L791true, 77#P2EXITtrue, 269#(and (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd2~0 0) (or (not (= ~a$w_buff0~0 0)) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (= ~a$r_buff1_thd3~0 0) (or (= ~a$r_buff1_thd1~0 (* 256 (div ~a$r_buff1_thd1~0 256))) (= (* 256 (div ~a$w_buff1_used~0 256)) ~a$w_buff1_used~0) (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))))) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 171#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))), 150#L868-3true, 25#L844true, Black: 177#(<= ~__unbuffered_cnt~0 0), Black: 183#(<= ~__unbuffered_cnt~0 1), Black: 248#(and (not (= ~z~0 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0)))), 93#P0EXITtrue, Black: 240#(and (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (not (= ~z~0 0)) (= ~a$w_buff1~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd1~0 1)), Black: 242#(and (= ~a$w_buff0~0 0) (not (= ~z~0 0))), Black: 234#(and (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd1~0 1))]) [2023-11-19 08:04:33,305 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-11-19 08:04:33,306 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-19 08:04:33,306 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-19 08:04:33,306 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-19 08:04:33,307 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([452] L784-->L791: Formula: (let ((.cse2 (not (= (mod v_~a$w_buff0_used~0_97 256) 0))) (.cse3 (not (= (mod v_~a$r_buff1_thd2~0_18 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd2~0_20 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_98 256) 0)))) (.cse1 (and .cse3 (not (= (mod v_~a$w_buff1_used~0_83 256) 0)))) (.cse4 (and .cse5 .cse2))) (and (= v_~a~0_44 (ite .cse0 v_~a$w_buff0~0_22 (ite .cse1 v_~a$w_buff1~0_25 v_~a~0_45))) (= (ite (or (and (not (= (mod v_~a$r_buff0_thd2~0_19 256) 0)) .cse2) (and .cse3 (not (= (mod v_~a$w_buff1_used~0_82 256) 0)))) 0 v_~a$r_buff1_thd2~0_18) v_~a$r_buff1_thd2~0_17) (= (ite .cse0 0 v_~a$w_buff0_used~0_98) v_~a$w_buff0_used~0_97) (= v_~a$w_buff1_used~0_82 (ite (or .cse1 .cse4) 0 v_~a$w_buff1_used~0_83)) (= v_~a$r_buff0_thd2~0_19 (ite .cse4 0 v_~a$r_buff0_thd2~0_20))))) InVars {~a~0=v_~a~0_45, ~a$w_buff1~0=v_~a$w_buff1~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_18, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_20, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_98, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_83} OutVars{~a~0=v_~a~0_44, ~a$w_buff1~0=v_~a$w_buff1~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_17, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_19, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_97, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_82} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, ~a$w_buff0_used~0, ~a$w_buff1_used~0][55], [Black: 245#(and (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (not (= ~z~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1)), Black: 238#(and (= ~a$w_buff0~0 0) (not (= ~z~0 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0)))), Black: 230#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))), Black: 232#(and (= ~a$w_buff0~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0)))), 229#(not (= ~z~0 0)), 190#(<= ~__unbuffered_cnt~0 2), Black: 195#(and (<= (div ~a$w_buff0_used~0 256) 0) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd1~0 1)), Black: 199#(and (<= (div ~a$w_buff0_used~0 256) 0) (<= 1 ~a$w_buff0_used~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd1~0 1)), Black: 206#(and (<= (div ~a$w_buff0_used~0 256) 0) (<= 1 ~a$w_buff0_used~0) (not (= ~y~0 0)) (= ~a$r_buff0_thd1~0 1)), Black: 196#(not (= ~y~0 0)), Black: 204#(and (<= (div ~a$w_buff0_used~0 256) 0) (<= 1 ~a$w_buff0_used~0) (not (= ~y~0 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd1~0 1)), Black: 197#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))), 128#L811true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork3InUse, 202#(and (not (= ~y~0 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0)))), P0Thread1of1ForFork2InUse, Black: 222#(<= ~__unbuffered_cnt~0 3), P3Thread1of1ForFork1InUse, 162#true, 110#L791true, 41#P3EXITtrue, 269#(and (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd2~0 0) (or (not (= ~a$w_buff0~0 0)) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (= ~a$r_buff1_thd3~0 0) (or (= ~a$r_buff1_thd1~0 (* 256 (div ~a$r_buff1_thd1~0 256))) (= (* 256 (div ~a$w_buff1_used~0 256)) ~a$w_buff1_used~0) (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))))) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 171#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))), 150#L868-3true, Black: 177#(<= ~__unbuffered_cnt~0 0), Black: 183#(<= ~__unbuffered_cnt~0 1), Black: 248#(and (not (= ~z~0 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0)))), 93#P0EXITtrue, Black: 240#(and (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (not (= ~z~0 0)) (= ~a$w_buff1~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd1~0 1)), Black: 242#(and (= ~a$w_buff0~0 0) (not (= ~z~0 0))), Black: 234#(and (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd1~0 1))]) [2023-11-19 08:04:33,307 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-11-19 08:04:33,307 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-19 08:04:33,307 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-19 08:04:33,307 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-19 08:04:33,308 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([452] L784-->L791: Formula: (let ((.cse2 (not (= (mod v_~a$w_buff0_used~0_97 256) 0))) (.cse3 (not (= (mod v_~a$r_buff1_thd2~0_18 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd2~0_20 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_98 256) 0)))) (.cse1 (and .cse3 (not (= (mod v_~a$w_buff1_used~0_83 256) 0)))) (.cse4 (and .cse5 .cse2))) (and (= v_~a~0_44 (ite .cse0 v_~a$w_buff0~0_22 (ite .cse1 v_~a$w_buff1~0_25 v_~a~0_45))) (= (ite (or (and (not (= (mod v_~a$r_buff0_thd2~0_19 256) 0)) .cse2) (and .cse3 (not (= (mod v_~a$w_buff1_used~0_82 256) 0)))) 0 v_~a$r_buff1_thd2~0_18) v_~a$r_buff1_thd2~0_17) (= (ite .cse0 0 v_~a$w_buff0_used~0_98) v_~a$w_buff0_used~0_97) (= v_~a$w_buff1_used~0_82 (ite (or .cse1 .cse4) 0 v_~a$w_buff1_used~0_83)) (= v_~a$r_buff0_thd2~0_19 (ite .cse4 0 v_~a$r_buff0_thd2~0_20))))) InVars {~a~0=v_~a~0_45, ~a$w_buff1~0=v_~a$w_buff1~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_18, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_20, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_98, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_83} OutVars{~a~0=v_~a~0_44, ~a$w_buff1~0=v_~a$w_buff1~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_17, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_19, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_97, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_82} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, ~a$w_buff0_used~0, ~a$w_buff1_used~0][55], [Black: 245#(and (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (not (= ~z~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1)), Black: 238#(and (= ~a$w_buff0~0 0) (not (= ~z~0 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0)))), Black: 230#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))), Black: 232#(and (= ~a$w_buff0~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0)))), 229#(not (= ~z~0 0)), 190#(<= ~__unbuffered_cnt~0 2), 56#L771true, Black: 195#(and (<= (div ~a$w_buff0_used~0 256) 0) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd1~0 1)), Black: 199#(and (<= (div ~a$w_buff0_used~0 256) 0) (<= 1 ~a$w_buff0_used~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd1~0 1)), Black: 206#(and (<= (div ~a$w_buff0_used~0 256) 0) (<= 1 ~a$w_buff0_used~0) (not (= ~y~0 0)) (= ~a$r_buff0_thd1~0 1)), Black: 196#(not (= ~y~0 0)), Black: 204#(and (<= (div ~a$w_buff0_used~0 256) 0) (<= 1 ~a$w_buff0_used~0) (not (= ~y~0 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd1~0 1)), Black: 197#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))), P1Thread1of1ForFork0InUse, P2Thread1of1ForFork3InUse, 202#(and (not (= ~y~0 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0)))), P0Thread1of1ForFork2InUse, Black: 222#(<= ~__unbuffered_cnt~0 3), P3Thread1of1ForFork1InUse, 162#true, 110#L791true, 77#P2EXITtrue, 41#P3EXITtrue, 269#(and (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd2~0 0) (or (not (= ~a$w_buff0~0 0)) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (= ~a$r_buff1_thd3~0 0) (or (= ~a$r_buff1_thd1~0 (* 256 (div ~a$r_buff1_thd1~0 256))) (= (* 256 (div ~a$w_buff1_used~0 256)) ~a$w_buff1_used~0) (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))))) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 171#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))), 150#L868-3true, Black: 177#(<= ~__unbuffered_cnt~0 0), Black: 183#(<= ~__unbuffered_cnt~0 1), Black: 248#(and (not (= ~z~0 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0)))), Black: 240#(and (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (not (= ~z~0 0)) (= ~a$w_buff1~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd1~0 1)), Black: 242#(and (= ~a$w_buff0~0 0) (not (= ~z~0 0))), Black: 234#(and (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd1~0 1))]) [2023-11-19 08:04:33,309 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-11-19 08:04:33,309 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-19 08:04:33,309 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-19 08:04:33,309 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-19 08:04:33,338 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([452] L784-->L791: Formula: (let ((.cse2 (not (= (mod v_~a$w_buff0_used~0_97 256) 0))) (.cse3 (not (= (mod v_~a$r_buff1_thd2~0_18 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd2~0_20 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_98 256) 0)))) (.cse1 (and .cse3 (not (= (mod v_~a$w_buff1_used~0_83 256) 0)))) (.cse4 (and .cse5 .cse2))) (and (= v_~a~0_44 (ite .cse0 v_~a$w_buff0~0_22 (ite .cse1 v_~a$w_buff1~0_25 v_~a~0_45))) (= (ite (or (and (not (= (mod v_~a$r_buff0_thd2~0_19 256) 0)) .cse2) (and .cse3 (not (= (mod v_~a$w_buff1_used~0_82 256) 0)))) 0 v_~a$r_buff1_thd2~0_18) v_~a$r_buff1_thd2~0_17) (= (ite .cse0 0 v_~a$w_buff0_used~0_98) v_~a$w_buff0_used~0_97) (= v_~a$w_buff1_used~0_82 (ite (or .cse1 .cse4) 0 v_~a$w_buff1_used~0_83)) (= v_~a$r_buff0_thd2~0_19 (ite .cse4 0 v_~a$r_buff0_thd2~0_20))))) InVars {~a~0=v_~a~0_45, ~a$w_buff1~0=v_~a$w_buff1~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_18, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_20, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_98, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_83} OutVars{~a~0=v_~a~0_44, ~a$w_buff1~0=v_~a$w_buff1~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_22, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_17, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_19, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_97, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_82} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, ~a$w_buff0_used~0, ~a$w_buff1_used~0][55], [Black: 190#(<= ~__unbuffered_cnt~0 2), Black: 245#(and (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (not (= ~z~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1)), Black: 238#(and (= ~a$w_buff0~0 0) (not (= ~z~0 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0)))), Black: 230#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))), Black: 232#(and (= ~a$w_buff0~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0)))), 229#(not (= ~z~0 0)), Black: 195#(and (<= (div ~a$w_buff0_used~0 256) 0) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd1~0 1)), Black: 199#(and (<= (div ~a$w_buff0_used~0 256) 0) (<= 1 ~a$w_buff0_used~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd1~0 1)), Black: 206#(and (<= (div ~a$w_buff0_used~0 256) 0) (<= 1 ~a$w_buff0_used~0) (not (= ~y~0 0)) (= ~a$r_buff0_thd1~0 1)), Black: 196#(not (= ~y~0 0)), Black: 204#(and (<= (div ~a$w_buff0_used~0 256) 0) (<= 1 ~a$w_buff0_used~0) (not (= ~y~0 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd1~0 1)), Black: 197#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))), P1Thread1of1ForFork0InUse, P2Thread1of1ForFork3InUse, 222#(<= ~__unbuffered_cnt~0 3), 202#(and (not (= ~y~0 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0)))), P0Thread1of1ForFork2InUse, P3Thread1of1ForFork1InUse, 162#true, 110#L791true, 77#P2EXITtrue, 41#P3EXITtrue, 269#(and (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd2~0 0) (or (not (= ~a$w_buff0~0 0)) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (= ~a$r_buff1_thd3~0 0) (or (= ~a$r_buff1_thd1~0 (* 256 (div ~a$r_buff1_thd1~0 256))) (= (* 256 (div ~a$w_buff1_used~0 256)) ~a$w_buff1_used~0) (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))))) (not (= ~a~0 0)) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 171#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))), 150#L868-3true, Black: 177#(<= ~__unbuffered_cnt~0 0), Black: 183#(<= ~__unbuffered_cnt~0 1), Black: 248#(and (not (= ~z~0 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0)))), 93#P0EXITtrue, Black: 240#(and (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (not (= ~z~0 0)) (= ~a$w_buff1~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd1~0 1)), Black: 242#(and (= ~a$w_buff0~0 0) (not (= ~z~0 0))), Black: 234#(and (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (= ~a$r_buff0_thd1~0 1))]) [2023-11-19 08:04:33,338 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-11-19 08:04:33,339 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-19 08:04:33,339 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-19 08:04:33,339 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-19 08:04:33,389 INFO L124 PetriNetUnfolderBase]: 5440/8363 cut-off events. [2023-11-19 08:04:33,389 INFO L125 PetriNetUnfolderBase]: For 34474/35097 co-relation queries the response was YES. [2023-11-19 08:04:33,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40798 conditions, 8363 events. 5440/8363 cut-off events. For 34474/35097 co-relation queries the response was YES. Maximal size of possible extension queue 442. Compared 50421 event pairs, 884 based on Foata normal form. 75/8283 useless extension candidates. Maximal degree in co-relation 40772. Up to 3151 conditions per place. [2023-11-19 08:04:33,475 INFO L140 encePairwiseOnDemand]: 284/290 looper letters, 176 selfloop transitions, 32 changer transitions 0/251 dead transitions. [2023-11-19 08:04:33,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 251 transitions, 2473 flow [2023-11-19 08:04:33,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 08:04:33,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-19 08:04:33,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 968 transitions. [2023-11-19 08:04:33,479 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4768472906403941 [2023-11-19 08:04:33,480 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 968 transitions. [2023-11-19 08:04:33,480 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 968 transitions. [2023-11-19 08:04:33,481 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:04:33,481 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 968 transitions. [2023-11-19 08:04:33,484 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 138.28571428571428) internal successors, (968), 7 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:33,488 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 290.0) internal successors, (2320), 8 states have internal predecessors, (2320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:33,489 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 290.0) internal successors, (2320), 8 states have internal predecessors, (2320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:33,490 INFO L175 Difference]: Start difference. First operand has 85 places, 166 transitions, 1502 flow. Second operand 7 states and 968 transitions. [2023-11-19 08:04:33,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 251 transitions, 2473 flow [2023-11-19 08:04:33,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 251 transitions, 2467 flow, removed 3 selfloop flow, removed 0 redundant places. [2023-11-19 08:04:33,914 INFO L231 Difference]: Finished difference. Result has 93 places, 173 transitions, 1653 flow [2023-11-19 08:04:33,915 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=1496, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1653, PETRI_PLACES=93, PETRI_TRANSITIONS=173} [2023-11-19 08:04:33,915 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 41 predicate places. [2023-11-19 08:04:33,916 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 173 transitions, 1653 flow [2023-11-19 08:04:33,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 131.0) internal successors, (1048), 8 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:33,916 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:04:33,916 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:04:33,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-19 08:04:33,917 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 08:04:33,917 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:04:33,918 INFO L85 PathProgramCache]: Analyzing trace with hash -336702656, now seen corresponding path program 3 times [2023-11-19 08:04:33,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:04:33,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337649650] [2023-11-19 08:04:33,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:04:33,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:04:34,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 08:04:34,012 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 08:04:34,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 08:04:34,142 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 08:04:34,142 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-19 08:04:34,143 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-11-19 08:04:34,145 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-11-19 08:04:34,145 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-11-19 08:04:34,148 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-11-19 08:04:34,149 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-11-19 08:04:34,149 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-11-19 08:04:34,149 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-11-19 08:04:34,149 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-11-19 08:04:34,149 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-11-19 08:04:34,150 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-11-19 08:04:34,150 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-11-19 08:04:34,150 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-11-19 08:04:34,150 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-11-19 08:04:34,150 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-11-19 08:04:34,151 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-11-19 08:04:34,151 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-11-19 08:04:34,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-19 08:04:34,151 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1] [2023-11-19 08:04:34,157 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-19 08:04:34,157 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-19 08:04:34,239 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-19 08:04:34,240 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-19 08:04:34,242 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-19 08:04:34,243 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-19 08:04:34,253 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-19 08:04:34,265 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 08:04:34 BasicIcfg [2023-11-19 08:04:34,266 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-19 08:04:34,266 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-19 08:04:34,266 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-19 08:04:34,266 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-19 08:04:34,267 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:04:00" (3/4) ... [2023-11-19 08:04:34,268 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-19 08:04:34,269 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-19 08:04:34,270 INFO L158 Benchmark]: Toolchain (without parser) took 35718.27ms. Allocated memory was 142.6MB in the beginning and 3.9GB in the end (delta: 3.7GB). Free memory was 102.4MB in the beginning and 3.5GB in the end (delta: -3.4GB). Peak memory consumption was 343.2MB. Max. memory is 16.1GB. [2023-11-19 08:04:34,270 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 142.6MB. Free memory is still 87.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 08:04:34,271 INFO L158 Benchmark]: CACSL2BoogieTranslator took 899.37ms. Allocated memory is still 142.6MB. Free memory was 102.4MB in the beginning and 78.3MB in the end (delta: 24.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-11-19 08:04:34,271 INFO L158 Benchmark]: Boogie Procedure Inliner took 81.97ms. Allocated memory is still 142.6MB. Free memory was 78.3MB in the beginning and 75.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 08:04:34,272 INFO L158 Benchmark]: Boogie Preprocessor took 66.01ms. Allocated memory is still 142.6MB. Free memory was 75.8MB in the beginning and 73.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 08:04:34,272 INFO L158 Benchmark]: RCFGBuilder took 1222.98ms. Allocated memory was 142.6MB in the beginning and 172.0MB in the end (delta: 29.4MB). Free memory was 73.4MB in the beginning and 112.8MB in the end (delta: -39.4MB). Peak memory consumption was 21.1MB. Max. memory is 16.1GB. [2023-11-19 08:04:34,272 INFO L158 Benchmark]: TraceAbstraction took 33431.27ms. Allocated memory was 172.0MB in the beginning and 3.9GB in the end (delta: 3.7GB). Free memory was 112.0MB in the beginning and 3.5GB in the end (delta: -3.4GB). Peak memory consumption was 320.0MB. Max. memory is 16.1GB. [2023-11-19 08:04:34,273 INFO L158 Benchmark]: Witness Printer took 3.44ms. Allocated memory is still 3.9GB. Free memory is still 3.5GB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 08:04:34,275 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.34ms. Allocated memory is still 142.6MB. Free memory is still 87.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 899.37ms. Allocated memory is still 142.6MB. Free memory was 102.4MB in the beginning and 78.3MB in the end (delta: 24.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 81.97ms. Allocated memory is still 142.6MB. Free memory was 78.3MB in the beginning and 75.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.01ms. Allocated memory is still 142.6MB. Free memory was 75.8MB in the beginning and 73.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1222.98ms. Allocated memory was 142.6MB in the beginning and 172.0MB in the end (delta: 29.4MB). Free memory was 73.4MB in the beginning and 112.8MB in the end (delta: -39.4MB). Peak memory consumption was 21.1MB. Max. memory is 16.1GB. * TraceAbstraction took 33431.27ms. Allocated memory was 172.0MB in the beginning and 3.9GB in the end (delta: 3.7GB). Free memory was 112.0MB in the beginning and 3.5GB in the end (delta: -3.4GB). Peak memory consumption was 320.0MB. Max. memory is 16.1GB. * Witness Printer took 3.44ms. Allocated memory is still 3.9GB. Free memory is still 3.5GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.1s, 155 PlacesBefore, 52 PlacesAfterwards, 146 TransitionsBefore, 40 TransitionsAfterwards, 4116 CoEnabledTransitionPairs, 7 FixpointIterations, 50 TrivialSequentialCompositions, 77 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 3 ChoiceCompositions, 140 TotalNumberOfCompositions, 10312 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4184, independent: 3956, independent conditional: 0, independent unconditional: 3956, dependent: 228, dependent conditional: 0, dependent unconditional: 228, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2041, independent: 1998, independent conditional: 0, independent unconditional: 1998, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4184, independent: 1958, independent conditional: 0, independent unconditional: 1958, dependent: 185, dependent conditional: 0, dependent unconditional: 185, unknown: 2041, unknown conditional: 0, unknown unconditional: 2041] , Statistics on independence cache: Total cache size (in pairs): 147, Positive cache size: 127, Positive conditional cache size: 0, Positive unconditional cache size: 127, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int a = 0; [L719] 0 _Bool a$flush_delayed; [L720] 0 int a$mem_tmp; [L721] 0 _Bool a$r_buff0_thd0; [L722] 0 _Bool a$r_buff0_thd1; [L723] 0 _Bool a$r_buff0_thd2; [L724] 0 _Bool a$r_buff0_thd3; [L725] 0 _Bool a$r_buff0_thd4; [L726] 0 _Bool a$r_buff1_thd0; [L727] 0 _Bool a$r_buff1_thd1; [L728] 0 _Bool a$r_buff1_thd2; [L729] 0 _Bool a$r_buff1_thd3; [L730] 0 _Bool a$r_buff1_thd4; [L731] 0 _Bool a$read_delayed; [L732] 0 int *a$read_delayed_var; [L733] 0 int a$w_buff0; [L734] 0 _Bool a$w_buff0_used; [L735] 0 int a$w_buff1; [L736] 0 _Bool a$w_buff1_used; [L737] 0 _Bool main$tmp_guard0; [L738] 0 _Bool main$tmp_guard1; [L740] 0 int x = 0; [L742] 0 int y = 0; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L861] 0 pthread_t t1353; [L862] FCALL, FORK 0 pthread_create(&t1353, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1353={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L863] 0 pthread_t t1354; [L864] FCALL, FORK 0 pthread_create(&t1354, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1353={5:0}, t1354={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L865] 0 pthread_t t1355; [L866] FCALL, FORK 0 pthread_create(&t1355, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1353={5:0}, t1354={6:0}, t1355={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L867] 0 pthread_t t1356; [L868] FCALL, FORK 0 pthread_create(&t1356, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1353={5:0}, t1354={6:0}, t1355={7:0}, t1356={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L750] 1 a$w_buff1 = a$w_buff0 [L751] 1 a$w_buff0 = 1 [L752] 1 a$w_buff1_used = a$w_buff0_used [L753] 1 a$w_buff0_used = (_Bool)1 [L754] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L754] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L755] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L756] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L757] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L758] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L759] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L760] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L763] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L780] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L783] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L786] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L787] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L788] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L789] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L790] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L800] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L803] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L820] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L823] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L824] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L825] 4 a$flush_delayed = weak$$choice2 [L826] 4 a$mem_tmp = a [L827] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L828] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L829] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L830] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L831] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L832] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L833] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L834] 4 __unbuffered_p3_EAX = a [L835] 4 a = a$flush_delayed ? a$mem_tmp : a [L836] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=1] [L839] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L840] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L841] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L842] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L843] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=1] [L766] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L767] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L768] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L769] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L770] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=1] [L773] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 1 return 0; [L806] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L807] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L808] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L809] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L810] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=1] [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 2 return 0; [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L815] 3 return 0; [L846] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L848] 4 return 0; [L870] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L872] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L872] RET 0 assume_abort_if_not(main$tmp_guard0) [L874] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L875] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L876] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L877] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L878] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1353={5:0}, t1354={6:0}, t1355={7:0}, t1356={3:0}, weak$$choice2=1, x=2, y=1, z=1] [L881] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) [L883] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix051_power.oepc_power.opt_pso.oepc_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 859]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 864]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 866]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 862]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 868]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 184 locations, 16 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 33.2s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 21.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 563 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 477 mSDsluCounter, 391 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 342 mSDsCounter, 96 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1524 IncrementalHoareTripleChecker+Invalid, 1620 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 96 mSolverCounterUnsat, 49 mSDtfsCounter, 1524 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 54 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1653occurred in iteration=10, InterpolantAutomatonStates: 55, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 188 NumberOfCodeBlocks, 188 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 151 ConstructedInterpolants, 0 QuantifiedInterpolants, 1245 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-19 08:04:34,318 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_798f10f5-172c-4277-9ad3-393ce8e89116/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_798f10f5-172c-4277-9ad3-393ce8e89116/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_798f10f5-172c-4277-9ad3-393ce8e89116/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_798f10f5-172c-4277-9ad3-393ce8e89116/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_798f10f5-172c-4277-9ad3-393ce8e89116/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix051_power.oepc_power.opt_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_798f10f5-172c-4277-9ad3-393ce8e89116/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_798f10f5-172c-4277-9ad3-393ce8e89116/bin/uautomizer-verify-uCwYo4JHxu --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 76dbb78f4fe406633111c7d7e2c1e8bd933a1f67e6e1cf5d4cbd1b0379bfe086 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 08:04:37,160 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 08:04:37,280 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_798f10f5-172c-4277-9ad3-393ce8e89116/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-19 08:04:37,291 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 08:04:37,309 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 08:04:37,358 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 08:04:37,358 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 08:04:37,359 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 08:04:37,360 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 08:04:37,365 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 08:04:37,366 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 08:04:37,367 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 08:04:37,367 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 08:04:37,369 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 08:04:37,370 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 08:04:37,370 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 08:04:37,371 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 08:04:37,371 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 08:04:37,371 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-19 08:04:37,372 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-19 08:04:37,373 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-19 08:04:37,373 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 08:04:37,374 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-19 08:04:37,374 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-19 08:04:37,375 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-19 08:04:37,375 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-19 08:04:37,375 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 08:04:37,376 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 08:04:37,377 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 08:04:37,377 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 08:04:37,378 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 08:04:37,379 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 08:04:37,379 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 08:04:37,379 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 08:04:37,380 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-19 08:04:37,380 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-19 08:04:37,380 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 08:04:37,380 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 08:04:37,381 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 08:04:37,382 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-19 08:04:37,382 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 08:04:37,382 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_798f10f5-172c-4277-9ad3-393ce8e89116/bin/uautomizer-verify-uCwYo4JHxu/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_798f10f5-172c-4277-9ad3-393ce8e89116/bin/uautomizer-verify-uCwYo4JHxu 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 -> 76dbb78f4fe406633111c7d7e2c1e8bd933a1f67e6e1cf5d4cbd1b0379bfe086 [2023-11-19 08:04:37,807 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 08:04:37,831 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 08:04:37,834 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 08:04:37,836 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 08:04:37,836 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 08:04:37,838 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_798f10f5-172c-4277-9ad3-393ce8e89116/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/pthread-wmm/mix051_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2023-11-19 08:04:41,273 INFO L533 CDTParser]: Created temporary CDT project at NULL