./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix027_tso.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0bf0bf1-955b-4f8e-8a70-6ec0aebe73fb/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0bf0bf1-955b-4f8e-8a70-6ec0aebe73fb/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_e0bf0bf1-955b-4f8e-8a70-6ec0aebe73fb/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0bf0bf1-955b-4f8e-8a70-6ec0aebe73fb/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix027_tso.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0bf0bf1-955b-4f8e-8a70-6ec0aebe73fb/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_e0bf0bf1-955b-4f8e-8a70-6ec0aebe73fb/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 ca8042a994ed433e8dc5deebabd166a79d030a0388291f832432b8dc85340f9d --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:32:52,974 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:32:53,102 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0bf0bf1-955b-4f8e-8a70-6ec0aebe73fb/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-19 07:32:53,114 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:32:53,115 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:32:53,167 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:32:53,168 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:32:53,168 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:32:53,170 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:32:53,175 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:32:53,176 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:32:53,177 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:32:53,177 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:32:53,179 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:32:53,180 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:32:53,180 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:32:53,181 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:32:53,181 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:32:53,182 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-19 07:32:53,182 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-19 07:32:53,183 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-19 07:32:53,183 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:32:53,184 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-19 07:32:53,184 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-19 07:32:53,185 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:32:53,185 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:32:53,186 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:32:53,187 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:32:53,187 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:32:53,187 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:32:53,189 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:32:53,189 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:32:53,190 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 07:32:53,190 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 07:32:53,198 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:32:53,198 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:32:53,199 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:32:53,199 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:32:53,199 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_e0bf0bf1-955b-4f8e-8a70-6ec0aebe73fb/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_e0bf0bf1-955b-4f8e-8a70-6ec0aebe73fb/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 -> ca8042a994ed433e8dc5deebabd166a79d030a0388291f832432b8dc85340f9d [2023-11-19 07:32:53,477 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:32:53,509 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:32:53,513 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:32:53,514 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:32:53,515 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:32:53,516 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0bf0bf1-955b-4f8e-8a70-6ec0aebe73fb/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/pthread-wmm/mix027_tso.i [2023-11-19 07:32:56,725 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:32:57,138 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:32:57,139 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0bf0bf1-955b-4f8e-8a70-6ec0aebe73fb/sv-benchmarks/c/pthread-wmm/mix027_tso.i [2023-11-19 07:32:57,160 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0bf0bf1-955b-4f8e-8a70-6ec0aebe73fb/bin/uautomizer-verify-uCwYo4JHxu/data/ce4f8f50e/7b077e605a334133989e46152f0d071e/FLAG0835552e5 [2023-11-19 07:32:57,174 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0bf0bf1-955b-4f8e-8a70-6ec0aebe73fb/bin/uautomizer-verify-uCwYo4JHxu/data/ce4f8f50e/7b077e605a334133989e46152f0d071e [2023-11-19 07:32:57,177 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:32:57,179 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:32:57,180 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:32:57,180 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:32:57,185 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:32:57,186 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:32:57" (1/1) ... [2023-11-19 07:32:57,187 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c7e0b89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:32:57, skipping insertion in model container [2023-11-19 07:32:57,187 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:32:57" (1/1) ... [2023-11-19 07:32:57,245 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:32:57,788 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:32:57,800 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:32:57,874 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:32:57,923 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 07:32:57,923 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 07:32:57,932 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:32:57,932 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:32:57 WrapperNode [2023-11-19 07:32:57,933 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:32:57,934 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:32:57,934 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:32:57,935 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:32:57,943 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:32:57" (1/1) ... [2023-11-19 07:32:57,975 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:32:57" (1/1) ... [2023-11-19 07:32:58,012 INFO L138 Inliner]: procedures = 177, calls = 70, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 166 [2023-11-19 07:32:58,012 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:32:58,013 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:32:58,013 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:32:58,014 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:32:58,024 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:32:57" (1/1) ... [2023-11-19 07:32:58,025 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:32:57" (1/1) ... [2023-11-19 07:32:58,029 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:32:57" (1/1) ... [2023-11-19 07:32:58,030 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:32:57" (1/1) ... [2023-11-19 07:32:58,041 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:32:57" (1/1) ... [2023-11-19 07:32:58,043 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:32:57" (1/1) ... [2023-11-19 07:32:58,047 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:32:57" (1/1) ... [2023-11-19 07:32:58,050 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:32:57" (1/1) ... [2023-11-19 07:32:58,055 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:32:58,056 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:32:58,056 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:32:58,057 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:32:58,057 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:32:57" (1/1) ... [2023-11-19 07:32:58,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:32:58,083 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0bf0bf1-955b-4f8e-8a70-6ec0aebe73fb/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:32:58,099 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0bf0bf1-955b-4f8e-8a70-6ec0aebe73fb/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 07:32:58,138 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0bf0bf1-955b-4f8e-8a70-6ec0aebe73fb/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 07:32:58,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 07:32:58,154 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-19 07:32:58,155 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:32:58,155 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 07:32:58,155 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 07:32:58,156 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-19 07:32:58,156 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-19 07:32:58,156 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-19 07:32:58,156 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-19 07:32:58,157 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-19 07:32:58,157 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-19 07:32:58,157 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-19 07:32:58,157 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-19 07:32:58,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 07:32:58,158 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-19 07:32:58,160 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:32:58,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:32:58,162 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 07:32:58,462 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:32:58,465 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:32:58,907 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:32:59,114 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:32:59,114 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-19 07:32:59,119 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:32:59 BoogieIcfgContainer [2023-11-19 07:32:59,123 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:32:59,126 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:32:59,127 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:32:59,131 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:32:59,131 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:32:57" (1/3) ... [2023-11-19 07:32:59,132 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b385bd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:32:59, skipping insertion in model container [2023-11-19 07:32:59,132 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:32:57" (2/3) ... [2023-11-19 07:32:59,135 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b385bd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:32:59, skipping insertion in model container [2023-11-19 07:32:59,135 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:32:59" (3/3) ... [2023-11-19 07:32:59,137 INFO L112 eAbstractionObserver]: Analyzing ICFG mix027_tso.i [2023-11-19 07:32:59,158 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:32:59,159 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-11-19 07:32:59,159 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-19 07:32:59,269 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-19 07:32:59,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 160 places, 151 transitions, 318 flow [2023-11-19 07:32:59,449 INFO L124 PetriNetUnfolderBase]: 4/147 cut-off events. [2023-11-19 07:32:59,449 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:32:59,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160 conditions, 147 events. 4/147 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 119 event pairs, 0 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 107. Up to 2 conditions per place. [2023-11-19 07:32:59,458 INFO L82 GeneralOperation]: Start removeDead. Operand has 160 places, 151 transitions, 318 flow [2023-11-19 07:32:59,469 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 156 places, 147 transitions, 306 flow [2023-11-19 07:32:59,474 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-19 07:32:59,495 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 156 places, 147 transitions, 306 flow [2023-11-19 07:32:59,500 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 156 places, 147 transitions, 306 flow [2023-11-19 07:32:59,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 156 places, 147 transitions, 306 flow [2023-11-19 07:32:59,606 INFO L124 PetriNetUnfolderBase]: 4/147 cut-off events. [2023-11-19 07:32:59,606 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:32:59,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160 conditions, 147 events. 4/147 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 119 event pairs, 0 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 107. Up to 2 conditions per place. [2023-11-19 07:32:59,614 INFO L119 LiptonReduction]: Number of co-enabled transitions 4212 [2023-11-19 07:33:08,208 INFO L134 LiptonReduction]: Checked pairs total: 11013 [2023-11-19 07:33:08,208 INFO L136 LiptonReduction]: Total number of compositions: 147 [2023-11-19 07:33:08,227 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:33:08,237 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;@5a10767, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:33:08,237 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-11-19 07:33:08,240 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-19 07:33:08,240 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2023-11-19 07:33:08,241 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:33:08,241 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:33:08,242 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-19 07:33:08,242 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 07:33:08,249 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:33:08,249 INFO L85 PathProgramCache]: Analyzing trace with hash 658, now seen corresponding path program 1 times [2023-11-19 07:33:08,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:33:08,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361911766] [2023-11-19 07:33:08,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:33:08,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:33:08,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:08,403 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 07:33:08,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:33:08,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361911766] [2023-11-19 07:33:08,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361911766] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:33:08,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:33:08,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-19 07:33:08,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838837769] [2023-11-19 07:33:08,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:33:08,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 07:33:08,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:33:08,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 07:33:08,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 07:33:08,456 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 298 [2023-11-19 07:33:08,459 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 39 transitions, 90 flow. Second operand has 2 states, 2 states have (on average 134.5) internal successors, (269), 2 states have internal predecessors, (269), 0 states have call successors, (0), 0 states 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 07:33:08,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:33:08,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 298 [2023-11-19 07:33:08,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:33:10,362 INFO L124 PetriNetUnfolderBase]: 5973/8245 cut-off events. [2023-11-19 07:33:10,362 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2023-11-19 07:33:10,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16563 conditions, 8245 events. 5973/8245 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 431. Compared 43331 event pairs, 5973 based on Foata normal form. 0/6999 useless extension candidates. Maximal degree in co-relation 16551. Up to 8103 conditions per place. [2023-11-19 07:33:10,450 INFO L140 encePairwiseOnDemand]: 290/298 looper letters, 26 selfloop transitions, 0 changer transitions 0/31 dead transitions. [2023-11-19 07:33:10,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 31 transitions, 126 flow [2023-11-19 07:33:10,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 07:33:10,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-19 07:33:10,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 302 transitions. [2023-11-19 07:33:10,468 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5067114093959731 [2023-11-19 07:33:10,469 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 302 transitions. [2023-11-19 07:33:10,470 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 302 transitions. [2023-11-19 07:33:10,472 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:33:10,475 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 302 transitions. [2023-11-19 07:33:10,479 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 151.0) internal successors, (302), 2 states have internal predecessors, (302), 0 states have call successors, (0), 0 states 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 07:33:10,484 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 298.0) internal successors, (894), 3 states have internal predecessors, (894), 0 states have call successors, (0), 0 states 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 07:33:10,485 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 298.0) internal successors, (894), 3 states have internal predecessors, (894), 0 states have call successors, (0), 0 states 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 07:33:10,487 INFO L175 Difference]: Start difference. First operand has 52 places, 39 transitions, 90 flow. Second operand 2 states and 302 transitions. [2023-11-19 07:33:10,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 31 transitions, 126 flow [2023-11-19 07:33:10,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 31 transitions, 122 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-19 07:33:10,499 INFO L231 Difference]: Finished difference. Result has 41 places, 31 transitions, 70 flow [2023-11-19 07:33:10,502 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=298, 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 07:33:10,506 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -11 predicate places. [2023-11-19 07:33:10,507 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 70 flow [2023-11-19 07:33:10,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 134.5) internal successors, (269), 2 states have internal predecessors, (269), 0 states have call successors, (0), 0 states 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 07:33:10,507 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:33:10,508 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-19 07:33:10,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 07:33:10,508 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 07:33:10,509 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:33:10,509 INFO L85 PathProgramCache]: Analyzing trace with hash 623490945, now seen corresponding path program 1 times [2023-11-19 07:33:10,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:33:10,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932295141] [2023-11-19 07:33:10,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:33:10,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:33:10,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:10,956 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 07:33:10,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:33:10,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932295141] [2023-11-19 07:33:10,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932295141] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:33:10,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:33:10,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 07:33:10,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576221017] [2023-11-19 07:33:10,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:33:10,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:33:10,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:33:10,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:33:10,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:33:10,963 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 298 [2023-11-19 07:33:10,964 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 0 states 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 07:33:10,964 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:33:10,964 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 298 [2023-11-19 07:33:10,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:33:12,460 INFO L124 PetriNetUnfolderBase]: 4695/6661 cut-off events. [2023-11-19 07:33:12,460 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:33:12,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13234 conditions, 6661 events. 4695/6661 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 361. Compared 36320 event pairs, 1245 based on Foata normal form. 0/6096 useless extension candidates. Maximal degree in co-relation 13231. Up to 5107 conditions per place. [2023-11-19 07:33:12,529 INFO L140 encePairwiseOnDemand]: 295/298 looper letters, 39 selfloop transitions, 2 changer transitions 2/48 dead transitions. [2023-11-19 07:33:12,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 48 transitions, 194 flow [2023-11-19 07:33:12,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:33:12,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:33:12,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 443 transitions. [2023-11-19 07:33:12,539 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4955257270693512 [2023-11-19 07:33:12,539 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 443 transitions. [2023-11-19 07:33:12,540 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 443 transitions. [2023-11-19 07:33:12,540 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:33:12,540 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 443 transitions. [2023-11-19 07:33:12,545 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 147.66666666666666) internal successors, (443), 3 states have internal predecessors, (443), 0 states have call successors, (0), 0 states 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 07:33:12,551 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 298.0) internal successors, (1192), 4 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states 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 07:33:12,556 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 298.0) internal successors, (1192), 4 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states 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 07:33:12,556 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 70 flow. Second operand 3 states and 443 transitions. [2023-11-19 07:33:12,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 48 transitions, 194 flow [2023-11-19 07:33:12,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 48 transitions, 194 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-19 07:33:12,560 INFO L231 Difference]: Finished difference. Result has 42 places, 29 transitions, 70 flow [2023-11-19 07:33:12,560 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=298, 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 07:33:12,562 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -10 predicate places. [2023-11-19 07:33:12,562 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 70 flow [2023-11-19 07:33:12,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 0 states 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 07:33:12,570 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:33:12,571 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:33:12,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 07:33:12,571 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 07:33:12,574 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:33:12,575 INFO L85 PathProgramCache]: Analyzing trace with hash 572285864, now seen corresponding path program 1 times [2023-11-19 07:33:12,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:33:12,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741084486] [2023-11-19 07:33:12,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:33:12,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:33:12,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:13,168 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 07:33:13,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:33:13,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741084486] [2023-11-19 07:33:13,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741084486] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:33:13,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:33:13,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 07:33:13,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463899716] [2023-11-19 07:33:13,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:33:13,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:33:13,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:33:13,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:33:13,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:33:13,176 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 298 [2023-11-19 07:33:13,177 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:13,178 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:33:13,178 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 298 [2023-11-19 07:33:13,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:33:14,496 INFO L124 PetriNetUnfolderBase]: 4487/6403 cut-off events. [2023-11-19 07:33:14,496 INFO L125 PetriNetUnfolderBase]: For 405/405 co-relation queries the response was YES. [2023-11-19 07:33:14,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13114 conditions, 6403 events. 4487/6403 cut-off events. For 405/405 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 33763 event pairs, 1751 based on Foata normal form. 0/6193 useless extension candidates. Maximal degree in co-relation 13110. Up to 3825 conditions per place. [2023-11-19 07:33:14,546 INFO L140 encePairwiseOnDemand]: 295/298 looper letters, 35 selfloop transitions, 2 changer transitions 0/41 dead transitions. [2023-11-19 07:33:14,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 41 transitions, 170 flow [2023-11-19 07:33:14,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:33:14,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:33:14,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 434 transitions. [2023-11-19 07:33:14,549 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4854586129753915 [2023-11-19 07:33:14,549 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 434 transitions. [2023-11-19 07:33:14,549 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 434 transitions. [2023-11-19 07:33:14,549 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:33:14,550 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 434 transitions. [2023-11-19 07:33:14,551 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 0 states 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 07:33:14,554 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 298.0) internal successors, (1192), 4 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states 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 07:33:14,555 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 298.0) internal successors, (1192), 4 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states 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 07:33:14,555 INFO L175 Difference]: Start difference. First operand has 42 places, 29 transitions, 70 flow. Second operand 3 states and 434 transitions. [2023-11-19 07:33:14,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 41 transitions, 170 flow [2023-11-19 07:33:14,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 41 transitions, 164 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 07:33:14,557 INFO L231 Difference]: Finished difference. Result has 42 places, 29 transitions, 74 flow [2023-11-19 07:33:14,558 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=42, PETRI_TRANSITIONS=29} [2023-11-19 07:33:14,558 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -10 predicate places. [2023-11-19 07:33:14,559 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 74 flow [2023-11-19 07:33:14,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:14,559 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:33:14,559 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:33:14,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 07:33:14,560 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 07:33:14,562 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:33:14,562 INFO L85 PathProgramCache]: Analyzing trace with hash 572285874, now seen corresponding path program 1 times [2023-11-19 07:33:14,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:33:14,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336062120] [2023-11-19 07:33:14,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:33:14,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:33:14,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:15,399 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 07:33:15,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:33:15,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336062120] [2023-11-19 07:33:15,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336062120] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:33:15,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:33:15,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:33:15,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730999037] [2023-11-19 07:33:15,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:33:15,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:33:15,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:33:15,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:33:15,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:33:15,649 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 298 [2023-11-19 07:33:15,650 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 74 flow. Second operand has 6 states, 6 states have (on average 115.83333333333333) internal successors, (695), 6 states have internal predecessors, (695), 0 states have call successors, (0), 0 states 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 07:33:15,650 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:33:15,650 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 298 [2023-11-19 07:33:15,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:33:16,518 INFO L124 PetriNetUnfolderBase]: 2951/4221 cut-off events. [2023-11-19 07:33:16,519 INFO L125 PetriNetUnfolderBase]: For 64/64 co-relation queries the response was YES. [2023-11-19 07:33:16,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8797 conditions, 4221 events. 2951/4221 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 21322 event pairs, 544 based on Foata normal form. 256/4349 useless extension candidates. Maximal degree in co-relation 8792. Up to 3840 conditions per place. [2023-11-19 07:33:16,554 INFO L140 encePairwiseOnDemand]: 293/298 looper letters, 37 selfloop transitions, 4 changer transitions 0/46 dead transitions. [2023-11-19 07:33:16,555 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 46 transitions, 190 flow [2023-11-19 07:33:16,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:33:16,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-19 07:33:16,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 726 transitions. [2023-11-19 07:33:16,558 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40604026845637586 [2023-11-19 07:33:16,559 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 726 transitions. [2023-11-19 07:33:16,559 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 726 transitions. [2023-11-19 07:33:16,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:33:16,560 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 726 transitions. [2023-11-19 07:33:16,562 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 121.0) internal successors, (726), 6 states have internal predecessors, (726), 0 states have call successors, (0), 0 states 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 07:33:16,567 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 298.0) internal successors, (2086), 7 states have internal predecessors, (2086), 0 states have call successors, (0), 0 states 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 07:33:16,569 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 298.0) internal successors, (2086), 7 states have internal predecessors, (2086), 0 states have call successors, (0), 0 states 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 07:33:16,569 INFO L175 Difference]: Start difference. First operand has 42 places, 29 transitions, 74 flow. Second operand 6 states and 726 transitions. [2023-11-19 07:33:16,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 46 transitions, 190 flow [2023-11-19 07:33:16,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 46 transitions, 186 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 07:33:16,576 INFO L231 Difference]: Finished difference. Result has 44 places, 28 transitions, 76 flow [2023-11-19 07:33:16,576 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=76, PETRI_PLACES=44, PETRI_TRANSITIONS=28} [2023-11-19 07:33:16,578 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -8 predicate places. [2023-11-19 07:33:16,578 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 28 transitions, 76 flow [2023-11-19 07:33:16,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 115.83333333333333) internal successors, (695), 6 states have internal predecessors, (695), 0 states have call successors, (0), 0 states 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 07:33:16,579 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:33:16,579 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:33:16,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 07:33:16,580 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 07:33:16,580 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:33:16,580 INFO L85 PathProgramCache]: Analyzing trace with hash 122775015, now seen corresponding path program 1 times [2023-11-19 07:33:16,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:33:16,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617802133] [2023-11-19 07:33:16,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:33:16,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:33:16,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:17,292 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 07:33:17,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:33:17,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617802133] [2023-11-19 07:33:17,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617802133] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:33:17,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:33:17,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:33:17,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972785960] [2023-11-19 07:33:17,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:33:17,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:33:17,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:33:17,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:33:17,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:33:17,319 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 298 [2023-11-19 07:33:17,320 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 28 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 136.0) internal successors, (544), 4 states have internal predecessors, (544), 0 states have call successors, (0), 0 states 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 07:33:17,321 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:33:17,321 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 298 [2023-11-19 07:33:17,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:33:18,167 INFO L124 PetriNetUnfolderBase]: 2799/3981 cut-off events. [2023-11-19 07:33:18,167 INFO L125 PetriNetUnfolderBase]: For 236/236 co-relation queries the response was YES. [2023-11-19 07:33:18,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8277 conditions, 3981 events. 2799/3981 cut-off events. For 236/236 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 19252 event pairs, 1157 based on Foata normal form. 48/3984 useless extension candidates. Maximal degree in co-relation 8272. Up to 3211 conditions per place. [2023-11-19 07:33:18,203 INFO L140 encePairwiseOnDemand]: 295/298 looper letters, 36 selfloop transitions, 2 changer transitions 0/43 dead transitions. [2023-11-19 07:33:18,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 43 transitions, 190 flow [2023-11-19 07:33:18,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:33:18,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:33:18,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 438 transitions. [2023-11-19 07:33:18,206 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4899328859060403 [2023-11-19 07:33:18,206 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 438 transitions. [2023-11-19 07:33:18,206 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 438 transitions. [2023-11-19 07:33:18,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:33:18,208 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 438 transitions. [2023-11-19 07:33:18,210 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 0 states have call successors, (0), 0 states 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 07:33:18,213 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 298.0) internal successors, (1192), 4 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states 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 07:33:18,214 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 298.0) internal successors, (1192), 4 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states 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 07:33:18,214 INFO L175 Difference]: Start difference. First operand has 44 places, 28 transitions, 76 flow. Second operand 3 states and 438 transitions. [2023-11-19 07:33:18,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 43 transitions, 190 flow [2023-11-19 07:33:18,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 43 transitions, 180 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-19 07:33:18,217 INFO L231 Difference]: Finished difference. Result has 43 places, 28 transitions, 77 flow [2023-11-19 07:33:18,218 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=69, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=77, PETRI_PLACES=43, PETRI_TRANSITIONS=28} [2023-11-19 07:33:18,220 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -9 predicate places. [2023-11-19 07:33:18,221 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 28 transitions, 77 flow [2023-11-19 07:33:18,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 136.0) internal successors, (544), 4 states have internal predecessors, (544), 0 states have call successors, (0), 0 states 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 07:33:18,221 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:33:18,222 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:33:18,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 07:33:18,222 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 07:33:18,222 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:33:18,223 INFO L85 PathProgramCache]: Analyzing trace with hash -375885083, now seen corresponding path program 1 times [2023-11-19 07:33:18,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:33:18,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933927059] [2023-11-19 07:33:18,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:33:18,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:33:18,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:19,834 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 07:33:19,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:33:19,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933927059] [2023-11-19 07:33:19,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933927059] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:33:19,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:33:19,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:33:19,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183020568] [2023-11-19 07:33:19,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:33:19,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:33:19,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:33:19,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:33:19,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:33:19,962 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 298 [2023-11-19 07:33:19,964 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 28 transitions, 77 flow. Second operand has 6 states, 6 states have (on average 121.33333333333333) internal successors, (728), 6 states have internal predecessors, (728), 0 states have call successors, (0), 0 states 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 07:33:19,964 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:33:19,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 298 [2023-11-19 07:33:19,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:33:21,464 INFO L124 PetriNetUnfolderBase]: 7881/10695 cut-off events. [2023-11-19 07:33:21,464 INFO L125 PetriNetUnfolderBase]: For 1586/1586 co-relation queries the response was YES. [2023-11-19 07:33:21,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23706 conditions, 10695 events. 7881/10695 cut-off events. For 1586/1586 co-relation queries the response was YES. Maximal size of possible extension queue 382. Compared 52201 event pairs, 1883 based on Foata normal form. 88/10782 useless extension candidates. Maximal degree in co-relation 23700. Up to 9015 conditions per place. [2023-11-19 07:33:21,535 INFO L140 encePairwiseOnDemand]: 285/298 looper letters, 58 selfloop transitions, 21 changer transitions 0/80 dead transitions. [2023-11-19 07:33:21,535 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 80 transitions, 363 flow [2023-11-19 07:33:21,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:33:21,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-19 07:33:21,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 676 transitions. [2023-11-19 07:33:21,539 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45369127516778524 [2023-11-19 07:33:21,540 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 676 transitions. [2023-11-19 07:33:21,540 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 676 transitions. [2023-11-19 07:33:21,541 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:33:21,541 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 676 transitions. [2023-11-19 07:33:21,543 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 135.2) internal successors, (676), 5 states have internal predecessors, (676), 0 states have call successors, (0), 0 states 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 07:33:21,548 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 298.0) internal successors, (1788), 6 states have internal predecessors, (1788), 0 states have call successors, (0), 0 states 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 07:33:21,549 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 298.0) internal successors, (1788), 6 states have internal predecessors, (1788), 0 states have call successors, (0), 0 states 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 07:33:21,549 INFO L175 Difference]: Start difference. First operand has 43 places, 28 transitions, 77 flow. Second operand 5 states and 676 transitions. [2023-11-19 07:33:21,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 80 transitions, 363 flow [2023-11-19 07:33:21,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 80 transitions, 355 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 07:33:21,557 INFO L231 Difference]: Finished difference. Result has 48 places, 48 transitions, 223 flow [2023-11-19 07:33:21,557 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=223, PETRI_PLACES=48, PETRI_TRANSITIONS=48} [2023-11-19 07:33:21,560 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -4 predicate places. [2023-11-19 07:33:21,564 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 48 transitions, 223 flow [2023-11-19 07:33:21,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 121.33333333333333) internal successors, (728), 6 states have internal predecessors, (728), 0 states have call successors, (0), 0 states 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 07:33:21,566 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:33:21,566 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:33:21,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 07:33:21,566 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 07:33:21,567 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:33:21,568 INFO L85 PathProgramCache]: Analyzing trace with hash -379962203, now seen corresponding path program 2 times [2023-11-19 07:33:21,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:33:21,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169434636] [2023-11-19 07:33:21,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:33:21,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:33:21,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:22,175 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 07:33:22,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:33:22,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169434636] [2023-11-19 07:33:22,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169434636] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:33:22,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:33:22,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:33:22,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297911108] [2023-11-19 07:33:22,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:33:22,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:33:22,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:33:22,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:33:22,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:33:22,213 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 298 [2023-11-19 07:33:22,214 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 48 transitions, 223 flow. Second operand has 5 states, 5 states have (on average 126.8) internal successors, (634), 5 states have internal predecessors, (634), 0 states have call successors, (0), 0 states 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 07:33:22,214 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:33:22,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 298 [2023-11-19 07:33:22,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:33:23,949 INFO L124 PetriNetUnfolderBase]: 11247/15278 cut-off events. [2023-11-19 07:33:23,949 INFO L125 PetriNetUnfolderBase]: For 12408/12606 co-relation queries the response was YES. [2023-11-19 07:33:24,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45098 conditions, 15278 events. 11247/15278 cut-off events. For 12408/12606 co-relation queries the response was YES. Maximal size of possible extension queue 576. Compared 78910 event pairs, 1455 based on Foata normal form. 275/15139 useless extension candidates. Maximal degree in co-relation 45090. Up to 9889 conditions per place. [2023-11-19 07:33:24,088 INFO L140 encePairwiseOnDemand]: 291/298 looper letters, 84 selfloop transitions, 16 changer transitions 0/102 dead transitions. [2023-11-19 07:33:24,088 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 102 transitions, 645 flow [2023-11-19 07:33:24,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:33:24,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 07:33:24,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 562 transitions. [2023-11-19 07:33:24,092 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4714765100671141 [2023-11-19 07:33:24,093 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 562 transitions. [2023-11-19 07:33:24,093 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 562 transitions. [2023-11-19 07:33:24,094 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:33:24,094 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 562 transitions. [2023-11-19 07:33:24,096 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 140.5) internal successors, (562), 4 states have internal predecessors, (562), 0 states have call successors, (0), 0 states 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 07:33:24,099 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 298.0) internal successors, (1490), 5 states have internal predecessors, (1490), 0 states have call successors, (0), 0 states 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 07:33:24,100 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 298.0) internal successors, (1490), 5 states have internal predecessors, (1490), 0 states have call successors, (0), 0 states 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 07:33:24,101 INFO L175 Difference]: Start difference. First operand has 48 places, 48 transitions, 223 flow. Second operand 4 states and 562 transitions. [2023-11-19 07:33:24,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 102 transitions, 645 flow [2023-11-19 07:33:24,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 102 transitions, 645 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-19 07:33:24,118 INFO L231 Difference]: Finished difference. Result has 52 places, 56 transitions, 328 flow [2023-11-19 07:33:24,119 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=328, PETRI_PLACES=52, PETRI_TRANSITIONS=56} [2023-11-19 07:33:24,120 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 0 predicate places. [2023-11-19 07:33:24,120 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 56 transitions, 328 flow [2023-11-19 07:33:24,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 126.8) internal successors, (634), 5 states have internal predecessors, (634), 0 states have call successors, (0), 0 states 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 07:33:24,121 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:33:24,121 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:33:24,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 07:33:24,122 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 07:33:24,122 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:33:24,123 INFO L85 PathProgramCache]: Analyzing trace with hash -19760552, now seen corresponding path program 1 times [2023-11-19 07:33:24,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:33:24,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439566834] [2023-11-19 07:33:24,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:33:24,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:33:24,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:24,369 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 07:33:24,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:33:24,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439566834] [2023-11-19 07:33:24,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439566834] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:33:24,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:33:24,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:33:24,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367200898] [2023-11-19 07:33:24,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:33:24,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:33:24,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:33:24,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:33:24,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:33:24,390 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 298 [2023-11-19 07:33:24,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 56 transitions, 328 flow. Second operand has 4 states, 4 states have (on average 130.5) internal successors, (522), 4 states have internal predecessors, (522), 0 states have call successors, (0), 0 states 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 07:33:24,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:33:24,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 298 [2023-11-19 07:33:24,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:33:25,417 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([471] L827-->L834: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_149 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0)))) (let ((.cse0 (and (not (= (mod v_~x$w_buff0_used~0_150 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5)) (.cse1 (and .cse3 (not (= 0 (mod v_~x$w_buff1_used~0_129 256)))))) (and (= v_~x~0_87 (ite .cse0 v_~x$w_buff0~0_56 (ite .cse1 v_~x$w_buff1~0_51 v_~x~0_88))) (= v_~x$w_buff0_used~0_149 (ite .cse0 0 v_~x$w_buff0_used~0_150)) (= (ite .cse2 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_129) v_~x$w_buff1_used~0_128) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_128 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)))) 0 v_~x$r_buff1_thd4~0_20))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_56, ~x$w_buff1~0=v_~x$w_buff1~0_51, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_129, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_88, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_150} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_56, ~x$w_buff1~0=v_~x$w_buff1~0_51, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_128, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_87, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_149} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][98], [P1Thread1of1ForFork0InUse, Black: 193#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 192#(and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), 79#L2true, Black: 172#(= ~__unbuffered_p3_EAX~0 0), Black: 201#(and (= ~x$w_buff1_used~0 0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0)), 106#L834true, 85#P0EXITtrue, 180#(and (not (= |ULTIMATE.start_main_~#t738~0#1.base| |ULTIMATE.start_main_~#t737~0#1.base|)) (not (= |ULTIMATE.start_main_~#t740~0#1.base| |ULTIMATE.start_main_~#t738~0#1.base|)) (not (= |ULTIMATE.start_main_~#t740~0#1.base| |ULTIMATE.start_main_~#t737~0#1.base|)) (not (= |ULTIMATE.start_main_~#t740~0#1.base| |ULTIMATE.start_main_~#t739~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t739~0#1.base| 0) |ULTIMATE.start_main_~#t737~0#1.base| 0) |ULTIMATE.start_main_~#t740~0#1.base| 0) |ULTIMATE.start_main_~#t738~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t739~0#1.base| |ULTIMATE.start_main_~#t737~0#1.base|)) (not (= |ULTIMATE.start_main_~#t739~0#1.base| |ULTIMATE.start_main_~#t738~0#1.base|))), 123#L811true, 128#L784true, 198#true, 207#true, P0Thread1of1ForFork2InUse, Black: 184#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x~0)) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), P3Thread1of1ForFork1InUse, 163#true, 188#true, P2Thread1of1ForFork3InUse]) [2023-11-19 07:33:25,417 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-11-19 07:33:25,417 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-19 07:33:25,417 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-19 07:33:25,417 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-19 07:33:25,418 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([606] L2-->L869: Formula: (let ((.cse0 (not (= (mod v_~x$w_buff0_used~0_197 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd0~0_90 256) 0))) (.cse1 (not (= (mod v_~x$r_buff1_thd0~0_92 256) 0)))) (let ((.cse3 (and (not (= (mod v_~x$w_buff1_used~0_165 256) 0)) .cse1)) (.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_198 256) 0)))) (.cse4 (and .cse5 .cse0))) (and (= v_~x$r_buff1_thd0~0_91 (ite (or (and (not (= (mod v_~x$r_buff0_thd0~0_89 256) 0)) .cse0) (and (not (= (mod v_~x$w_buff1_used~0_164 256) 0)) .cse1)) 0 v_~x$r_buff1_thd0~0_92)) (= (ite .cse2 v_~x$w_buff0~0_98 (ite .cse3 v_~x$w_buff1~0_81 v_~x~0_114)) v_~x~0_113) (not (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_19| 0)) (= v_~x$w_buff1_used~0_164 (ite (or .cse3 .cse4) 0 v_~x$w_buff1_used~0_165)) (= (ite .cse2 0 v_~x$w_buff0_used~0_198) v_~x$w_buff0_used~0_197) (= v_~x$r_buff0_thd0~0_89 (ite .cse4 0 v_~x$r_buff0_thd0~0_90))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_98, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_90, ~x$w_buff1~0=v_~x$w_buff1~0_81, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_165, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_92, ~x~0=v_~x~0_114, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_198, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_19|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_98, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_89, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_28|, ~x$w_buff1~0=v_~x$w_buff1~0_81, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_164, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_91, ~x~0=v_~x~0_113, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_197} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1][83], [P1Thread1of1ForFork0InUse, Black: 193#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 192#(and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), 56#L869true, 153#L827true, Black: 172#(= ~__unbuffered_p3_EAX~0 0), Black: 201#(and (= ~x$w_buff1_used~0 0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0)), 85#P0EXITtrue, 180#(and (not (= |ULTIMATE.start_main_~#t738~0#1.base| |ULTIMATE.start_main_~#t737~0#1.base|)) (not (= |ULTIMATE.start_main_~#t740~0#1.base| |ULTIMATE.start_main_~#t738~0#1.base|)) (not (= |ULTIMATE.start_main_~#t740~0#1.base| |ULTIMATE.start_main_~#t737~0#1.base|)) (not (= |ULTIMATE.start_main_~#t740~0#1.base| |ULTIMATE.start_main_~#t739~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t739~0#1.base| 0) |ULTIMATE.start_main_~#t737~0#1.base| 0) |ULTIMATE.start_main_~#t740~0#1.base| 0) |ULTIMATE.start_main_~#t738~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t739~0#1.base| |ULTIMATE.start_main_~#t737~0#1.base|)) (not (= |ULTIMATE.start_main_~#t739~0#1.base| |ULTIMATE.start_main_~#t738~0#1.base|))), 123#L811true, 128#L784true, 198#true, 207#true, P0Thread1of1ForFork2InUse, Black: 184#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x~0)) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), P3Thread1of1ForFork1InUse, 163#true, 188#true, P2Thread1of1ForFork3InUse]) [2023-11-19 07:33:25,418 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-11-19 07:33:25,418 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-19 07:33:25,418 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-19 07:33:25,418 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-19 07:33:25,453 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([471] L827-->L834: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_149 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0)))) (let ((.cse0 (and (not (= (mod v_~x$w_buff0_used~0_150 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5)) (.cse1 (and .cse3 (not (= 0 (mod v_~x$w_buff1_used~0_129 256)))))) (and (= v_~x~0_87 (ite .cse0 v_~x$w_buff0~0_56 (ite .cse1 v_~x$w_buff1~0_51 v_~x~0_88))) (= v_~x$w_buff0_used~0_149 (ite .cse0 0 v_~x$w_buff0_used~0_150)) (= (ite .cse2 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_129) v_~x$w_buff1_used~0_128) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_128 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)))) 0 v_~x$r_buff1_thd4~0_20))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_56, ~x$w_buff1~0=v_~x$w_buff1~0_51, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_129, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_88, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_150} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_56, ~x$w_buff1~0=v_~x$w_buff1~0_51, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_128, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_87, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_149} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][111], [P1Thread1of1ForFork0InUse, Black: 193#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 192#(and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), 79#L2true, 210#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 172#(= ~__unbuffered_p3_EAX~0 0), Black: 201#(and (= ~x$w_buff1_used~0 0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0)), 106#L834true, 85#P0EXITtrue, 180#(and (not (= |ULTIMATE.start_main_~#t738~0#1.base| |ULTIMATE.start_main_~#t737~0#1.base|)) (not (= |ULTIMATE.start_main_~#t740~0#1.base| |ULTIMATE.start_main_~#t738~0#1.base|)) (not (= |ULTIMATE.start_main_~#t740~0#1.base| |ULTIMATE.start_main_~#t737~0#1.base|)) (not (= |ULTIMATE.start_main_~#t740~0#1.base| |ULTIMATE.start_main_~#t739~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t739~0#1.base| 0) |ULTIMATE.start_main_~#t737~0#1.base| 0) |ULTIMATE.start_main_~#t740~0#1.base| 0) |ULTIMATE.start_main_~#t738~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t739~0#1.base| |ULTIMATE.start_main_~#t737~0#1.base|)) (not (= |ULTIMATE.start_main_~#t739~0#1.base| |ULTIMATE.start_main_~#t738~0#1.base|))), 123#L811true, 128#L784true, 198#true, P0Thread1of1ForFork2InUse, Black: 184#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x~0)) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), P3Thread1of1ForFork1InUse, 163#true, 188#true, P2Thread1of1ForFork3InUse]) [2023-11-19 07:33:25,453 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-11-19 07:33:25,453 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-19 07:33:25,454 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-19 07:33:25,454 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-19 07:33:25,514 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([471] L827-->L834: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_149 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0)))) (let ((.cse0 (and (not (= (mod v_~x$w_buff0_used~0_150 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5)) (.cse1 (and .cse3 (not (= 0 (mod v_~x$w_buff1_used~0_129 256)))))) (and (= v_~x~0_87 (ite .cse0 v_~x$w_buff0~0_56 (ite .cse1 v_~x$w_buff1~0_51 v_~x~0_88))) (= v_~x$w_buff0_used~0_149 (ite .cse0 0 v_~x$w_buff0_used~0_150)) (= (ite .cse2 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_129) v_~x$w_buff1_used~0_128) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_128 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)))) 0 v_~x$r_buff1_thd4~0_20))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_56, ~x$w_buff1~0=v_~x$w_buff1~0_51, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_129, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_88, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_150} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_56, ~x$w_buff1~0=v_~x$w_buff1~0_51, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_128, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_87, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_149} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][98], [P1Thread1of1ForFork0InUse, Black: 193#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 192#(and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), 79#L2true, Black: 172#(= ~__unbuffered_p3_EAX~0 0), Black: 201#(and (= ~x$w_buff1_used~0 0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0)), 106#L834true, 85#P0EXITtrue, 180#(and (not (= |ULTIMATE.start_main_~#t738~0#1.base| |ULTIMATE.start_main_~#t737~0#1.base|)) (not (= |ULTIMATE.start_main_~#t740~0#1.base| |ULTIMATE.start_main_~#t738~0#1.base|)) (not (= |ULTIMATE.start_main_~#t740~0#1.base| |ULTIMATE.start_main_~#t737~0#1.base|)) (not (= |ULTIMATE.start_main_~#t740~0#1.base| |ULTIMATE.start_main_~#t739~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t739~0#1.base| 0) |ULTIMATE.start_main_~#t737~0#1.base| 0) |ULTIMATE.start_main_~#t740~0#1.base| 0) |ULTIMATE.start_main_~#t738~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t739~0#1.base| |ULTIMATE.start_main_~#t737~0#1.base|)) (not (= |ULTIMATE.start_main_~#t739~0#1.base| |ULTIMATE.start_main_~#t738~0#1.base|))), 67#P2EXITtrue, 128#L784true, 207#true, 198#true, P0Thread1of1ForFork2InUse, Black: 184#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x~0)) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), P3Thread1of1ForFork1InUse, 163#true, 188#true, P2Thread1of1ForFork3InUse]) [2023-11-19 07:33:25,514 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-11-19 07:33:25,514 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-19 07:33:25,514 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-19 07:33:25,515 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-19 07:33:25,515 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([606] L2-->L869: Formula: (let ((.cse0 (not (= (mod v_~x$w_buff0_used~0_197 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd0~0_90 256) 0))) (.cse1 (not (= (mod v_~x$r_buff1_thd0~0_92 256) 0)))) (let ((.cse3 (and (not (= (mod v_~x$w_buff1_used~0_165 256) 0)) .cse1)) (.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_198 256) 0)))) (.cse4 (and .cse5 .cse0))) (and (= v_~x$r_buff1_thd0~0_91 (ite (or (and (not (= (mod v_~x$r_buff0_thd0~0_89 256) 0)) .cse0) (and (not (= (mod v_~x$w_buff1_used~0_164 256) 0)) .cse1)) 0 v_~x$r_buff1_thd0~0_92)) (= (ite .cse2 v_~x$w_buff0~0_98 (ite .cse3 v_~x$w_buff1~0_81 v_~x~0_114)) v_~x~0_113) (not (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_19| 0)) (= v_~x$w_buff1_used~0_164 (ite (or .cse3 .cse4) 0 v_~x$w_buff1_used~0_165)) (= (ite .cse2 0 v_~x$w_buff0_used~0_198) v_~x$w_buff0_used~0_197) (= v_~x$r_buff0_thd0~0_89 (ite .cse4 0 v_~x$r_buff0_thd0~0_90))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_98, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_90, ~x$w_buff1~0=v_~x$w_buff1~0_81, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_165, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_92, ~x~0=v_~x~0_114, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_198, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_19|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_98, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_89, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_28|, ~x$w_buff1~0=v_~x$w_buff1~0_81, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_164, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_91, ~x~0=v_~x~0_113, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_197} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1][83], [P1Thread1of1ForFork0InUse, Black: 193#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 192#(and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), 56#L869true, 153#L827true, Black: 172#(= ~__unbuffered_p3_EAX~0 0), Black: 201#(and (= ~x$w_buff1_used~0 0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0)), 85#P0EXITtrue, 180#(and (not (= |ULTIMATE.start_main_~#t738~0#1.base| |ULTIMATE.start_main_~#t737~0#1.base|)) (not (= |ULTIMATE.start_main_~#t740~0#1.base| |ULTIMATE.start_main_~#t738~0#1.base|)) (not (= |ULTIMATE.start_main_~#t740~0#1.base| |ULTIMATE.start_main_~#t737~0#1.base|)) (not (= |ULTIMATE.start_main_~#t740~0#1.base| |ULTIMATE.start_main_~#t739~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t739~0#1.base| 0) |ULTIMATE.start_main_~#t737~0#1.base| 0) |ULTIMATE.start_main_~#t740~0#1.base| 0) |ULTIMATE.start_main_~#t738~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t739~0#1.base| |ULTIMATE.start_main_~#t737~0#1.base|)) (not (= |ULTIMATE.start_main_~#t739~0#1.base| |ULTIMATE.start_main_~#t738~0#1.base|))), 67#P2EXITtrue, 128#L784true, 207#true, 198#true, P0Thread1of1ForFork2InUse, Black: 184#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x~0)) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), P3Thread1of1ForFork1InUse, 163#true, 188#true, P2Thread1of1ForFork3InUse]) [2023-11-19 07:33:25,515 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-11-19 07:33:25,515 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-19 07:33:25,515 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-19 07:33:25,516 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-19 07:33:25,555 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([471] L827-->L834: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_149 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0)))) (let ((.cse0 (and (not (= (mod v_~x$w_buff0_used~0_150 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5)) (.cse1 (and .cse3 (not (= 0 (mod v_~x$w_buff1_used~0_129 256)))))) (and (= v_~x~0_87 (ite .cse0 v_~x$w_buff0~0_56 (ite .cse1 v_~x$w_buff1~0_51 v_~x~0_88))) (= v_~x$w_buff0_used~0_149 (ite .cse0 0 v_~x$w_buff0_used~0_150)) (= (ite .cse2 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_129) v_~x$w_buff1_used~0_128) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_128 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)))) 0 v_~x$r_buff1_thd4~0_20))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_56, ~x$w_buff1~0=v_~x$w_buff1~0_51, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_129, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_88, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_150} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_56, ~x$w_buff1~0=v_~x$w_buff1~0_51, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_128, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_87, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_149} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][111], [P1Thread1of1ForFork0InUse, Black: 193#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 192#(and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), 79#L2true, 210#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 201#(and (= ~x$w_buff1_used~0 0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0)), Black: 172#(= ~__unbuffered_p3_EAX~0 0), 106#L834true, 85#P0EXITtrue, 67#P2EXITtrue, 180#(and (not (= |ULTIMATE.start_main_~#t738~0#1.base| |ULTIMATE.start_main_~#t737~0#1.base|)) (not (= |ULTIMATE.start_main_~#t740~0#1.base| |ULTIMATE.start_main_~#t738~0#1.base|)) (not (= |ULTIMATE.start_main_~#t740~0#1.base| |ULTIMATE.start_main_~#t737~0#1.base|)) (not (= |ULTIMATE.start_main_~#t740~0#1.base| |ULTIMATE.start_main_~#t739~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t739~0#1.base| 0) |ULTIMATE.start_main_~#t737~0#1.base| 0) |ULTIMATE.start_main_~#t740~0#1.base| 0) |ULTIMATE.start_main_~#t738~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t739~0#1.base| |ULTIMATE.start_main_~#t737~0#1.base|)) (not (= |ULTIMATE.start_main_~#t739~0#1.base| |ULTIMATE.start_main_~#t738~0#1.base|))), 128#L784true, 198#true, P0Thread1of1ForFork2InUse, Black: 184#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x~0)) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), P3Thread1of1ForFork1InUse, 163#true, 188#true, P2Thread1of1ForFork3InUse]) [2023-11-19 07:33:25,555 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-11-19 07:33:25,555 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-19 07:33:25,555 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-19 07:33:25,556 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-19 07:33:25,567 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([471] L827-->L834: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_149 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0)))) (let ((.cse0 (and (not (= (mod v_~x$w_buff0_used~0_150 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5)) (.cse1 (and .cse3 (not (= 0 (mod v_~x$w_buff1_used~0_129 256)))))) (and (= v_~x~0_87 (ite .cse0 v_~x$w_buff0~0_56 (ite .cse1 v_~x$w_buff1~0_51 v_~x~0_88))) (= v_~x$w_buff0_used~0_149 (ite .cse0 0 v_~x$w_buff0_used~0_150)) (= (ite .cse2 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_129) v_~x$w_buff1_used~0_128) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_128 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)))) 0 v_~x$r_buff1_thd4~0_20))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_56, ~x$w_buff1~0=v_~x$w_buff1~0_51, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_129, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_88, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_150} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_56, ~x$w_buff1~0=v_~x$w_buff1~0_51, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_128, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_87, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_149} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][98], [P1Thread1of1ForFork0InUse, Black: 193#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 192#(and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), 79#L2true, Black: 172#(= ~__unbuffered_p3_EAX~0 0), Black: 201#(and (= ~x$w_buff1_used~0 0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0)), 150#L804true, 106#L834true, 85#P0EXITtrue, 39#P1EXITtrue, 180#(and (not (= |ULTIMATE.start_main_~#t738~0#1.base| |ULTIMATE.start_main_~#t737~0#1.base|)) (not (= |ULTIMATE.start_main_~#t740~0#1.base| |ULTIMATE.start_main_~#t738~0#1.base|)) (not (= |ULTIMATE.start_main_~#t740~0#1.base| |ULTIMATE.start_main_~#t737~0#1.base|)) (not (= |ULTIMATE.start_main_~#t740~0#1.base| |ULTIMATE.start_main_~#t739~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t739~0#1.base| 0) |ULTIMATE.start_main_~#t737~0#1.base| 0) |ULTIMATE.start_main_~#t740~0#1.base| 0) |ULTIMATE.start_main_~#t738~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t739~0#1.base| |ULTIMATE.start_main_~#t737~0#1.base|)) (not (= |ULTIMATE.start_main_~#t739~0#1.base| |ULTIMATE.start_main_~#t738~0#1.base|))), 198#true, 207#true, P0Thread1of1ForFork2InUse, Black: 184#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x~0)) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), P3Thread1of1ForFork1InUse, 163#true, 188#true, P2Thread1of1ForFork3InUse]) [2023-11-19 07:33:25,567 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-11-19 07:33:25,567 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-19 07:33:25,568 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-19 07:33:25,568 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-19 07:33:25,568 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([606] L2-->L869: Formula: (let ((.cse0 (not (= (mod v_~x$w_buff0_used~0_197 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd0~0_90 256) 0))) (.cse1 (not (= (mod v_~x$r_buff1_thd0~0_92 256) 0)))) (let ((.cse3 (and (not (= (mod v_~x$w_buff1_used~0_165 256) 0)) .cse1)) (.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_198 256) 0)))) (.cse4 (and .cse5 .cse0))) (and (= v_~x$r_buff1_thd0~0_91 (ite (or (and (not (= (mod v_~x$r_buff0_thd0~0_89 256) 0)) .cse0) (and (not (= (mod v_~x$w_buff1_used~0_164 256) 0)) .cse1)) 0 v_~x$r_buff1_thd0~0_92)) (= (ite .cse2 v_~x$w_buff0~0_98 (ite .cse3 v_~x$w_buff1~0_81 v_~x~0_114)) v_~x~0_113) (not (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_19| 0)) (= v_~x$w_buff1_used~0_164 (ite (or .cse3 .cse4) 0 v_~x$w_buff1_used~0_165)) (= (ite .cse2 0 v_~x$w_buff0_used~0_198) v_~x$w_buff0_used~0_197) (= v_~x$r_buff0_thd0~0_89 (ite .cse4 0 v_~x$r_buff0_thd0~0_90))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_98, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_90, ~x$w_buff1~0=v_~x$w_buff1~0_81, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_165, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_92, ~x~0=v_~x~0_114, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_198, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_19|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_98, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_89, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_28|, ~x$w_buff1~0=v_~x$w_buff1~0_81, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_164, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_91, ~x~0=v_~x~0_113, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_197} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1][83], [P1Thread1of1ForFork0InUse, Black: 193#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 192#(and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), 56#L869true, 153#L827true, Black: 172#(= ~__unbuffered_p3_EAX~0 0), Black: 201#(and (= ~x$w_buff1_used~0 0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0)), 150#L804true, 85#P0EXITtrue, 39#P1EXITtrue, 180#(and (not (= |ULTIMATE.start_main_~#t738~0#1.base| |ULTIMATE.start_main_~#t737~0#1.base|)) (not (= |ULTIMATE.start_main_~#t740~0#1.base| |ULTIMATE.start_main_~#t738~0#1.base|)) (not (= |ULTIMATE.start_main_~#t740~0#1.base| |ULTIMATE.start_main_~#t737~0#1.base|)) (not (= |ULTIMATE.start_main_~#t740~0#1.base| |ULTIMATE.start_main_~#t739~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t739~0#1.base| 0) |ULTIMATE.start_main_~#t737~0#1.base| 0) |ULTIMATE.start_main_~#t740~0#1.base| 0) |ULTIMATE.start_main_~#t738~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t739~0#1.base| |ULTIMATE.start_main_~#t737~0#1.base|)) (not (= |ULTIMATE.start_main_~#t739~0#1.base| |ULTIMATE.start_main_~#t738~0#1.base|))), 198#true, 207#true, P0Thread1of1ForFork2InUse, Black: 184#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x~0)) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), P3Thread1of1ForFork1InUse, 163#true, 188#true, P2Thread1of1ForFork3InUse]) [2023-11-19 07:33:25,568 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-11-19 07:33:25,568 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-19 07:33:25,568 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-19 07:33:25,569 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-19 07:33:25,687 INFO L124 PetriNetUnfolderBase]: 6204/8886 cut-off events. [2023-11-19 07:33:25,687 INFO L125 PetriNetUnfolderBase]: For 17599/19087 co-relation queries the response was YES. [2023-11-19 07:33:25,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30575 conditions, 8886 events. 6204/8886 cut-off events. For 17599/19087 co-relation queries the response was YES. Maximal size of possible extension queue 557. Compared 50911 event pairs, 1177 based on Foata normal form. 1182/9495 useless extension candidates. Maximal degree in co-relation 30565. Up to 5262 conditions per place. [2023-11-19 07:33:25,786 INFO L140 encePairwiseOnDemand]: 291/298 looper letters, 125 selfloop transitions, 10 changer transitions 4/148 dead transitions. [2023-11-19 07:33:25,787 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 148 transitions, 1161 flow [2023-11-19 07:33:25,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:33:25,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-19 07:33:25,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 703 transitions. [2023-11-19 07:33:25,791 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47181208053691276 [2023-11-19 07:33:25,791 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 703 transitions. [2023-11-19 07:33:25,791 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 703 transitions. [2023-11-19 07:33:25,792 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:33:25,792 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 703 transitions. [2023-11-19 07:33:25,794 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 140.6) internal successors, (703), 5 states have internal predecessors, (703), 0 states have call successors, (0), 0 states 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 07:33:25,798 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 298.0) internal successors, (1788), 6 states have internal predecessors, (1788), 0 states have call successors, (0), 0 states 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 07:33:25,799 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 298.0) internal successors, (1788), 6 states have internal predecessors, (1788), 0 states have call successors, (0), 0 states 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 07:33:25,799 INFO L175 Difference]: Start difference. First operand has 52 places, 56 transitions, 328 flow. Second operand 5 states and 703 transitions. [2023-11-19 07:33:25,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 148 transitions, 1161 flow [2023-11-19 07:33:25,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 148 transitions, 1107 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-19 07:33:25,812 INFO L231 Difference]: Finished difference. Result has 57 places, 64 transitions, 382 flow [2023-11-19 07:33:25,812 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=303, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=382, PETRI_PLACES=57, PETRI_TRANSITIONS=64} [2023-11-19 07:33:25,813 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 5 predicate places. [2023-11-19 07:33:25,813 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 64 transitions, 382 flow [2023-11-19 07:33:25,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 130.5) internal successors, (522), 4 states have internal predecessors, (522), 0 states have call successors, (0), 0 states 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 07:33:25,814 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:33:25,814 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:33:25,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-19 07:33:25,815 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 07:33:25,815 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:33:25,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1137043885, now seen corresponding path program 1 times [2023-11-19 07:33:25,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:33:25,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640173816] [2023-11-19 07:33:25,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:33:25,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:33:25,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:26,041 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 07:33:26,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:33:26,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640173816] [2023-11-19 07:33:26,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640173816] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:33:26,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:33:26,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:33:26,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461354793] [2023-11-19 07:33:26,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:33:26,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:33:26,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:33:26,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:33:26,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:33:26,065 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 298 [2023-11-19 07:33:26,066 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 64 transitions, 382 flow. Second operand has 5 states, 5 states have (on average 130.0) internal successors, (650), 5 states have internal predecessors, (650), 0 states have call successors, (0), 0 states 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 07:33:26,066 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:33:26,066 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 298 [2023-11-19 07:33:26,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:33:27,291 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([471] L827-->L834: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_149 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0)))) (let ((.cse0 (and (not (= (mod v_~x$w_buff0_used~0_150 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5)) (.cse1 (and .cse3 (not (= 0 (mod v_~x$w_buff1_used~0_129 256)))))) (and (= v_~x~0_87 (ite .cse0 v_~x$w_buff0~0_56 (ite .cse1 v_~x$w_buff1~0_51 v_~x~0_88))) (= v_~x$w_buff0_used~0_149 (ite .cse0 0 v_~x$w_buff0_used~0_150)) (= (ite .cse2 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_129) v_~x$w_buff1_used~0_128) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_128 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)))) 0 v_~x$r_buff1_thd4~0_20))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_56, ~x$w_buff1~0=v_~x$w_buff1~0_51, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_129, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_88, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_150} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_56, ~x$w_buff1~0=v_~x$w_buff1~0_51, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_128, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_87, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_149} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][114], [P1Thread1of1ForFork0InUse, Black: 193#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 192#(and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), 79#L2true, Black: 172#(= ~__unbuffered_p3_EAX~0 0), Black: 201#(and (= ~x$w_buff1_used~0 0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0)), 225#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 106#L834true, Black: 210#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 85#P0EXITtrue, Black: 209#(= ~__unbuffered_cnt~0 0), Black: 212#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 180#(and (not (= |ULTIMATE.start_main_~#t738~0#1.base| |ULTIMATE.start_main_~#t737~0#1.base|)) (not (= |ULTIMATE.start_main_~#t740~0#1.base| |ULTIMATE.start_main_~#t738~0#1.base|)) (not (= |ULTIMATE.start_main_~#t740~0#1.base| |ULTIMATE.start_main_~#t737~0#1.base|)) (not (= |ULTIMATE.start_main_~#t740~0#1.base| |ULTIMATE.start_main_~#t739~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t739~0#1.base| 0) |ULTIMATE.start_main_~#t737~0#1.base| 0) |ULTIMATE.start_main_~#t740~0#1.base| 0) |ULTIMATE.start_main_~#t738~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t739~0#1.base| |ULTIMATE.start_main_~#t737~0#1.base|)) (not (= |ULTIMATE.start_main_~#t739~0#1.base| |ULTIMATE.start_main_~#t738~0#1.base|))), 128#L784true, 123#L811true, 207#true, P0Thread1of1ForFork2InUse, Black: 184#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x~0)) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), P3Thread1of1ForFork1InUse, 163#true, 188#true, P2Thread1of1ForFork3InUse]) [2023-11-19 07:33:27,291 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-11-19 07:33:27,291 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-19 07:33:27,291 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-19 07:33:27,291 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-19 07:33:27,325 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([471] L827-->L834: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_149 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0)))) (let ((.cse0 (and (not (= (mod v_~x$w_buff0_used~0_150 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5)) (.cse1 (and .cse3 (not (= 0 (mod v_~x$w_buff1_used~0_129 256)))))) (and (= v_~x~0_87 (ite .cse0 v_~x$w_buff0~0_56 (ite .cse1 v_~x$w_buff1~0_51 v_~x~0_88))) (= v_~x$w_buff0_used~0_149 (ite .cse0 0 v_~x$w_buff0_used~0_150)) (= (ite .cse2 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_129) v_~x$w_buff1_used~0_128) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_128 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)))) 0 v_~x$r_buff1_thd4~0_20))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_56, ~x$w_buff1~0=v_~x$w_buff1~0_51, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_129, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_88, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_150} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_56, ~x$w_buff1~0=v_~x$w_buff1~0_51, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_128, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_87, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_149} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][114], [P1Thread1of1ForFork0InUse, Black: 193#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 192#(and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), 79#L2true, 210#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 201#(and (= ~x$w_buff1_used~0 0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0)), Black: 172#(= ~__unbuffered_p3_EAX~0 0), 225#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 106#L834true, 85#P0EXITtrue, Black: 209#(= ~__unbuffered_cnt~0 0), Black: 212#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 180#(and (not (= |ULTIMATE.start_main_~#t738~0#1.base| |ULTIMATE.start_main_~#t737~0#1.base|)) (not (= |ULTIMATE.start_main_~#t740~0#1.base| |ULTIMATE.start_main_~#t738~0#1.base|)) (not (= |ULTIMATE.start_main_~#t740~0#1.base| |ULTIMATE.start_main_~#t737~0#1.base|)) (not (= |ULTIMATE.start_main_~#t740~0#1.base| |ULTIMATE.start_main_~#t739~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t739~0#1.base| 0) |ULTIMATE.start_main_~#t737~0#1.base| 0) |ULTIMATE.start_main_~#t740~0#1.base| 0) |ULTIMATE.start_main_~#t738~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t739~0#1.base| |ULTIMATE.start_main_~#t737~0#1.base|)) (not (= |ULTIMATE.start_main_~#t739~0#1.base| |ULTIMATE.start_main_~#t738~0#1.base|))), 128#L784true, 123#L811true, P0Thread1of1ForFork2InUse, Black: 184#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x~0)) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), P3Thread1of1ForFork1InUse, 188#true, 163#true, P2Thread1of1ForFork3InUse]) [2023-11-19 07:33:27,325 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-11-19 07:33:27,325 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-19 07:33:27,325 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-19 07:33:27,326 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-19 07:33:27,371 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([471] L827-->L834: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_149 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0)))) (let ((.cse0 (and (not (= (mod v_~x$w_buff0_used~0_150 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5)) (.cse1 (and .cse3 (not (= 0 (mod v_~x$w_buff1_used~0_129 256)))))) (and (= v_~x~0_87 (ite .cse0 v_~x$w_buff0~0_56 (ite .cse1 v_~x$w_buff1~0_51 v_~x~0_88))) (= v_~x$w_buff0_used~0_149 (ite .cse0 0 v_~x$w_buff0_used~0_150)) (= (ite .cse2 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_129) v_~x$w_buff1_used~0_128) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_128 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)))) 0 v_~x$r_buff1_thd4~0_20))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_56, ~x$w_buff1~0=v_~x$w_buff1~0_51, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_129, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_88, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_150} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_56, ~x$w_buff1~0=v_~x$w_buff1~0_51, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_128, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_87, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_149} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][172], [P1Thread1of1ForFork0InUse, Black: 193#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 192#(and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), 79#L2true, Black: 172#(= ~__unbuffered_p3_EAX~0 0), Black: 201#(and (= ~x$w_buff1_used~0 0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0)), 106#L834true, Black: 210#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 85#P0EXITtrue, Black: 209#(= ~__unbuffered_cnt~0 0), 67#P2EXITtrue, Black: 212#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 221#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 180#(and (not (= |ULTIMATE.start_main_~#t738~0#1.base| |ULTIMATE.start_main_~#t737~0#1.base|)) (not (= |ULTIMATE.start_main_~#t740~0#1.base| |ULTIMATE.start_main_~#t738~0#1.base|)) (not (= |ULTIMATE.start_main_~#t740~0#1.base| |ULTIMATE.start_main_~#t737~0#1.base|)) (not (= |ULTIMATE.start_main_~#t740~0#1.base| |ULTIMATE.start_main_~#t739~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t739~0#1.base| 0) |ULTIMATE.start_main_~#t737~0#1.base| 0) |ULTIMATE.start_main_~#t740~0#1.base| 0) |ULTIMATE.start_main_~#t738~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t739~0#1.base| |ULTIMATE.start_main_~#t737~0#1.base|)) (not (= |ULTIMATE.start_main_~#t739~0#1.base| |ULTIMATE.start_main_~#t738~0#1.base|))), 128#L784true, 207#true, P0Thread1of1ForFork2InUse, Black: 184#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x~0)) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), P3Thread1of1ForFork1InUse, 163#true, 188#true, P2Thread1of1ForFork3InUse]) [2023-11-19 07:33:27,371 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-11-19 07:33:27,371 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-19 07:33:27,372 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-19 07:33:27,372 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-19 07:33:27,401 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([471] L827-->L834: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_149 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0)))) (let ((.cse0 (and (not (= (mod v_~x$w_buff0_used~0_150 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5)) (.cse1 (and .cse3 (not (= 0 (mod v_~x$w_buff1_used~0_129 256)))))) (and (= v_~x~0_87 (ite .cse0 v_~x$w_buff0~0_56 (ite .cse1 v_~x$w_buff1~0_51 v_~x~0_88))) (= v_~x$w_buff0_used~0_149 (ite .cse0 0 v_~x$w_buff0_used~0_150)) (= (ite .cse2 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_129) v_~x$w_buff1_used~0_128) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_128 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)))) 0 v_~x$r_buff1_thd4~0_20))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_56, ~x$w_buff1~0=v_~x$w_buff1~0_51, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_129, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_88, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_150} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_56, ~x$w_buff1~0=v_~x$w_buff1~0_51, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_128, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_87, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_149} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][172], [P1Thread1of1ForFork0InUse, Black: 193#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 192#(and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), 79#L2true, 210#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 172#(= ~__unbuffered_p3_EAX~0 0), Black: 201#(and (= ~x$w_buff1_used~0 0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0)), 106#L834true, 85#P0EXITtrue, Black: 209#(= ~__unbuffered_cnt~0 0), 67#P2EXITtrue, Black: 212#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 221#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 180#(and (not (= |ULTIMATE.start_main_~#t738~0#1.base| |ULTIMATE.start_main_~#t737~0#1.base|)) (not (= |ULTIMATE.start_main_~#t740~0#1.base| |ULTIMATE.start_main_~#t738~0#1.base|)) (not (= |ULTIMATE.start_main_~#t740~0#1.base| |ULTIMATE.start_main_~#t737~0#1.base|)) (not (= |ULTIMATE.start_main_~#t740~0#1.base| |ULTIMATE.start_main_~#t739~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t739~0#1.base| 0) |ULTIMATE.start_main_~#t737~0#1.base| 0) |ULTIMATE.start_main_~#t740~0#1.base| 0) |ULTIMATE.start_main_~#t738~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t739~0#1.base| |ULTIMATE.start_main_~#t737~0#1.base|)) (not (= |ULTIMATE.start_main_~#t739~0#1.base| |ULTIMATE.start_main_~#t738~0#1.base|))), 128#L784true, P0Thread1of1ForFork2InUse, Black: 184#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x~0)) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), P3Thread1of1ForFork1InUse, 163#true, 188#true, P2Thread1of1ForFork3InUse]) [2023-11-19 07:33:27,401 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-11-19 07:33:27,402 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-19 07:33:27,402 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-19 07:33:27,402 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-19 07:33:27,409 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([471] L827-->L834: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_149 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0)))) (let ((.cse0 (and (not (= (mod v_~x$w_buff0_used~0_150 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5)) (.cse1 (and .cse3 (not (= 0 (mod v_~x$w_buff1_used~0_129 256)))))) (and (= v_~x~0_87 (ite .cse0 v_~x$w_buff0~0_56 (ite .cse1 v_~x$w_buff1~0_51 v_~x~0_88))) (= v_~x$w_buff0_used~0_149 (ite .cse0 0 v_~x$w_buff0_used~0_150)) (= (ite .cse2 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_129) v_~x$w_buff1_used~0_128) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_128 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)))) 0 v_~x$r_buff1_thd4~0_20))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_56, ~x$w_buff1~0=v_~x$w_buff1~0_51, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_129, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_88, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_150} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_56, ~x$w_buff1~0=v_~x$w_buff1~0_51, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_128, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_87, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_149} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][172], [P1Thread1of1ForFork0InUse, Black: 193#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 192#(and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), 79#L2true, Black: 172#(= ~__unbuffered_p3_EAX~0 0), Black: 201#(and (= ~x$w_buff1_used~0 0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0)), 150#L804true, 106#L834true, Black: 210#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 85#P0EXITtrue, 39#P1EXITtrue, Black: 209#(= ~__unbuffered_cnt~0 0), 180#(and (not (= |ULTIMATE.start_main_~#t738~0#1.base| |ULTIMATE.start_main_~#t737~0#1.base|)) (not (= |ULTIMATE.start_main_~#t740~0#1.base| |ULTIMATE.start_main_~#t738~0#1.base|)) (not (= |ULTIMATE.start_main_~#t740~0#1.base| |ULTIMATE.start_main_~#t737~0#1.base|)) (not (= |ULTIMATE.start_main_~#t740~0#1.base| |ULTIMATE.start_main_~#t739~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t739~0#1.base| 0) |ULTIMATE.start_main_~#t737~0#1.base| 0) |ULTIMATE.start_main_~#t740~0#1.base| 0) |ULTIMATE.start_main_~#t738~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t739~0#1.base| |ULTIMATE.start_main_~#t737~0#1.base|)) (not (= |ULTIMATE.start_main_~#t739~0#1.base| |ULTIMATE.start_main_~#t738~0#1.base|))), 221#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 212#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 207#true, P0Thread1of1ForFork2InUse, Black: 184#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x~0)) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), P3Thread1of1ForFork1InUse, 163#true, 188#true, P2Thread1of1ForFork3InUse]) [2023-11-19 07:33:27,409 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-11-19 07:33:27,409 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-19 07:33:27,409 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-19 07:33:27,409 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-19 07:33:27,516 INFO L124 PetriNetUnfolderBase]: 4797/7047 cut-off events. [2023-11-19 07:33:27,516 INFO L125 PetriNetUnfolderBase]: For 17343/19348 co-relation queries the response was YES. [2023-11-19 07:33:27,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26946 conditions, 7047 events. 4797/7047 cut-off events. For 17343/19348 co-relation queries the response was YES. Maximal size of possible extension queue 428. Compared 40590 event pairs, 454 based on Foata normal form. 1086/7777 useless extension candidates. Maximal degree in co-relation 26933. Up to 3095 conditions per place. [2023-11-19 07:33:27,576 INFO L140 encePairwiseOnDemand]: 291/298 looper letters, 161 selfloop transitions, 19 changer transitions 12/201 dead transitions. [2023-11-19 07:33:27,577 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 201 transitions, 1607 flow [2023-11-19 07:33:27,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:33:27,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-19 07:33:27,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 986 transitions. [2023-11-19 07:33:27,582 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4726749760306807 [2023-11-19 07:33:27,582 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 986 transitions. [2023-11-19 07:33:27,583 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 986 transitions. [2023-11-19 07:33:27,584 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:33:27,584 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 986 transitions. [2023-11-19 07:33:27,588 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 140.85714285714286) internal successors, (986), 7 states have internal predecessors, (986), 0 states have call successors, (0), 0 states 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 07:33:27,593 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 298.0) internal successors, (2384), 8 states have internal predecessors, (2384), 0 states have call successors, (0), 0 states 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 07:33:27,594 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 298.0) internal successors, (2384), 8 states have internal predecessors, (2384), 0 states have call successors, (0), 0 states 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 07:33:27,595 INFO L175 Difference]: Start difference. First operand has 57 places, 64 transitions, 382 flow. Second operand 7 states and 986 transitions. [2023-11-19 07:33:27,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 201 transitions, 1607 flow [2023-11-19 07:33:27,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 201 transitions, 1602 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-19 07:33:27,628 INFO L231 Difference]: Finished difference. Result has 65 places, 73 transitions, 513 flow [2023-11-19 07:33:27,628 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=377, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=513, PETRI_PLACES=65, PETRI_TRANSITIONS=73} [2023-11-19 07:33:27,629 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 13 predicate places. [2023-11-19 07:33:27,629 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 73 transitions, 513 flow [2023-11-19 07:33:27,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 130.0) internal successors, (650), 5 states have internal predecessors, (650), 0 states have call successors, (0), 0 states 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 07:33:27,630 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:33:27,630 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:33:27,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-19 07:33:27,630 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 07:33:27,631 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:33:27,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1801675370, now seen corresponding path program 1 times [2023-11-19 07:33:27,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:33:27,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753341160] [2023-11-19 07:33:27,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:33:27,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:33:27,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:27,924 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 07:33:27,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:33:27,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753341160] [2023-11-19 07:33:27,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753341160] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:33:27,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:33:27,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:33:27,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341768731] [2023-11-19 07:33:27,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:33:27,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:33:27,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:33:27,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:33:27,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:33:27,950 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 298 [2023-11-19 07:33:27,952 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 73 transitions, 513 flow. Second operand has 6 states, 6 states have (on average 129.83333333333334) internal successors, (779), 6 states have internal predecessors, (779), 0 states have call successors, (0), 0 states 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 07:33:27,952 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:33:27,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 298 [2023-11-19 07:33:27,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:33:28,867 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([471] L827-->L834: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_149 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0)))) (let ((.cse0 (and (not (= (mod v_~x$w_buff0_used~0_150 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5)) (.cse1 (and .cse3 (not (= 0 (mod v_~x$w_buff1_used~0_129 256)))))) (and (= v_~x~0_87 (ite .cse0 v_~x$w_buff0~0_56 (ite .cse1 v_~x$w_buff1~0_51 v_~x~0_88))) (= v_~x$w_buff0_used~0_149 (ite .cse0 0 v_~x$w_buff0_used~0_150)) (= (ite .cse2 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_129) v_~x$w_buff1_used~0_128) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_128 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)))) 0 v_~x$r_buff1_thd4~0_20))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_56, ~x$w_buff1~0=v_~x$w_buff1~0_51, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_129, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_88, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_150} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_56, ~x$w_buff1~0=v_~x$w_buff1~0_51, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_128, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_87, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_149} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][114], [P1Thread1of1ForFork0InUse, Black: 193#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 192#(and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), Black: 220#(<= ~__unbuffered_cnt~0 1), Black: 221#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 79#L2true, 239#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 201#(and (= ~x$w_buff1_used~0 0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0)), Black: 172#(= ~__unbuffered_p3_EAX~0 0), 225#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 106#L834true, Black: 210#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 85#P0EXITtrue, Black: 209#(= ~__unbuffered_cnt~0 0), 180#(and (not (= |ULTIMATE.start_main_~#t738~0#1.base| |ULTIMATE.start_main_~#t737~0#1.base|)) (not (= |ULTIMATE.start_main_~#t740~0#1.base| |ULTIMATE.start_main_~#t738~0#1.base|)) (not (= |ULTIMATE.start_main_~#t740~0#1.base| |ULTIMATE.start_main_~#t737~0#1.base|)) (not (= |ULTIMATE.start_main_~#t740~0#1.base| |ULTIMATE.start_main_~#t739~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t739~0#1.base| 0) |ULTIMATE.start_main_~#t737~0#1.base| 0) |ULTIMATE.start_main_~#t740~0#1.base| 0) |ULTIMATE.start_main_~#t738~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t739~0#1.base| |ULTIMATE.start_main_~#t737~0#1.base|)) (not (= |ULTIMATE.start_main_~#t739~0#1.base| |ULTIMATE.start_main_~#t738~0#1.base|))), Black: 212#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 123#L811true, 128#L784true, Black: 184#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x~0)) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork2InUse, P3Thread1of1ForFork1InUse, 188#true, 163#true, P2Thread1of1ForFork3InUse]) [2023-11-19 07:33:28,867 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-11-19 07:33:28,867 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-19 07:33:28,867 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-19 07:33:28,867 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-19 07:33:28,895 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([471] L827-->L834: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_149 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0)))) (let ((.cse0 (and (not (= (mod v_~x$w_buff0_used~0_150 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5)) (.cse1 (and .cse3 (not (= 0 (mod v_~x$w_buff1_used~0_129 256)))))) (and (= v_~x~0_87 (ite .cse0 v_~x$w_buff0~0_56 (ite .cse1 v_~x$w_buff1~0_51 v_~x~0_88))) (= v_~x$w_buff0_used~0_149 (ite .cse0 0 v_~x$w_buff0_used~0_150)) (= (ite .cse2 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_129) v_~x$w_buff1_used~0_128) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_128 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)))) 0 v_~x$r_buff1_thd4~0_20))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_56, ~x$w_buff1~0=v_~x$w_buff1~0_51, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_129, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_88, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_150} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_56, ~x$w_buff1~0=v_~x$w_buff1~0_51, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_128, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_87, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_149} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][114], [P1Thread1of1ForFork0InUse, Black: 193#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 192#(and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), Black: 220#(<= ~__unbuffered_cnt~0 1), Black: 221#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 79#L2true, 210#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 239#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 201#(and (= ~x$w_buff1_used~0 0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0)), Black: 172#(= ~__unbuffered_p3_EAX~0 0), 225#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 106#L834true, 85#P0EXITtrue, Black: 209#(= ~__unbuffered_cnt~0 0), 180#(and (not (= |ULTIMATE.start_main_~#t738~0#1.base| |ULTIMATE.start_main_~#t737~0#1.base|)) (not (= |ULTIMATE.start_main_~#t740~0#1.base| |ULTIMATE.start_main_~#t738~0#1.base|)) (not (= |ULTIMATE.start_main_~#t740~0#1.base| |ULTIMATE.start_main_~#t737~0#1.base|)) (not (= |ULTIMATE.start_main_~#t740~0#1.base| |ULTIMATE.start_main_~#t739~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t739~0#1.base| 0) |ULTIMATE.start_main_~#t737~0#1.base| 0) |ULTIMATE.start_main_~#t740~0#1.base| 0) |ULTIMATE.start_main_~#t738~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t739~0#1.base| |ULTIMATE.start_main_~#t737~0#1.base|)) (not (= |ULTIMATE.start_main_~#t739~0#1.base| |ULTIMATE.start_main_~#t738~0#1.base|))), Black: 212#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 128#L784true, 123#L811true, Black: 184#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x~0)) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork2InUse, P3Thread1of1ForFork1InUse, 188#true, 163#true, P2Thread1of1ForFork3InUse]) [2023-11-19 07:33:28,895 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-11-19 07:33:28,896 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-19 07:33:28,896 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-19 07:33:28,896 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-19 07:33:28,933 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([471] L827-->L834: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_149 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0)))) (let ((.cse0 (and (not (= (mod v_~x$w_buff0_used~0_150 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5)) (.cse1 (and .cse3 (not (= 0 (mod v_~x$w_buff1_used~0_129 256)))))) (and (= v_~x~0_87 (ite .cse0 v_~x$w_buff0~0_56 (ite .cse1 v_~x$w_buff1~0_51 v_~x~0_88))) (= v_~x$w_buff0_used~0_149 (ite .cse0 0 v_~x$w_buff0_used~0_150)) (= (ite .cse2 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_129) v_~x$w_buff1_used~0_128) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_128 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)))) 0 v_~x$r_buff1_thd4~0_20))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_56, ~x$w_buff1~0=v_~x$w_buff1~0_51, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_129, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_88, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_150} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_56, ~x$w_buff1~0=v_~x$w_buff1~0_51, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_128, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_87, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_149} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][171], [P1Thread1of1ForFork0InUse, Black: 225#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 193#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 192#(and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), Black: 220#(<= ~__unbuffered_cnt~0 1), 79#L2true, Black: 172#(= ~__unbuffered_p3_EAX~0 0), Black: 201#(and (= ~x$w_buff1_used~0 0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0)), 106#L834true, Black: 210#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 85#P0EXITtrue, 241#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 209#(= ~__unbuffered_cnt~0 0), 180#(and (not (= |ULTIMATE.start_main_~#t738~0#1.base| |ULTIMATE.start_main_~#t737~0#1.base|)) (not (= |ULTIMATE.start_main_~#t740~0#1.base| |ULTIMATE.start_main_~#t738~0#1.base|)) (not (= |ULTIMATE.start_main_~#t740~0#1.base| |ULTIMATE.start_main_~#t737~0#1.base|)) (not (= |ULTIMATE.start_main_~#t740~0#1.base| |ULTIMATE.start_main_~#t739~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t739~0#1.base| 0) |ULTIMATE.start_main_~#t737~0#1.base| 0) |ULTIMATE.start_main_~#t740~0#1.base| 0) |ULTIMATE.start_main_~#t738~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t739~0#1.base| |ULTIMATE.start_main_~#t737~0#1.base|)) (not (= |ULTIMATE.start_main_~#t739~0#1.base| |ULTIMATE.start_main_~#t738~0#1.base|))), 221#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 67#P2EXITtrue, Black: 212#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 128#L784true, Black: 184#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x~0)) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork2InUse, P3Thread1of1ForFork1InUse, 163#true, 188#true, P2Thread1of1ForFork3InUse]) [2023-11-19 07:33:28,933 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-11-19 07:33:28,933 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-19 07:33:28,933 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-19 07:33:28,934 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-19 07:33:28,957 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([471] L827-->L834: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_149 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0)))) (let ((.cse0 (and (not (= (mod v_~x$w_buff0_used~0_150 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5)) (.cse1 (and .cse3 (not (= 0 (mod v_~x$w_buff1_used~0_129 256)))))) (and (= v_~x~0_87 (ite .cse0 v_~x$w_buff0~0_56 (ite .cse1 v_~x$w_buff1~0_51 v_~x~0_88))) (= v_~x$w_buff0_used~0_149 (ite .cse0 0 v_~x$w_buff0_used~0_150)) (= (ite .cse2 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_129) v_~x$w_buff1_used~0_128) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_128 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)))) 0 v_~x$r_buff1_thd4~0_20))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_56, ~x$w_buff1~0=v_~x$w_buff1~0_51, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_129, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_88, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_150} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_56, ~x$w_buff1~0=v_~x$w_buff1~0_51, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_128, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_87, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_149} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][171], [P1Thread1of1ForFork0InUse, Black: 225#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 193#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 192#(and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), Black: 220#(<= ~__unbuffered_cnt~0 1), 79#L2true, 210#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 172#(= ~__unbuffered_p3_EAX~0 0), Black: 201#(and (= ~x$w_buff1_used~0 0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0)), 106#L834true, 85#P0EXITtrue, 241#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 209#(= ~__unbuffered_cnt~0 0), 180#(and (not (= |ULTIMATE.start_main_~#t738~0#1.base| |ULTIMATE.start_main_~#t737~0#1.base|)) (not (= |ULTIMATE.start_main_~#t740~0#1.base| |ULTIMATE.start_main_~#t738~0#1.base|)) (not (= |ULTIMATE.start_main_~#t740~0#1.base| |ULTIMATE.start_main_~#t737~0#1.base|)) (not (= |ULTIMATE.start_main_~#t740~0#1.base| |ULTIMATE.start_main_~#t739~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t739~0#1.base| 0) |ULTIMATE.start_main_~#t737~0#1.base| 0) |ULTIMATE.start_main_~#t740~0#1.base| 0) |ULTIMATE.start_main_~#t738~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t739~0#1.base| |ULTIMATE.start_main_~#t737~0#1.base|)) (not (= |ULTIMATE.start_main_~#t739~0#1.base| |ULTIMATE.start_main_~#t738~0#1.base|))), 221#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 67#P2EXITtrue, Black: 212#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 128#L784true, Black: 184#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x~0)) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork2InUse, P3Thread1of1ForFork1InUse, 163#true, 188#true, P2Thread1of1ForFork3InUse]) [2023-11-19 07:33:28,958 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-11-19 07:33:28,958 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-19 07:33:28,958 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-19 07:33:28,958 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-19 07:33:28,964 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([471] L827-->L834: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_149 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0)))) (let ((.cse0 (and (not (= (mod v_~x$w_buff0_used~0_150 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5)) (.cse1 (and .cse3 (not (= 0 (mod v_~x$w_buff1_used~0_129 256)))))) (and (= v_~x~0_87 (ite .cse0 v_~x$w_buff0~0_56 (ite .cse1 v_~x$w_buff1~0_51 v_~x~0_88))) (= v_~x$w_buff0_used~0_149 (ite .cse0 0 v_~x$w_buff0_used~0_150)) (= (ite .cse2 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_129) v_~x$w_buff1_used~0_128) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_128 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)))) 0 v_~x$r_buff1_thd4~0_20))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_56, ~x$w_buff1~0=v_~x$w_buff1~0_51, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_129, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_88, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_150} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_56, ~x$w_buff1~0=v_~x$w_buff1~0_51, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_128, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_87, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_149} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][171], [P1Thread1of1ForFork0InUse, Black: 193#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 225#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 192#(and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), Black: 220#(<= ~__unbuffered_cnt~0 1), 79#L2true, Black: 201#(and (= ~x$w_buff1_used~0 0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0)), Black: 172#(= ~__unbuffered_p3_EAX~0 0), 150#L804true, 106#L834true, Black: 210#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 241#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 85#P0EXITtrue, 39#P1EXITtrue, Black: 209#(= ~__unbuffered_cnt~0 0), 180#(and (not (= |ULTIMATE.start_main_~#t738~0#1.base| |ULTIMATE.start_main_~#t737~0#1.base|)) (not (= |ULTIMATE.start_main_~#t740~0#1.base| |ULTIMATE.start_main_~#t738~0#1.base|)) (not (= |ULTIMATE.start_main_~#t740~0#1.base| |ULTIMATE.start_main_~#t737~0#1.base|)) (not (= |ULTIMATE.start_main_~#t740~0#1.base| |ULTIMATE.start_main_~#t739~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t739~0#1.base| 0) |ULTIMATE.start_main_~#t737~0#1.base| 0) |ULTIMATE.start_main_~#t740~0#1.base| 0) |ULTIMATE.start_main_~#t738~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t739~0#1.base| |ULTIMATE.start_main_~#t737~0#1.base|)) (not (= |ULTIMATE.start_main_~#t739~0#1.base| |ULTIMATE.start_main_~#t738~0#1.base|))), 221#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 212#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P0Thread1of1ForFork2InUse, Black: 184#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x~0)) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), P3Thread1of1ForFork1InUse, 163#true, 188#true, P2Thread1of1ForFork3InUse]) [2023-11-19 07:33:28,964 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-11-19 07:33:28,964 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-19 07:33:28,964 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-19 07:33:28,964 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-19 07:33:29,056 INFO L124 PetriNetUnfolderBase]: 4374/6437 cut-off events. [2023-11-19 07:33:29,056 INFO L125 PetriNetUnfolderBase]: For 19666/21752 co-relation queries the response was YES. [2023-11-19 07:33:29,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26913 conditions, 6437 events. 4374/6437 cut-off events. For 19666/21752 co-relation queries the response was YES. Maximal size of possible extension queue 418. Compared 36973 event pairs, 332 based on Foata normal form. 810/6944 useless extension candidates. Maximal degree in co-relation 26897. Up to 2945 conditions per place. [2023-11-19 07:33:29,125 INFO L140 encePairwiseOnDemand]: 291/298 looper letters, 170 selfloop transitions, 27 changer transitions 26/232 dead transitions. [2023-11-19 07:33:29,125 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 232 transitions, 1957 flow [2023-11-19 07:33:29,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-19 07:33:29,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-19 07:33:29,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1267 transitions. [2023-11-19 07:33:29,132 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47240865026099926 [2023-11-19 07:33:29,132 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1267 transitions. [2023-11-19 07:33:29,132 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1267 transitions. [2023-11-19 07:33:29,134 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:33:29,134 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1267 transitions. [2023-11-19 07:33:29,138 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 140.77777777777777) internal successors, (1267), 9 states have internal predecessors, (1267), 0 states have call successors, (0), 0 states 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 07:33:29,145 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 298.0) internal successors, (2980), 10 states have internal predecessors, (2980), 0 states have call successors, (0), 0 states 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 07:33:29,148 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 298.0) internal successors, (2980), 10 states have internal predecessors, (2980), 0 states have call successors, (0), 0 states 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 07:33:29,149 INFO L175 Difference]: Start difference. First operand has 65 places, 73 transitions, 513 flow. Second operand 9 states and 1267 transitions. [2023-11-19 07:33:29,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 232 transitions, 1957 flow [2023-11-19 07:33:29,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 232 transitions, 1912 flow, removed 17 selfloop flow, removed 2 redundant places. [2023-11-19 07:33:29,385 INFO L231 Difference]: Finished difference. Result has 74 places, 81 transitions, 636 flow [2023-11-19 07:33:29,386 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=468, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=636, PETRI_PLACES=74, PETRI_TRANSITIONS=81} [2023-11-19 07:33:29,387 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 22 predicate places. [2023-11-19 07:33:29,387 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 81 transitions, 636 flow [2023-11-19 07:33:29,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 129.83333333333334) internal successors, (779), 6 states have internal predecessors, (779), 0 states have call successors, (0), 0 states 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 07:33:29,388 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:33:29,388 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:33:29,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-19 07:33:29,389 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 07:33:29,389 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:33:29,389 INFO L85 PathProgramCache]: Analyzing trace with hash 636863240, now seen corresponding path program 1 times [2023-11-19 07:33:29,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:33:29,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754479857] [2023-11-19 07:33:29,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:33:29,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:33:29,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:29,678 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 07:33:29,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:33:29,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754479857] [2023-11-19 07:33:29,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754479857] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:33:29,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:33:29,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:33:29,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840529194] [2023-11-19 07:33:29,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:33:29,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:33:29,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:33:29,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:33:29,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:33:29,687 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 298 [2023-11-19 07:33:29,688 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 81 transitions, 636 flow. Second operand has 4 states, 4 states have (on average 135.25) internal successors, (541), 4 states have internal predecessors, (541), 0 states have call successors, (0), 0 states 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 07:33:29,689 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:33:29,689 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 298 [2023-11-19 07:33:29,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:33:31,186 INFO L124 PetriNetUnfolderBase]: 6846/10283 cut-off events. [2023-11-19 07:33:31,186 INFO L125 PetriNetUnfolderBase]: For 30965/31933 co-relation queries the response was YES. [2023-11-19 07:33:31,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43546 conditions, 10283 events. 6846/10283 cut-off events. For 30965/31933 co-relation queries the response was YES. Maximal size of possible extension queue 642. Compared 64919 event pairs, 1073 based on Foata normal form. 324/10101 useless extension candidates. Maximal degree in co-relation 43526. Up to 5352 conditions per place. [2023-11-19 07:33:31,268 INFO L140 encePairwiseOnDemand]: 295/298 looper letters, 112 selfloop transitions, 2 changer transitions 73/194 dead transitions. [2023-11-19 07:33:31,268 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 194 transitions, 1952 flow [2023-11-19 07:33:31,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:33:31,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 07:33:31,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 576 transitions. [2023-11-19 07:33:31,271 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48322147651006714 [2023-11-19 07:33:31,272 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 576 transitions. [2023-11-19 07:33:31,272 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 576 transitions. [2023-11-19 07:33:31,273 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:33:31,273 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 576 transitions. [2023-11-19 07:33:31,275 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 states 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 07:33:31,278 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 298.0) internal successors, (1490), 5 states have internal predecessors, (1490), 0 states have call successors, (0), 0 states 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 07:33:31,279 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 298.0) internal successors, (1490), 5 states have internal predecessors, (1490), 0 states have call successors, (0), 0 states 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 07:33:31,279 INFO L175 Difference]: Start difference. First operand has 74 places, 81 transitions, 636 flow. Second operand 4 states and 576 transitions. [2023-11-19 07:33:31,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 194 transitions, 1952 flow [2023-11-19 07:33:31,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 194 transitions, 1715 flow, removed 79 selfloop flow, removed 4 redundant places. [2023-11-19 07:33:31,853 INFO L231 Difference]: Finished difference. Result has 75 places, 74 transitions, 508 flow [2023-11-19 07:33:31,854 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=549, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=508, PETRI_PLACES=75, PETRI_TRANSITIONS=74} [2023-11-19 07:33:31,854 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 23 predicate places. [2023-11-19 07:33:31,855 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 74 transitions, 508 flow [2023-11-19 07:33:31,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 135.25) internal successors, (541), 4 states have internal predecessors, (541), 0 states have call successors, (0), 0 states 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 07:33:31,855 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:33:31,855 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:33:31,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-19 07:33:31,856 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 07:33:31,856 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:33:31,856 INFO L85 PathProgramCache]: Analyzing trace with hash -74325734, now seen corresponding path program 2 times [2023-11-19 07:33:31,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:33:31,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056809130] [2023-11-19 07:33:31,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:33:31,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:33:31,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:32,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:33:32,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:33:32,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056809130] [2023-11-19 07:33:32,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056809130] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:33:32,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:33:32,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 07:33:32,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58291803] [2023-11-19 07:33:32,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:33:32,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:33:32,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:33:32,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:33:32,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:33:32,175 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 298 [2023-11-19 07:33:32,176 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 74 transitions, 508 flow. Second operand has 7 states, 7 states have (on average 129.85714285714286) internal successors, (909), 7 states have internal predecessors, (909), 0 states have call successors, (0), 0 states 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 07:33:32,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:33:32,177 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 298 [2023-11-19 07:33:32,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:33:33,324 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([471] L827-->L834: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_149 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0)))) (let ((.cse0 (and (not (= (mod v_~x$w_buff0_used~0_150 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5)) (.cse1 (and .cse3 (not (= 0 (mod v_~x$w_buff1_used~0_129 256)))))) (and (= v_~x~0_87 (ite .cse0 v_~x$w_buff0~0_56 (ite .cse1 v_~x$w_buff1~0_51 v_~x~0_88))) (= v_~x$w_buff0_used~0_149 (ite .cse0 0 v_~x$w_buff0_used~0_150)) (= (ite .cse2 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_129) v_~x$w_buff1_used~0_128) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_128 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)))) 0 v_~x$r_buff1_thd4~0_20))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_56, ~x$w_buff1~0=v_~x$w_buff1~0_51, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_129, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_88, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_150} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_56, ~x$w_buff1~0=v_~x$w_buff1~0_51, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_128, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_87, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_149} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][111], [Black: 193#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 192#(and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), 251#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 79#L2true, 239#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 201#(and (= ~x$w_buff1_used~0 0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0)), 265#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 106#L834true, Black: 210#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 209#(= ~__unbuffered_cnt~0 0), Black: 212#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 180#(and (not (= |ULTIMATE.start_main_~#t738~0#1.base| |ULTIMATE.start_main_~#t737~0#1.base|)) (not (= |ULTIMATE.start_main_~#t740~0#1.base| |ULTIMATE.start_main_~#t738~0#1.base|)) (not (= |ULTIMATE.start_main_~#t740~0#1.base| |ULTIMATE.start_main_~#t737~0#1.base|)) (not (= |ULTIMATE.start_main_~#t740~0#1.base| |ULTIMATE.start_main_~#t739~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t739~0#1.base| 0) |ULTIMATE.start_main_~#t737~0#1.base| 0) |ULTIMATE.start_main_~#t740~0#1.base| 0) |ULTIMATE.start_main_~#t738~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t739~0#1.base| |ULTIMATE.start_main_~#t737~0#1.base|)) (not (= |ULTIMATE.start_main_~#t739~0#1.base| |ULTIMATE.start_main_~#t738~0#1.base|))), 128#L784true, P0Thread1of1ForFork2InUse, P3Thread1of1ForFork1InUse, 188#true, P2Thread1of1ForFork3InUse, P1Thread1of1ForFork0InUse, Black: 220#(<= ~__unbuffered_cnt~0 1), Black: 221#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 172#(= ~__unbuffered_p3_EAX~0 0), Black: 235#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 241#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 234#(<= ~__unbuffered_cnt~0 2), 85#P0EXITtrue, 123#L811true, Black: 184#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x~0)) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 248#(= ~a~0 1), 163#true]) [2023-11-19 07:33:33,325 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-11-19 07:33:33,325 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-19 07:33:33,325 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-19 07:33:33,325 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-19 07:33:33,408 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([471] L827-->L834: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_149 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0)))) (let ((.cse0 (and (not (= (mod v_~x$w_buff0_used~0_150 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5)) (.cse1 (and .cse3 (not (= 0 (mod v_~x$w_buff1_used~0_129 256)))))) (and (= v_~x~0_87 (ite .cse0 v_~x$w_buff0~0_56 (ite .cse1 v_~x$w_buff1~0_51 v_~x~0_88))) (= v_~x$w_buff0_used~0_149 (ite .cse0 0 v_~x$w_buff0_used~0_150)) (= (ite .cse2 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_129) v_~x$w_buff1_used~0_128) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_128 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)))) 0 v_~x$r_buff1_thd4~0_20))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_56, ~x$w_buff1~0=v_~x$w_buff1~0_51, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_129, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_88, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_150} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_56, ~x$w_buff1~0=v_~x$w_buff1~0_51, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_128, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_87, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_149} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][167], [Black: 193#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 192#(and (or (not (= 2 ~x~0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 2 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), 251#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 79#L2true, Black: 201#(and (= ~x$w_buff1_used~0 0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0)), 106#L834true, Black: 210#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 209#(= ~__unbuffered_cnt~0 0), Black: 212#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 180#(and (not (= |ULTIMATE.start_main_~#t738~0#1.base| |ULTIMATE.start_main_~#t737~0#1.base|)) (not (= |ULTIMATE.start_main_~#t740~0#1.base| |ULTIMATE.start_main_~#t738~0#1.base|)) (not (= |ULTIMATE.start_main_~#t740~0#1.base| |ULTIMATE.start_main_~#t737~0#1.base|)) (not (= |ULTIMATE.start_main_~#t740~0#1.base| |ULTIMATE.start_main_~#t739~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t739~0#1.base| 0) |ULTIMATE.start_main_~#t737~0#1.base| 0) |ULTIMATE.start_main_~#t740~0#1.base| 0) |ULTIMATE.start_main_~#t738~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t739~0#1.base| |ULTIMATE.start_main_~#t737~0#1.base|)) (not (= |ULTIMATE.start_main_~#t739~0#1.base| |ULTIMATE.start_main_~#t738~0#1.base|))), 67#P2EXITtrue, 128#L784true, P0Thread1of1ForFork2InUse, P3Thread1of1ForFork1InUse, 188#true, P2Thread1of1ForFork3InUse, P1Thread1of1ForFork0InUse, Black: 225#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 220#(<= ~__unbuffered_cnt~0 1), 267#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 172#(= ~__unbuffered_p3_EAX~0 0), Black: 235#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 234#(<= ~__unbuffered_cnt~0 2), 85#P0EXITtrue, 241#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 221#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 184#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x~0)) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 248#(= ~a~0 1), 163#true]) [2023-11-19 07:33:33,408 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-11-19 07:33:33,408 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-19 07:33:33,408 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-19 07:33:33,408 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-19 07:33:33,507 INFO L124 PetriNetUnfolderBase]: 4643/6903 cut-off events. [2023-11-19 07:33:33,507 INFO L125 PetriNetUnfolderBase]: For 19142/20696 co-relation queries the response was YES. [2023-11-19 07:33:33,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27722 conditions, 6903 events. 4643/6903 cut-off events. For 19142/20696 co-relation queries the response was YES. Maximal size of possible extension queue 471. Compared 42060 event pairs, 349 based on Foata normal form. 771/7418 useless extension candidates. Maximal degree in co-relation 27699. Up to 3395 conditions per place. [2023-11-19 07:33:33,554 INFO L140 encePairwiseOnDemand]: 291/298 looper letters, 137 selfloop transitions, 23 changer transitions 55/224 dead transitions. [2023-11-19 07:33:33,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 224 transitions, 1873 flow [2023-11-19 07:33:33,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-19 07:33:33,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-19 07:33:33,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1513 transitions. [2023-11-19 07:33:33,564 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46156192800488105 [2023-11-19 07:33:33,564 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1513 transitions. [2023-11-19 07:33:33,564 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1513 transitions. [2023-11-19 07:33:33,566 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:33:33,566 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1513 transitions. [2023-11-19 07:33:33,570 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 137.54545454545453) internal successors, (1513), 11 states have internal predecessors, (1513), 0 states have call successors, (0), 0 states 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 07:33:33,576 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 298.0) internal successors, (3576), 12 states have internal predecessors, (3576), 0 states have call successors, (0), 0 states 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 07:33:33,578 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 298.0) internal successors, (3576), 12 states have internal predecessors, (3576), 0 states have call successors, (0), 0 states 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 07:33:33,578 INFO L175 Difference]: Start difference. First operand has 75 places, 74 transitions, 508 flow. Second operand 11 states and 1513 transitions. [2023-11-19 07:33:33,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 224 transitions, 1873 flow [2023-11-19 07:33:33,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 224 transitions, 1828 flow, removed 7 selfloop flow, removed 6 redundant places. [2023-11-19 07:33:33,760 INFO L231 Difference]: Finished difference. Result has 80 places, 72 transitions, 517 flow [2023-11-19 07:33:33,760 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=465, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=517, PETRI_PLACES=80, PETRI_TRANSITIONS=72} [2023-11-19 07:33:33,761 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 28 predicate places. [2023-11-19 07:33:33,761 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 72 transitions, 517 flow [2023-11-19 07:33:33,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 129.85714285714286) internal successors, (909), 7 states have internal predecessors, (909), 0 states have call successors, (0), 0 states 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 07:33:33,762 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:33:33,762 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:33:33,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-19 07:33:33,763 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 07:33:33,763 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:33:33,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1396087582, now seen corresponding path program 1 times [2023-11-19 07:33:33,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:33:33,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329193960] [2023-11-19 07:33:33,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:33:33,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:33:33,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:34,009 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 07:33:34,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:33:34,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329193960] [2023-11-19 07:33:34,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329193960] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:33:34,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:33:34,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:33:34,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455149173] [2023-11-19 07:33:34,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:33:34,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:33:34,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:33:34,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:33:34,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:33:34,016 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 298 [2023-11-19 07:33:34,017 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 72 transitions, 517 flow. Second operand has 4 states, 4 states have (on average 136.0) internal successors, (544), 4 states have internal predecessors, (544), 0 states have call successors, (0), 0 states 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 07:33:34,017 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:33:34,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 298 [2023-11-19 07:33:34,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:33:35,288 INFO L124 PetriNetUnfolderBase]: 5511/8452 cut-off events. [2023-11-19 07:33:35,289 INFO L125 PetriNetUnfolderBase]: For 18317/18573 co-relation queries the response was YES. [2023-11-19 07:33:35,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34578 conditions, 8452 events. 5511/8452 cut-off events. For 18317/18573 co-relation queries the response was YES. Maximal size of possible extension queue 485. Compared 53574 event pairs, 688 based on Foata normal form. 121/8360 useless extension candidates. Maximal degree in co-relation 34557. Up to 3848 conditions per place. [2023-11-19 07:33:35,334 INFO L140 encePairwiseOnDemand]: 295/298 looper letters, 80 selfloop transitions, 1 changer transitions 65/153 dead transitions. [2023-11-19 07:33:35,334 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 153 transitions, 1430 flow [2023-11-19 07:33:35,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:33:35,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 07:33:35,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 572 transitions. [2023-11-19 07:33:35,337 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4798657718120805 [2023-11-19 07:33:35,337 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 572 transitions. [2023-11-19 07:33:35,337 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 572 transitions. [2023-11-19 07:33:35,337 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:33:35,338 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 572 transitions. [2023-11-19 07:33:35,339 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 0 states have call successors, (0), 0 states 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 07:33:35,341 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 298.0) internal successors, (1490), 5 states have internal predecessors, (1490), 0 states have call successors, (0), 0 states 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 07:33:35,341 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 298.0) internal successors, (1490), 5 states have internal predecessors, (1490), 0 states have call successors, (0), 0 states 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 07:33:35,342 INFO L175 Difference]: Start difference. First operand has 80 places, 72 transitions, 517 flow. Second operand 4 states and 572 transitions. [2023-11-19 07:33:35,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 153 transitions, 1430 flow [2023-11-19 07:33:35,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 153 transitions, 1231 flow, removed 45 selfloop flow, removed 10 redundant places. [2023-11-19 07:33:35,435 INFO L231 Difference]: Finished difference. Result has 72 places, 64 transitions, 379 flow [2023-11-19 07:33:35,436 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=428, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=379, PETRI_PLACES=72, PETRI_TRANSITIONS=64} [2023-11-19 07:33:35,437 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 20 predicate places. [2023-11-19 07:33:35,437 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 64 transitions, 379 flow [2023-11-19 07:33:35,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 136.0) internal successors, (544), 4 states have internal predecessors, (544), 0 states have call successors, (0), 0 states 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 07:33:35,437 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:33:35,438 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:33:35,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-19 07:33:35,438 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 07:33:35,438 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:33:35,438 INFO L85 PathProgramCache]: Analyzing trace with hash 263425568, now seen corresponding path program 2 times [2023-11-19 07:33:35,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:33:35,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924005506] [2023-11-19 07:33:35,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:33:35,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:33:35,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:35,666 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 07:33:35,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:33:35,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924005506] [2023-11-19 07:33:35,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924005506] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:33:35,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:33:35,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:33:35,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370670968] [2023-11-19 07:33:35,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:33:35,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:33:35,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:33:35,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:33:35,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:33:35,674 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 298 [2023-11-19 07:33:35,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 64 transitions, 379 flow. Second operand has 3 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 0 states 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 07:33:35,675 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:33:35,675 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 298 [2023-11-19 07:33:35,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:33:36,584 INFO L124 PetriNetUnfolderBase]: 3652/5842 cut-off events. [2023-11-19 07:33:36,584 INFO L125 PetriNetUnfolderBase]: For 10069/10265 co-relation queries the response was YES. [2023-11-19 07:33:36,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22711 conditions, 5842 events. 3652/5842 cut-off events. For 10069/10265 co-relation queries the response was YES. Maximal size of possible extension queue 391. Compared 37019 event pairs, 1252 based on Foata normal form. 40/5750 useless extension candidates. Maximal degree in co-relation 22693. Up to 2814 conditions per place. [2023-11-19 07:33:36,619 INFO L140 encePairwiseOnDemand]: 295/298 looper letters, 49 selfloop transitions, 4 changer transitions 46/103 dead transitions. [2023-11-19 07:33:36,619 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 103 transitions, 808 flow [2023-11-19 07:33:36,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:33:36,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:33:36,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 433 transitions. [2023-11-19 07:33:36,621 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4843400447427293 [2023-11-19 07:33:36,622 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 433 transitions. [2023-11-19 07:33:36,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 433 transitions. [2023-11-19 07:33:36,622 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:33:36,622 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 433 transitions. [2023-11-19 07:33:36,624 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:36,625 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 298.0) internal successors, (1192), 4 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states 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 07:33:36,626 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 298.0) internal successors, (1192), 4 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states 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 07:33:36,626 INFO L175 Difference]: Start difference. First operand has 72 places, 64 transitions, 379 flow. Second operand 3 states and 433 transitions. [2023-11-19 07:33:36,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 103 transitions, 808 flow [2023-11-19 07:33:36,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 103 transitions, 801 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-11-19 07:33:36,670 INFO L231 Difference]: Finished difference. Result has 68 places, 47 transitions, 271 flow [2023-11-19 07:33:36,670 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=271, PETRI_PLACES=68, PETRI_TRANSITIONS=47} [2023-11-19 07:33:36,671 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 16 predicate places. [2023-11-19 07:33:36,671 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 47 transitions, 271 flow [2023-11-19 07:33:36,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 0 states 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 07:33:36,671 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:33:36,672 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:33:36,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-19 07:33:36,672 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 07:33:36,672 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:33:36,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1284085456, now seen corresponding path program 3 times [2023-11-19 07:33:36,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:33:36,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988488098] [2023-11-19 07:33:36,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:33:36,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:33:36,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:33:36,745 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:33:36,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:33:36,860 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:33:36,860 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-19 07:33:36,861 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-11-19 07:33:36,863 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-11-19 07:33:36,864 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-11-19 07:33:36,864 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-11-19 07:33:36,869 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-11-19 07:33:36,869 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-11-19 07:33:36,869 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-11-19 07:33:36,869 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-11-19 07:33:36,869 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-11-19 07:33:36,870 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-11-19 07:33:36,870 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-11-19 07:33:36,870 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-11-19 07:33:36,870 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-11-19 07:33:36,870 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-11-19 07:33:36,871 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-11-19 07:33:36,871 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-11-19 07:33:36,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-19 07:33:36,872 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:33:36,879 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-19 07:33:36,879 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-19 07:33:36,972 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2023-11-19 07:33:36,976 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-19 07:33:36,987 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-19 07:33:36,991 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-19 07:33:37,002 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-19 07:33:37,028 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:33:37 BasicIcfg [2023-11-19 07:33:37,028 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-19 07:33:37,029 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-19 07:33:37,029 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-19 07:33:37,029 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-19 07:33:37,030 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:32:59" (3/4) ... [2023-11-19 07:33:37,031 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-19 07:33:37,033 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-19 07:33:37,033 INFO L158 Benchmark]: Toolchain (without parser) took 39854.86ms. Allocated memory was 153.1MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 123.1MB in the beginning and 548.3MB in the end (delta: -425.1MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2023-11-19 07:33:37,034 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 125.8MB. Free memory is still 99.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 07:33:37,034 INFO L158 Benchmark]: CACSL2BoogieTranslator took 753.11ms. Allocated memory is still 153.1MB. Free memory was 123.1MB in the beginning and 98.6MB in the end (delta: 24.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-11-19 07:33:37,035 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.38ms. Allocated memory is still 153.1MB. Free memory was 98.6MB in the beginning and 95.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 07:33:37,035 INFO L158 Benchmark]: Boogie Preprocessor took 42.14ms. Allocated memory is still 153.1MB. Free memory was 95.9MB in the beginning and 93.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 07:33:37,036 INFO L158 Benchmark]: RCFGBuilder took 1067.20ms. Allocated memory is still 153.1MB. Free memory was 93.8MB in the beginning and 85.4MB in the end (delta: 8.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-19 07:33:37,036 INFO L158 Benchmark]: TraceAbstraction took 37902.27ms. Allocated memory was 153.1MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 84.5MB in the beginning and 548.3MB in the end (delta: -463.8MB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2023-11-19 07:33:37,036 INFO L158 Benchmark]: Witness Printer took 4.20ms. Allocated memory is still 1.6GB. Free memory is still 548.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 07:33:37,038 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 125.8MB. Free memory is still 99.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 753.11ms. Allocated memory is still 153.1MB. Free memory was 123.1MB in the beginning and 98.6MB in the end (delta: 24.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 78.38ms. Allocated memory is still 153.1MB. Free memory was 98.6MB in the beginning and 95.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.14ms. Allocated memory is still 153.1MB. Free memory was 95.9MB in the beginning and 93.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1067.20ms. Allocated memory is still 153.1MB. Free memory was 93.8MB in the beginning and 85.4MB in the end (delta: 8.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 37902.27ms. Allocated memory was 153.1MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 84.5MB in the beginning and 548.3MB in the end (delta: -463.8MB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. * Witness Printer took 4.20ms. Allocated memory is still 1.6GB. Free memory is still 548.3MB. 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~pre3 could not be translated - 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: 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: 8.7s, 156 PlacesBefore, 52 PlacesAfterwards, 147 TransitionsBefore, 39 TransitionsAfterwards, 4212 CoEnabledTransitionPairs, 7 FixpointIterations, 50 TrivialSequentialCompositions, 84 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 4 ChoiceCompositions, 147 TotalNumberOfCompositions, 11013 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4890, independent: 4644, independent conditional: 0, independent unconditional: 4644, dependent: 246, dependent conditional: 0, dependent unconditional: 246, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2162, independent: 2113, independent conditional: 0, independent unconditional: 2113, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4890, independent: 2531, independent conditional: 0, independent unconditional: 2531, dependent: 197, dependent conditional: 0, dependent unconditional: 197, unknown: 2162, unknown conditional: 0, unknown unconditional: 2162] , Statistics on independence cache: Total cache size (in pairs): 163, Positive cache size: 141, Positive conditional cache size: 0, Positive unconditional cache size: 141, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22, 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_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L723] 0 _Bool x$flush_delayed; [L724] 0 int x$mem_tmp; [L725] 0 _Bool x$r_buff0_thd0; [L726] 0 _Bool x$r_buff0_thd1; [L727] 0 _Bool x$r_buff0_thd2; [L728] 0 _Bool x$r_buff0_thd3; [L729] 0 _Bool x$r_buff0_thd4; [L730] 0 _Bool x$r_buff1_thd0; [L731] 0 _Bool x$r_buff1_thd1; [L732] 0 _Bool x$r_buff1_thd2; [L733] 0 _Bool x$r_buff1_thd3; [L734] 0 _Bool x$r_buff1_thd4; [L735] 0 _Bool x$read_delayed; [L736] 0 int *x$read_delayed_var; [L737] 0 int x$w_buff0; [L738] 0 _Bool x$w_buff0_used; [L739] 0 int x$w_buff1; [L740] 0 _Bool x$w_buff1_used; [L742] 0 int y = 0; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L851] 0 pthread_t t737; [L852] FCALL, FORK 0 pthread_create(&t737, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t737={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L853] 0 pthread_t t738; [L854] FCALL, FORK 0 pthread_create(&t738, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t737={5:0}, t738={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L855] 0 pthread_t t739; [L770] 2 x$w_buff1 = x$w_buff0 [L771] 2 x$w_buff0 = 2 [L772] 2 x$w_buff1_used = x$w_buff0_used [L773] 2 x$w_buff0_used = (_Bool)1 [L774] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L774] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L775] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L776] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L777] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L778] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L779] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L780] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L783] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L856] FCALL, FORK 0 pthread_create(&t739, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t737={5:0}, t738={6:0}, t739={7:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L857] 0 pthread_t t740; [L800] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L858] FCALL, FORK 0 pthread_create(&t740, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t737={5:0}, t738={6:0}, t739={7:0}, t740={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L803] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L820] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L823] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L826] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L750] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L756] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L757] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L758] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L759] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L760] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L765] 1 return 0; [L786] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L787] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L788] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L789] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L790] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 2 return 0; [L829] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L830] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L831] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L832] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L833] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L806] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L807] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L808] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L809] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L810] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L815] 3 return 0; [L836] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L838] 4 return 0; [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L865] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L866] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L867] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L868] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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, t737={5:0}, t738={6:0}, t739={7:0}, t740={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L871] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L872] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L873] 0 x$flush_delayed = weak$$choice2 [L874] 0 x$mem_tmp = x [L875] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L876] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L877] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L878] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L879] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L880] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L881] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L882] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L883] 0 x = x$flush_delayed ? x$mem_tmp : x [L884] 0 x$flush_delayed = (_Bool)0 [L886] 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", "mix027_tso.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] - 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: 849]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 852]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 858]: 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: 856]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 186 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: 37.6s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 21.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 750 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 624 mSDsluCounter, 160 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 97 mSDsCounter, 111 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1629 IncrementalHoareTripleChecker+Invalid, 1740 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 111 mSolverCounterUnsat, 63 mSDtfsCounter, 1629 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 54 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=636occurred in iteration=10, InterpolantAutomatonStates: 69, 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.5s SatisfiabilityAnalysisTime, 6.0s InterpolantComputationTime, 254 NumberOfCodeBlocks, 254 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 212 ConstructedInterpolants, 0 QuantifiedInterpolants, 1516 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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 07:33:37,105 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0bf0bf1-955b-4f8e-8a70-6ec0aebe73fb/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-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0bf0bf1-955b-4f8e-8a70-6ec0aebe73fb/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0bf0bf1-955b-4f8e-8a70-6ec0aebe73fb/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_e0bf0bf1-955b-4f8e-8a70-6ec0aebe73fb/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0bf0bf1-955b-4f8e-8a70-6ec0aebe73fb/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix027_tso.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0bf0bf1-955b-4f8e-8a70-6ec0aebe73fb/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_e0bf0bf1-955b-4f8e-8a70-6ec0aebe73fb/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 ca8042a994ed433e8dc5deebabd166a79d030a0388291f832432b8dc85340f9d --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:33:40,004 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:33:40,122 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0bf0bf1-955b-4f8e-8a70-6ec0aebe73fb/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-19 07:33:40,148 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:33:40,149 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:33:40,190 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:33:40,191 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:33:40,192 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:33:40,193 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:33:40,198 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:33:40,199 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:33:40,200 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:33:40,200 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:33:40,202 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:33:40,202 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:33:40,203 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:33:40,203 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:33:40,204 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:33:40,204 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-19 07:33:40,206 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-19 07:33:40,206 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-19 07:33:40,207 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:33:40,207 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-19 07:33:40,208 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-19 07:33:40,208 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-19 07:33:40,208 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-19 07:33:40,209 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:33:40,209 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:33:40,210 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:33:40,211 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:33:40,212 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:33:40,212 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:33:40,213 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:33:40,213 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:33:40,214 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-19 07:33:40,214 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-19 07:33:40,214 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:33:40,214 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:33:40,215 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:33:40,216 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-19 07:33:40,216 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:33:40,216 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC