./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix044_tso.oepc.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_d043cf06-96b7-4e27-9743-f288b3acf71d/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d043cf06-96b7-4e27-9743-f288b3acf71d/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_d043cf06-96b7-4e27-9743-f288b3acf71d/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d043cf06-96b7-4e27-9743-f288b3acf71d/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix044_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d043cf06-96b7-4e27-9743-f288b3acf71d/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_d043cf06-96b7-4e27-9743-f288b3acf71d/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 2b2ed0379679fef7868072cf33e9753c7c5c6d498ba6cea443eeb2e2c1bbc6d1 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 08:03:58,647 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 08:03:58,756 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d043cf06-96b7-4e27-9743-f288b3acf71d/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-19 08:03:58,762 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 08:03:58,763 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 08:03:58,800 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 08:03:58,801 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 08:03:58,801 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 08:03:58,803 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 08:03:58,803 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 08:03:58,804 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 08:03:58,805 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 08:03:58,806 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 08:03:58,810 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 08:03:58,812 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 08:03:58,812 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 08:03:58,813 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 08:03:58,813 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 08:03:58,814 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-19 08:03:58,815 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-19 08:03:58,815 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-19 08:03:58,816 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 08:03:58,816 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-19 08:03:58,817 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-19 08:03:58,817 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 08:03:58,818 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 08:03:58,819 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 08:03:58,819 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 08:03:58,820 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 08:03:58,820 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 08:03:58,822 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 08:03:58,822 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 08:03:58,822 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 08:03:58,823 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 08:03:58,823 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 08:03:58,823 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 08:03:58,824 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 08:03:58,824 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 08:03:58,824 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_d043cf06-96b7-4e27-9743-f288b3acf71d/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_d043cf06-96b7-4e27-9743-f288b3acf71d/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 -> 2b2ed0379679fef7868072cf33e9753c7c5c6d498ba6cea443eeb2e2c1bbc6d1 [2023-11-19 08:03:59,124 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 08:03:59,158 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 08:03:59,161 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 08:03:59,163 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 08:03:59,164 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 08:03:59,165 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d043cf06-96b7-4e27-9743-f288b3acf71d/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/pthread-wmm/mix044_tso.oepc.i [2023-11-19 08:04:02,293 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 08:04:02,562 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 08:04:02,562 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d043cf06-96b7-4e27-9743-f288b3acf71d/sv-benchmarks/c/pthread-wmm/mix044_tso.oepc.i [2023-11-19 08:04:02,580 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d043cf06-96b7-4e27-9743-f288b3acf71d/bin/uautomizer-verify-uCwYo4JHxu/data/879c31f77/0ec5a5ae7b5b49bba267c3ef90112cce/FLAGf5d7f35c9 [2023-11-19 08:04:02,595 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d043cf06-96b7-4e27-9743-f288b3acf71d/bin/uautomizer-verify-uCwYo4JHxu/data/879c31f77/0ec5a5ae7b5b49bba267c3ef90112cce [2023-11-19 08:04:02,597 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 08:04:02,599 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 08:04:02,601 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 08:04:02,601 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 08:04:02,606 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 08:04:02,607 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:04:02" (1/1) ... [2023-11-19 08:04:02,608 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37900fe2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:04:02, skipping insertion in model container [2023-11-19 08:04:02,609 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:04:02" (1/1) ... [2023-11-19 08:04:02,689 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 08:04:03,235 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 08:04:03,259 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 08:04:03,335 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 08:04:03,374 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 08:04:03,374 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 08:04:03,383 INFO L206 MainTranslator]: Completed translation [2023-11-19 08:04:03,383 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:04:03 WrapperNode [2023-11-19 08:04:03,384 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 08:04:03,385 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 08:04:03,385 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 08:04:03,386 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 08:04:03,394 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:04:03" (1/1) ... [2023-11-19 08:04:03,441 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:04:03" (1/1) ... [2023-11-19 08:04:03,507 INFO L138 Inliner]: procedures = 177, calls = 72, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 167 [2023-11-19 08:04:03,508 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 08:04:03,509 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 08:04:03,509 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 08:04:03,510 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 08:04:03,522 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:04:03" (1/1) ... [2023-11-19 08:04:03,523 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:04:03" (1/1) ... [2023-11-19 08:04:03,540 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:04:03" (1/1) ... [2023-11-19 08:04:03,545 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:04:03" (1/1) ... [2023-11-19 08:04:03,568 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:04:03" (1/1) ... [2023-11-19 08:04:03,570 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:04:03" (1/1) ... [2023-11-19 08:04:03,587 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:04:03" (1/1) ... [2023-11-19 08:04:03,589 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:04:03" (1/1) ... [2023-11-19 08:04:03,594 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 08:04:03,595 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 08:04:03,595 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 08:04:03,596 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 08:04:03,597 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:04:03" (1/1) ... [2023-11-19 08:04:03,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 08:04:03,620 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d043cf06-96b7-4e27-9743-f288b3acf71d/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 08:04:03,641 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d043cf06-96b7-4e27-9743-f288b3acf71d/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 08:04:03,676 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d043cf06-96b7-4e27-9743-f288b3acf71d/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 08:04:03,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 08:04:03,691 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-19 08:04:03,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 08:04:03,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 08:04:03,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 08:04:03,692 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-19 08:04:03,693 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-19 08:04:03,693 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-19 08:04:03,693 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-19 08:04:03,693 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-19 08:04:03,693 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-19 08:04:03,694 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-19 08:04:03,694 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-19 08:04:03,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 08:04:03,694 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-19 08:04:03,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 08:04:03,697 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 08:04:03,699 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-19 08:04:03,909 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 08:04:03,912 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 08:04:04,457 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 08:04:04,693 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 08:04:04,693 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-19 08:04:04,700 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:04:04 BoogieIcfgContainer [2023-11-19 08:04:04,702 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 08:04:04,707 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 08:04:04,707 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 08:04:04,711 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 08:04:04,711 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 08:04:02" (1/3) ... [2023-11-19 08:04:04,712 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30bfd365 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:04:04, skipping insertion in model container [2023-11-19 08:04:04,713 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:04:03" (2/3) ... [2023-11-19 08:04:04,715 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30bfd365 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:04:04, skipping insertion in model container [2023-11-19 08:04:04,716 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:04:04" (3/3) ... [2023-11-19 08:04:04,717 INFO L112 eAbstractionObserver]: Analyzing ICFG mix044_tso.oepc.i [2023-11-19 08:04:04,738 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 08:04:04,738 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-11-19 08:04:04,738 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-19 08:04:04,810 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-19 08:04:04,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 162 places, 153 transitions, 322 flow [2023-11-19 08:04:04,989 INFO L124 PetriNetUnfolderBase]: 4/149 cut-off events. [2023-11-19 08:04:04,989 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 08:04:04,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 162 conditions, 149 events. 4/149 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 125 event pairs, 0 based on Foata normal form. 0/134 useless extension candidates. Maximal degree in co-relation 108. Up to 2 conditions per place. [2023-11-19 08:04:04,998 INFO L82 GeneralOperation]: Start removeDead. Operand has 162 places, 153 transitions, 322 flow [2023-11-19 08:04:05,006 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 158 places, 149 transitions, 310 flow [2023-11-19 08:04:05,010 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-19 08:04:05,021 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 158 places, 149 transitions, 310 flow [2023-11-19 08:04:05,024 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 158 places, 149 transitions, 310 flow [2023-11-19 08:04:05,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 158 places, 149 transitions, 310 flow [2023-11-19 08:04:05,067 INFO L124 PetriNetUnfolderBase]: 4/149 cut-off events. [2023-11-19 08:04:05,067 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 08:04:05,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 162 conditions, 149 events. 4/149 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 125 event pairs, 0 based on Foata normal form. 0/134 useless extension candidates. Maximal degree in co-relation 108. Up to 2 conditions per place. [2023-11-19 08:04:05,077 INFO L119 LiptonReduction]: Number of co-enabled transitions 4344 [2023-11-19 08:04:14,558 INFO L134 LiptonReduction]: Checked pairs total: 11164 [2023-11-19 08:04:14,558 INFO L136 LiptonReduction]: Total number of compositions: 146 [2023-11-19 08:04:14,578 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 08:04:14,592 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;@9234d99, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 08:04:14,593 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-11-19 08:04:14,594 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-19 08:04:14,595 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-11-19 08:04:14,595 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 08:04:14,595 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:04:14,596 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-19 08:04:14,597 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 08:04:14,605 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:04:14,605 INFO L85 PathProgramCache]: Analyzing trace with hash 663, now seen corresponding path program 1 times [2023-11-19 08:04:14,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:04:14,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060992646] [2023-11-19 08:04:14,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:04:14,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:04:14,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:04:14,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:04:14,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:04:14,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060992646] [2023-11-19 08:04:14,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060992646] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:04:14,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:04:14,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-19 08:04:14,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22041583] [2023-11-19 08:04:14,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:04:14,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 08:04:14,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:04:14,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 08:04:14,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 08:04:14,866 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 299 [2023-11-19 08:04:14,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 39 transitions, 90 flow. Second operand has 2 states, 2 states have (on average 136.5) internal successors, (273), 2 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:14,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:04:14,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 299 [2023-11-19 08:04:14,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:04:17,519 INFO L124 PetriNetUnfolderBase]: 7477/10243 cut-off events. [2023-11-19 08:04:17,519 INFO L125 PetriNetUnfolderBase]: For 75/75 co-relation queries the response was YES. [2023-11-19 08:04:17,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20545 conditions, 10243 events. 7477/10243 cut-off events. For 75/75 co-relation queries the response was YES. Maximal size of possible extension queue 479. Compared 53386 event pairs, 7477 based on Foata normal form. 0/8795 useless extension candidates. Maximal degree in co-relation 20533. Up to 10087 conditions per place. [2023-11-19 08:04:17,631 INFO L140 encePairwiseOnDemand]: 291/299 looper letters, 27 selfloop transitions, 0 changer transitions 0/31 dead transitions. [2023-11-19 08:04:17,631 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 31 transitions, 128 flow [2023-11-19 08:04:17,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 08:04:17,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-19 08:04:17,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 307 transitions. [2023-11-19 08:04:17,653 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5133779264214047 [2023-11-19 08:04:17,654 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 307 transitions. [2023-11-19 08:04:17,655 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 307 transitions. [2023-11-19 08:04:17,659 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:04:17,662 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 307 transitions. [2023-11-19 08:04:17,670 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 153.5) internal successors, (307), 2 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:17,677 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 299.0) internal successors, (897), 3 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:17,678 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 299.0) internal successors, (897), 3 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:17,680 INFO L175 Difference]: Start difference. First operand has 52 places, 39 transitions, 90 flow. Second operand 2 states and 307 transitions. [2023-11-19 08:04:17,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 31 transitions, 128 flow [2023-11-19 08:04:17,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 31 transitions, 124 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-19 08:04:17,693 INFO L231 Difference]: Finished difference. Result has 41 places, 31 transitions, 70 flow [2023-11-19 08:04:17,695 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=70, PETRI_PLACES=41, PETRI_TRANSITIONS=31} [2023-11-19 08:04:17,700 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -11 predicate places. [2023-11-19 08:04:17,700 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 70 flow [2023-11-19 08:04:17,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 136.5) internal successors, (273), 2 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:17,701 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:04:17,701 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-19 08:04:17,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 08:04:17,702 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 08:04:17,703 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:04:17,703 INFO L85 PathProgramCache]: Analyzing trace with hash 626476955, now seen corresponding path program 1 times [2023-11-19 08:04:17,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:04:17,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559322624] [2023-11-19 08:04:17,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:04:17,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:04:17,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:04:18,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:04:18,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:04:18,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559322624] [2023-11-19 08:04:18,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559322624] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:04:18,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:04:18,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 08:04:18,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383499887] [2023-11-19 08:04:18,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:04:18,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 08:04:18,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:04:18,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 08:04:18,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 08:04:18,196 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 299 [2023-11-19 08:04:18,198 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:18,198 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:04:18,198 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 299 [2023-11-19 08:04:18,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:04:20,047 INFO L124 PetriNetUnfolderBase]: 5879/8522 cut-off events. [2023-11-19 08:04:20,048 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 08:04:20,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16663 conditions, 8522 events. 5879/8522 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 420. Compared 50386 event pairs, 1085 based on Foata normal form. 0/7857 useless extension candidates. Maximal degree in co-relation 16660. Up to 6355 conditions per place. [2023-11-19 08:04:20,108 INFO L140 encePairwiseOnDemand]: 296/299 looper letters, 41 selfloop transitions, 2 changer transitions 2/49 dead transitions. [2023-11-19 08:04:20,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 49 transitions, 200 flow [2023-11-19 08:04:20,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 08:04:20,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 08:04:20,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 451 transitions. [2023-11-19 08:04:20,112 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5027870680044593 [2023-11-19 08:04:20,113 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 451 transitions. [2023-11-19 08:04:20,113 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 451 transitions. [2023-11-19 08:04:20,113 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:04:20,114 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 451 transitions. [2023-11-19 08:04:20,115 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 150.33333333333334) internal successors, (451), 3 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:20,119 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 299.0) internal successors, (1196), 4 states have internal predecessors, (1196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:20,121 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 299.0) internal successors, (1196), 4 states have internal predecessors, (1196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:20,121 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 70 flow. Second operand 3 states and 451 transitions. [2023-11-19 08:04:20,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 49 transitions, 200 flow [2023-11-19 08:04:20,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 49 transitions, 200 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-19 08:04:20,123 INFO L231 Difference]: Finished difference. Result has 42 places, 29 transitions, 70 flow [2023-11-19 08:04:20,124 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=42, PETRI_TRANSITIONS=29} [2023-11-19 08:04:20,125 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -10 predicate places. [2023-11-19 08:04:20,125 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 70 flow [2023-11-19 08:04:20,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:20,126 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:04:20,126 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:04:20,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 08:04:20,126 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 08:04:20,127 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:04:20,127 INFO L85 PathProgramCache]: Analyzing trace with hash -864360019, now seen corresponding path program 1 times [2023-11-19 08:04:20,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:04:20,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258672746] [2023-11-19 08:04:20,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:04:20,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:04:20,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:04:20,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:04:20,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:04:20,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258672746] [2023-11-19 08:04:20,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258672746] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:04:20,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:04:20,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 08:04:20,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338520730] [2023-11-19 08:04:20,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:04:20,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 08:04:20,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:04:20,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 08:04:20,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 08:04:20,976 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 299 [2023-11-19 08:04:20,977 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 125.75) internal successors, (503), 4 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:20,977 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:04:20,977 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 299 [2023-11-19 08:04:20,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:04:23,940 INFO L124 PetriNetUnfolderBase]: 12076/16337 cut-off events. [2023-11-19 08:04:23,940 INFO L125 PetriNetUnfolderBase]: For 839/839 co-relation queries the response was YES. [2023-11-19 08:04:23,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33805 conditions, 16337 events. 12076/16337 cut-off events. For 839/839 co-relation queries the response was YES. Maximal size of possible extension queue 598. Compared 82583 event pairs, 1581 based on Foata normal form. 0/15776 useless extension candidates. Maximal degree in co-relation 33801. Up to 12824 conditions per place. [2023-11-19 08:04:24,058 INFO L140 encePairwiseOnDemand]: 285/299 looper letters, 49 selfloop transitions, 15 changer transitions 0/65 dead transitions. [2023-11-19 08:04:24,058 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 65 transitions, 278 flow [2023-11-19 08:04:24,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 08:04:24,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 08:04:24,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 558 transitions. [2023-11-19 08:04:24,062 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4665551839464883 [2023-11-19 08:04:24,062 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 558 transitions. [2023-11-19 08:04:24,063 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 558 transitions. [2023-11-19 08:04:24,063 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:04:24,063 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 558 transitions. [2023-11-19 08:04:24,066 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 139.5) internal successors, (558), 4 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:24,072 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 299.0) internal successors, (1495), 5 states have internal predecessors, (1495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:24,074 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 299.0) internal successors, (1495), 5 states have internal predecessors, (1495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:24,074 INFO L175 Difference]: Start difference. First operand has 42 places, 29 transitions, 70 flow. Second operand 4 states and 558 transitions. [2023-11-19 08:04:24,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 65 transitions, 278 flow [2023-11-19 08:04:24,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 65 transitions, 270 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 08:04:24,080 INFO L231 Difference]: Finished difference. Result has 45 places, 43 transitions, 182 flow [2023-11-19 08:04:24,080 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=182, PETRI_PLACES=45, PETRI_TRANSITIONS=43} [2023-11-19 08:04:24,082 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -7 predicate places. [2023-11-19 08:04:24,083 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 43 transitions, 182 flow [2023-11-19 08:04:24,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 125.75) internal successors, (503), 4 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:24,084 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:04:24,084 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:04:24,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 08:04:24,089 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 08:04:24,090 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:04:24,090 INFO L85 PathProgramCache]: Analyzing trace with hash -864360008, now seen corresponding path program 1 times [2023-11-19 08:04:24,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:04:24,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198029416] [2023-11-19 08:04:24,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:04:24,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:04:24,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:04:25,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:04:25,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:04:25,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198029416] [2023-11-19 08:04:25,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198029416] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:04:25,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:04:25,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 08:04:25,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690505716] [2023-11-19 08:04:25,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:04:25,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 08:04:25,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:04:25,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 08:04:25,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-19 08:04:25,386 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 299 [2023-11-19 08:04:25,388 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 43 transitions, 182 flow. Second operand has 6 states, 6 states have (on average 119.83333333333333) internal successors, (719), 6 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:25,388 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:04:25,388 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 299 [2023-11-19 08:04:25,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:04:27,374 INFO L124 PetriNetUnfolderBase]: 8877/12396 cut-off events. [2023-11-19 08:04:27,374 INFO L125 PetriNetUnfolderBase]: For 6109/6401 co-relation queries the response was YES. [2023-11-19 08:04:27,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34739 conditions, 12396 events. 8877/12396 cut-off events. For 6109/6401 co-relation queries the response was YES. Maximal size of possible extension queue 523. Compared 66398 event pairs, 1099 based on Foata normal form. 484/12699 useless extension candidates. Maximal degree in co-relation 34733. Up to 8019 conditions per place. [2023-11-19 08:04:27,471 INFO L140 encePairwiseOnDemand]: 292/299 looper letters, 67 selfloop transitions, 6 changer transitions 0/81 dead transitions. [2023-11-19 08:04:27,471 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 81 transitions, 466 flow [2023-11-19 08:04:27,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 08:04:27,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-19 08:04:27,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 764 transitions. [2023-11-19 08:04:27,475 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4258639910813824 [2023-11-19 08:04:27,475 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 764 transitions. [2023-11-19 08:04:27,475 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 764 transitions. [2023-11-19 08:04:27,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:04:27,476 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 764 transitions. [2023-11-19 08:04:27,479 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 127.33333333333333) internal successors, (764), 6 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:27,484 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 299.0) internal successors, (2093), 7 states have internal predecessors, (2093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:27,486 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 299.0) internal successors, (2093), 7 states have internal predecessors, (2093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:27,486 INFO L175 Difference]: Start difference. First operand has 45 places, 43 transitions, 182 flow. Second operand 6 states and 764 transitions. [2023-11-19 08:04:27,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 81 transitions, 466 flow [2023-11-19 08:04:27,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 81 transitions, 466 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-19 08:04:27,491 INFO L231 Difference]: Finished difference. Result has 51 places, 43 transitions, 203 flow [2023-11-19 08:04:27,491 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=203, PETRI_PLACES=51, PETRI_TRANSITIONS=43} [2023-11-19 08:04:27,492 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -1 predicate places. [2023-11-19 08:04:27,493 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 43 transitions, 203 flow [2023-11-19 08:04:27,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 119.83333333333333) internal successors, (719), 6 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:27,494 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:04:27,494 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:04:27,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 08:04:27,494 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 08:04:27,495 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:04:27,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1805972171, now seen corresponding path program 1 times [2023-11-19 08:04:27,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:04:27,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962897158] [2023-11-19 08:04:27,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:04:27,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:04:27,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:04:28,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:04:28,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:04:28,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962897158] [2023-11-19 08:04:28,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962897158] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:04:28,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:04:28,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 08:04:28,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653346608] [2023-11-19 08:04:28,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:04:28,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 08:04:28,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:04:28,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 08:04:28,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-19 08:04:28,440 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 299 [2023-11-19 08:04:28,442 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 43 transitions, 203 flow. Second operand has 6 states, 6 states have (on average 118.16666666666667) internal successors, (709), 6 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:28,442 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:04:28,442 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 299 [2023-11-19 08:04:28,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:04:30,065 INFO L124 PetriNetUnfolderBase]: 7118/9835 cut-off events. [2023-11-19 08:04:30,065 INFO L125 PetriNetUnfolderBase]: For 8294/8608 co-relation queries the response was YES. [2023-11-19 08:04:30,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28688 conditions, 9835 events. 7118/9835 cut-off events. For 8294/8608 co-relation queries the response was YES. Maximal size of possible extension queue 431. Compared 50506 event pairs, 1973 based on Foata normal form. 600/10099 useless extension candidates. Maximal degree in co-relation 28680. Up to 8429 conditions per place. [2023-11-19 08:04:30,164 INFO L140 encePairwiseOnDemand]: 294/299 looper letters, 51 selfloop transitions, 4 changer transitions 0/62 dead transitions. [2023-11-19 08:04:30,164 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 62 transitions, 371 flow [2023-11-19 08:04:30,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 08:04:30,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-19 08:04:30,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 739 transitions. [2023-11-19 08:04:30,169 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4119286510590858 [2023-11-19 08:04:30,169 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 739 transitions. [2023-11-19 08:04:30,170 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 739 transitions. [2023-11-19 08:04:30,171 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:04:30,172 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 739 transitions. [2023-11-19 08:04:30,175 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 123.16666666666667) internal successors, (739), 6 states have internal predecessors, (739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:30,182 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 299.0) internal successors, (2093), 7 states have internal predecessors, (2093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:30,184 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 299.0) internal successors, (2093), 7 states have internal predecessors, (2093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:30,184 INFO L175 Difference]: Start difference. First operand has 51 places, 43 transitions, 203 flow. Second operand 6 states and 739 transitions. [2023-11-19 08:04:30,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 62 transitions, 371 flow [2023-11-19 08:04:30,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 62 transitions, 342 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-11-19 08:04:30,203 INFO L231 Difference]: Finished difference. Result has 49 places, 40 transitions, 168 flow [2023-11-19 08:04:30,203 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=168, PETRI_PLACES=49, PETRI_TRANSITIONS=40} [2023-11-19 08:04:30,206 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -3 predicate places. [2023-11-19 08:04:30,206 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 40 transitions, 168 flow [2023-11-19 08:04:30,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 118.16666666666667) internal successors, (709), 6 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:30,207 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:04:30,207 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:04:30,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 08:04:30,208 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 08:04:30,210 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:04:30,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1806033562, now seen corresponding path program 1 times [2023-11-19 08:04:30,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:04:30,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876012630] [2023-11-19 08:04:30,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:04:30,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:04:30,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:04:30,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:04:30,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:04:30,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876012630] [2023-11-19 08:04:30,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876012630] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:04:30,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:04:30,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 08:04:30,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852907812] [2023-11-19 08:04:30,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:04:30,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 08:04:30,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:04:30,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 08:04:30,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 08:04:30,978 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 299 [2023-11-19 08:04:30,979 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 137.25) internal successors, (549), 4 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:30,979 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:04:30,980 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 299 [2023-11-19 08:04:30,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:04:32,842 INFO L124 PetriNetUnfolderBase]: 9192/12921 cut-off events. [2023-11-19 08:04:32,842 INFO L125 PetriNetUnfolderBase]: For 6520/6590 co-relation queries the response was YES. [2023-11-19 08:04:32,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36327 conditions, 12921 events. 9192/12921 cut-off events. For 6520/6590 co-relation queries the response was YES. Maximal size of possible extension queue 502. Compared 71000 event pairs, 1956 based on Foata normal form. 182/12633 useless extension candidates. Maximal degree in co-relation 36319. Up to 10012 conditions per place. [2023-11-19 08:04:32,941 INFO L140 encePairwiseOnDemand]: 291/299 looper letters, 69 selfloop transitions, 13 changer transitions 0/88 dead transitions. [2023-11-19 08:04:32,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 88 transitions, 520 flow [2023-11-19 08:04:32,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 08:04:32,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 08:04:32,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 597 transitions. [2023-11-19 08:04:32,945 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4991638795986622 [2023-11-19 08:04:32,945 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 597 transitions. [2023-11-19 08:04:32,945 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 597 transitions. [2023-11-19 08:04:32,946 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:04:32,946 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 597 transitions. [2023-11-19 08:04:32,948 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 149.25) internal successors, (597), 4 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:32,951 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 299.0) internal successors, (1495), 5 states have internal predecessors, (1495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:32,951 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 299.0) internal successors, (1495), 5 states have internal predecessors, (1495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:32,952 INFO L175 Difference]: Start difference. First operand has 49 places, 40 transitions, 168 flow. Second operand 4 states and 597 transitions. [2023-11-19 08:04:32,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 88 transitions, 520 flow [2023-11-19 08:04:32,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 88 transitions, 505 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-19 08:04:32,958 INFO L231 Difference]: Finished difference. Result has 50 places, 52 transitions, 277 flow [2023-11-19 08:04:32,958 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=277, PETRI_PLACES=50, PETRI_TRANSITIONS=52} [2023-11-19 08:04:32,959 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -2 predicate places. [2023-11-19 08:04:32,959 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 52 transitions, 277 flow [2023-11-19 08:04:32,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 137.25) internal successors, (549), 4 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:32,960 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:04:32,960 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:04:32,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 08:04:32,960 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 08:04:32,961 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:04:32,961 INFO L85 PathProgramCache]: Analyzing trace with hash -152523701, now seen corresponding path program 1 times [2023-11-19 08:04:32,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:04:32,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088637864] [2023-11-19 08:04:32,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:04:32,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:04:32,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:04:34,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:04:34,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:04:34,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088637864] [2023-11-19 08:04:34,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088637864] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:04:34,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:04:34,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 08:04:34,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207699084] [2023-11-19 08:04:34,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:04:34,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 08:04:34,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:04:34,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 08:04:34,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 08:04:34,071 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 299 [2023-11-19 08:04:34,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 52 transitions, 277 flow. Second operand has 5 states, 5 states have (on average 121.8) internal successors, (609), 5 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:34,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:04:34,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 299 [2023-11-19 08:04:34,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:04:36,015 INFO L124 PetriNetUnfolderBase]: 11499/15476 cut-off events. [2023-11-19 08:04:36,015 INFO L125 PetriNetUnfolderBase]: For 11289/11289 co-relation queries the response was YES. [2023-11-19 08:04:36,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51210 conditions, 15476 events. 11499/15476 cut-off events. For 11289/11289 co-relation queries the response was YES. Maximal size of possible extension queue 465. Compared 73244 event pairs, 3562 based on Foata normal form. 36/15512 useless extension candidates. Maximal degree in co-relation 51200. Up to 13063 conditions per place. [2023-11-19 08:04:36,143 INFO L140 encePairwiseOnDemand]: 285/299 looper letters, 86 selfloop transitions, 60 changer transitions 0/146 dead transitions. [2023-11-19 08:04:36,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 146 transitions, 1017 flow [2023-11-19 08:04:36,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 08:04:36,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-19 08:04:36,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 814 transitions. [2023-11-19 08:04:36,152 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4537346711259755 [2023-11-19 08:04:36,153 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 814 transitions. [2023-11-19 08:04:36,153 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 814 transitions. [2023-11-19 08:04:36,155 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:04:36,156 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 814 transitions. [2023-11-19 08:04:36,159 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 135.66666666666666) internal successors, (814), 6 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:36,164 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 299.0) internal successors, (2093), 7 states have internal predecessors, (2093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:36,165 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 299.0) internal successors, (2093), 7 states have internal predecessors, (2093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:36,165 INFO L175 Difference]: Start difference. First operand has 50 places, 52 transitions, 277 flow. Second operand 6 states and 814 transitions. [2023-11-19 08:04:36,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 146 transitions, 1017 flow [2023-11-19 08:04:36,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 146 transitions, 1017 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-19 08:04:36,183 INFO L231 Difference]: Finished difference. Result has 60 places, 101 transitions, 872 flow [2023-11-19 08:04:36,184 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=277, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=872, PETRI_PLACES=60, PETRI_TRANSITIONS=101} [2023-11-19 08:04:36,186 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 8 predicate places. [2023-11-19 08:04:36,186 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 101 transitions, 872 flow [2023-11-19 08:04:36,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 121.8) internal successors, (609), 5 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:36,187 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:04:36,188 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:04:36,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 08:04:36,188 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 08:04:36,189 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:04:36,189 INFO L85 PathProgramCache]: Analyzing trace with hash 2068018951, now seen corresponding path program 1 times [2023-11-19 08:04:36,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:04:36,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949258075] [2023-11-19 08:04:36,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:04:36,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:04:36,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:04:36,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:04:36,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:04:36,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949258075] [2023-11-19 08:04:36,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949258075] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:04:36,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:04:36,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 08:04:36,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647049001] [2023-11-19 08:04:36,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:04:36,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 08:04:36,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:04:36,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 08:04:36,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 08:04:36,741 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 299 [2023-11-19 08:04:36,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 101 transitions, 872 flow. Second operand has 5 states, 5 states have (on average 137.0) internal successors, (685), 5 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:36,743 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:04:36,743 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 299 [2023-11-19 08:04:36,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:04:38,641 INFO L124 PetriNetUnfolderBase]: 10015/13922 cut-off events. [2023-11-19 08:04:38,641 INFO L125 PetriNetUnfolderBase]: For 31814/32476 co-relation queries the response was YES. [2023-11-19 08:04:38,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58754 conditions, 13922 events. 10015/13922 cut-off events. For 31814/32476 co-relation queries the response was YES. Maximal size of possible extension queue 500. Compared 72332 event pairs, 3005 based on Foata normal form. 383/14244 useless extension candidates. Maximal degree in co-relation 58739. Up to 10230 conditions per place. [2023-11-19 08:04:38,787 INFO L140 encePairwiseOnDemand]: 292/299 looper letters, 118 selfloop transitions, 21 changer transitions 0/153 dead transitions. [2023-11-19 08:04:38,787 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 153 transitions, 1492 flow [2023-11-19 08:04:38,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 08:04:38,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 08:04:38,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 597 transitions. [2023-11-19 08:04:38,791 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4991638795986622 [2023-11-19 08:04:38,792 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 597 transitions. [2023-11-19 08:04:38,792 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 597 transitions. [2023-11-19 08:04:38,793 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:04:38,793 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 597 transitions. [2023-11-19 08:04:38,795 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 149.25) internal successors, (597), 4 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:38,798 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 299.0) internal successors, (1495), 5 states have internal predecessors, (1495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:38,799 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 299.0) internal successors, (1495), 5 states have internal predecessors, (1495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:38,799 INFO L175 Difference]: Start difference. First operand has 60 places, 101 transitions, 872 flow. Second operand 4 states and 597 transitions. [2023-11-19 08:04:38,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 153 transitions, 1492 flow [2023-11-19 08:04:38,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 153 transitions, 1478 flow, removed 7 selfloop flow, removed 0 redundant places. [2023-11-19 08:04:38,855 INFO L231 Difference]: Finished difference. Result has 64 places, 110 transitions, 1009 flow [2023-11-19 08:04:38,856 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=858, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1009, PETRI_PLACES=64, PETRI_TRANSITIONS=110} [2023-11-19 08:04:38,857 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 12 predicate places. [2023-11-19 08:04:38,857 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 110 transitions, 1009 flow [2023-11-19 08:04:38,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 137.0) internal successors, (685), 5 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:38,858 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:04:38,858 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:04:38,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-19 08:04:38,859 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 08:04:38,859 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:04:38,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1100452928, now seen corresponding path program 1 times [2023-11-19 08:04:38,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:04:38,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129185402] [2023-11-19 08:04:38,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:04:38,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:04:38,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:04:39,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:04:39,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:04:39,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129185402] [2023-11-19 08:04:39,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129185402] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:04:39,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:04:39,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 08:04:39,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412329516] [2023-11-19 08:04:39,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:04:39,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 08:04:39,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:04:39,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 08:04:39,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-19 08:04:39,631 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 299 [2023-11-19 08:04:39,632 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 110 transitions, 1009 flow. Second operand has 6 states, 6 states have (on average 135.66666666666666) internal successors, (814), 6 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:39,632 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:04:39,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 299 [2023-11-19 08:04:39,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:04:42,097 INFO L124 PetriNetUnfolderBase]: 11850/16562 cut-off events. [2023-11-19 08:04:42,097 INFO L125 PetriNetUnfolderBase]: For 50732/51420 co-relation queries the response was YES. [2023-11-19 08:04:42,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74483 conditions, 16562 events. 11850/16562 cut-off events. For 50732/51420 co-relation queries the response was YES. Maximal size of possible extension queue 616. Compared 90122 event pairs, 2598 based on Foata normal form. 544/16984 useless extension candidates. Maximal degree in co-relation 74466. Up to 10901 conditions per place. [2023-11-19 08:04:42,253 INFO L140 encePairwiseOnDemand]: 291/299 looper letters, 138 selfloop transitions, 32 changer transitions 0/184 dead transitions. [2023-11-19 08:04:42,254 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 184 transitions, 1864 flow [2023-11-19 08:04:42,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 08:04:42,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-19 08:04:42,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 744 transitions. [2023-11-19 08:04:42,258 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49765886287625416 [2023-11-19 08:04:42,258 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 744 transitions. [2023-11-19 08:04:42,259 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 744 transitions. [2023-11-19 08:04:42,259 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:04:42,260 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 744 transitions. [2023-11-19 08:04:42,262 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 148.8) internal successors, (744), 5 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:42,266 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 299.0) internal successors, (1794), 6 states have internal predecessors, (1794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:42,267 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 299.0) internal successors, (1794), 6 states have internal predecessors, (1794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:42,267 INFO L175 Difference]: Start difference. First operand has 64 places, 110 transitions, 1009 flow. Second operand 5 states and 744 transitions. [2023-11-19 08:04:42,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 184 transitions, 1864 flow [2023-11-19 08:04:42,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 184 transitions, 1845 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-11-19 08:04:42,349 INFO L231 Difference]: Finished difference. Result has 69 places, 124 transitions, 1264 flow [2023-11-19 08:04:42,350 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=992, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1264, PETRI_PLACES=69, PETRI_TRANSITIONS=124} [2023-11-19 08:04:42,351 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 17 predicate places. [2023-11-19 08:04:42,351 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 124 transitions, 1264 flow [2023-11-19 08:04:42,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 135.66666666666666) internal successors, (814), 6 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:42,352 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:04:42,352 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:04:42,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-19 08:04:42,353 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 08:04:42,353 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:04:42,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1707330212, now seen corresponding path program 1 times [2023-11-19 08:04:42,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:04:42,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634996790] [2023-11-19 08:04:42,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:04:42,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:04:42,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:04:42,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:04:42,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:04:42,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634996790] [2023-11-19 08:04:42,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634996790] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:04:42,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:04:42,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 08:04:42,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713240066] [2023-11-19 08:04:42,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:04:42,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 08:04:42,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:04:42,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 08:04:42,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-19 08:04:42,861 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 299 [2023-11-19 08:04:42,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 124 transitions, 1264 flow. Second operand has 6 states, 6 states have (on average 134.66666666666666) internal successors, (808), 6 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:42,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:04:42,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 299 [2023-11-19 08:04:42,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:04:45,414 INFO L124 PetriNetUnfolderBase]: 12850/17927 cut-off events. [2023-11-19 08:04:45,414 INFO L125 PetriNetUnfolderBase]: For 84728/85590 co-relation queries the response was YES. [2023-11-19 08:04:45,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88643 conditions, 17927 events. 12850/17927 cut-off events. For 84728/85590 co-relation queries the response was YES. Maximal size of possible extension queue 683. Compared 98942 event pairs, 2939 based on Foata normal form. 830/18663 useless extension candidates. Maximal degree in co-relation 88624. Up to 11652 conditions per place. [2023-11-19 08:04:45,567 INFO L140 encePairwiseOnDemand]: 291/299 looper letters, 136 selfloop transitions, 47 changer transitions 0/197 dead transitions. [2023-11-19 08:04:45,567 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 197 transitions, 2205 flow [2023-11-19 08:04:45,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 08:04:45,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-19 08:04:45,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 869 transitions. [2023-11-19 08:04:45,572 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48439241917502784 [2023-11-19 08:04:45,572 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 869 transitions. [2023-11-19 08:04:45,572 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 869 transitions. [2023-11-19 08:04:45,573 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:04:45,574 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 869 transitions. [2023-11-19 08:04:45,577 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 144.83333333333334) internal successors, (869), 6 states have internal predecessors, (869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:45,581 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 299.0) internal successors, (2093), 7 states have internal predecessors, (2093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:45,582 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 299.0) internal successors, (2093), 7 states have internal predecessors, (2093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:45,583 INFO L175 Difference]: Start difference. First operand has 69 places, 124 transitions, 1264 flow. Second operand 6 states and 869 transitions. [2023-11-19 08:04:45,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 197 transitions, 2205 flow [2023-11-19 08:04:45,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 197 transitions, 2159 flow, removed 12 selfloop flow, removed 1 redundant places. [2023-11-19 08:04:45,773 INFO L231 Difference]: Finished difference. Result has 74 places, 138 transitions, 1560 flow [2023-11-19 08:04:45,773 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=1232, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1560, PETRI_PLACES=74, PETRI_TRANSITIONS=138} [2023-11-19 08:04:45,774 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 22 predicate places. [2023-11-19 08:04:45,774 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 138 transitions, 1560 flow [2023-11-19 08:04:45,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 134.66666666666666) internal successors, (808), 6 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:45,775 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:04:45,775 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:04:45,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-19 08:04:45,776 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 08:04:45,776 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:04:45,777 INFO L85 PathProgramCache]: Analyzing trace with hash 540328148, now seen corresponding path program 1 times [2023-11-19 08:04:45,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:04:45,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658073951] [2023-11-19 08:04:45,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:04:45,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:04:45,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:04:46,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:04:46,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:04:46,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658073951] [2023-11-19 08:04:46,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658073951] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:04:46,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:04:46,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 08:04:46,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829995397] [2023-11-19 08:04:46,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:04:46,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 08:04:46,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:04:46,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 08:04:46,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 08:04:46,024 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 299 [2023-11-19 08:04:46,025 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 138 transitions, 1560 flow. Second operand has 4 states, 4 states have (on average 132.75) internal successors, (531), 4 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:46,026 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:04:46,026 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 299 [2023-11-19 08:04:46,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:04:47,523 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([476] L832-->L839: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_24 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_28 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_137 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_138 256) 0)))) (.cse1 (and .cse2 (not (= 0 (mod v_~x$w_buff1_used~0_129 256)))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_28) v_~x$r_buff0_thd4~0_27) (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_129) v_~x$w_buff1_used~0_128) (= v_~x$r_buff1_thd4~0_23 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_128 256) 0))) (and .cse3 (not (= (mod v_~x$r_buff0_thd4~0_27 256) 0)))) 0 v_~x$r_buff1_thd4~0_24)) (= (ite .cse4 0 v_~x$w_buff0_used~0_138) v_~x$w_buff0_used~0_137) (= v_~x~0_89 (ite .cse4 v_~x$w_buff0~0_60 (ite .cse1 v_~x$w_buff1~0_55 v_~x~0_90)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_55, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_129, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_28, ~x~0=v_~x~0_90, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_24, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_138} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_55, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_128, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_27, ~x~0=v_~x~0_89, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_23, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_137} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][269], [111#L806true, Black: 198#(and (= ~x~0 0) (or (= 0 ~x$w_buff1~0) (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (or (= 0 ~x$w_buff0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), Black: 197#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), 66#L839true, 69#L786true, Black: 208#(and (= ~x~0 0) (= 0 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 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))) (= 0 ~x$r_buff0_thd0~0)), Black: 205#(and (= 2 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0)) (= ~x~0 ~x$w_buff1~0)), Black: 206#(or (and (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (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))))) (not (= 2 ~z~0)))) (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)))) (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: 204#(and (= ~x~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), 165#true, 128#L756true, P3Thread1of1ForFork2InUse, Black: 218#(and (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 202#true, P1Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, 248#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P0Thread1of1ForFork3InUse, 172#true, Black: 225#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 193#(and (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1188~0#1.base| 0) |ULTIMATE.start_main_~#t1186~0#1.base| 0) |ULTIMATE.start_main_~#t1187~0#1.base| 0) |ULTIMATE.start_main_~#t1185~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1186~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1187~0#1.base|))), Black: 226#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 234#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 235#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (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 (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 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)))) (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)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (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: 174#(<= ~z~0 0), 195#true, 78#L2true, Black: 185#(and (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1188~0#1.base| 0) |ULTIMATE.start_main_~#t1186~0#1.base| 0) |ULTIMATE.start_main_~#t1187~0#1.base| 0) |ULTIMATE.start_main_~#t1185~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1186~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1187~0#1.base|)))]) [2023-11-19 08:04:47,523 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2023-11-19 08:04:47,523 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-19 08:04:47,523 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-19 08:04:47,523 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-19 08:04:47,524 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([467] L806-->L813: Formula: (let ((.cse1 (not (= (mod v_~x$r_buff1_thd3~0_18 256) 0))) (.cse0 (not (= (mod v_~x$w_buff0_used~0_121 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_22 256) 0)))) (let ((.cse2 (and .cse0 .cse5)) (.cse3 (and .cse1 (not (= (mod v_~x$w_buff1_used~0_111 256) 0)))) (.cse4 (and (not (= (mod v_~x$w_buff0_used~0_122 256) 0)) .cse5))) (and (= v_~x$r_buff1_thd3~0_17 (ite (or (and (not (= (mod v_~x$r_buff0_thd3~0_21 256) 0)) .cse0) (and (not (= (mod v_~x$w_buff1_used~0_110 256) 0)) .cse1)) 0 v_~x$r_buff1_thd3~0_18)) (= (ite (or .cse2 .cse3) 0 v_~x$w_buff1_used~0_111) v_~x$w_buff1_used~0_110) (= (ite .cse2 0 v_~x$r_buff0_thd3~0_22) v_~x$r_buff0_thd3~0_21) (= v_~x~0_73 (ite .cse4 v_~x$w_buff0~0_50 (ite .cse3 v_~x$w_buff1~0_45 v_~x~0_74))) (= v_~x$w_buff0_used~0_121 (ite .cse4 0 v_~x$w_buff0_used~0_122))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_45, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_18, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_111, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_22, ~x~0=v_~x~0_74, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_122} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_45, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_110, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_21, ~x~0=v_~x~0_73, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_121} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][152], [139#L832true, Black: 198#(and (= ~x~0 0) (or (= 0 ~x$w_buff1~0) (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (or (= 0 ~x$w_buff0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), Black: 197#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), 69#L786true, Black: 208#(and (= ~x~0 0) (= 0 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 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))) (= 0 ~x$r_buff0_thd0~0)), Black: 205#(and (= 2 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0)) (= ~x~0 ~x$w_buff1~0)), Black: 206#(or (and (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (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))))) (not (= 2 ~z~0)))) (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)))) (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: 204#(and (= ~x~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), 165#true, 128#L756true, P3Thread1of1ForFork2InUse, Black: 218#(and (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 202#true, P1Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, 248#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P0Thread1of1ForFork3InUse, 172#true, Black: 225#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 193#(and (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1188~0#1.base| 0) |ULTIMATE.start_main_~#t1186~0#1.base| 0) |ULTIMATE.start_main_~#t1187~0#1.base| 0) |ULTIMATE.start_main_~#t1185~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1186~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1187~0#1.base|))), Black: 226#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 234#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 235#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (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 (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 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)))) (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)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (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: 174#(<= ~z~0 0), 195#true, 78#L2true, Black: 185#(and (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1188~0#1.base| 0) |ULTIMATE.start_main_~#t1186~0#1.base| 0) |ULTIMATE.start_main_~#t1187~0#1.base| 0) |ULTIMATE.start_main_~#t1185~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1186~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1187~0#1.base|))), 127#L813true]) [2023-11-19 08:04:47,524 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2023-11-19 08:04:47,524 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-19 08:04:47,524 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-19 08:04:47,524 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-19 08:04:47,525 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([460] L786-->L793: Formula: (let ((.cse4 (not (= (mod v_~x$w_buff0_used~0_87 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_23 256) 0))) (.cse3 (not (= 0 (mod v_~x$r_buff1_thd2~0_16 256))))) (let ((.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_79 256) 0)))) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_88 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5))) (and (= v_~x~0_53 (ite .cse0 v_~x$w_buff0~0_32 (ite .cse1 v_~x$w_buff1~0_29 v_~x~0_54))) (= v_~x$w_buff1_used~0_78 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_79)) (= (ite .cse0 0 v_~x$w_buff0_used~0_88) v_~x$w_buff0_used~0_87) (= (ite .cse2 0 v_~x$r_buff0_thd2~0_23) v_~x$r_buff0_thd2~0_22) (= v_~x$r_buff1_thd2~0_15 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_78 256) 0))) (and (not (= (mod v_~x$r_buff0_thd2~0_22 256) 0)) .cse4)) 0 v_~x$r_buff1_thd2~0_16))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_16, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_79, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_23, ~x~0=v_~x~0_54, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_88} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_15, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_78, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_22, ~x~0=v_~x~0_53, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_87} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][155], [139#L832true, 111#L806true, Black: 198#(and (= ~x~0 0) (or (= 0 ~x$w_buff1~0) (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (or (= 0 ~x$w_buff0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), Black: 197#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 208#(and (= ~x~0 0) (= 0 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 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))) (= 0 ~x$r_buff0_thd0~0)), Black: 205#(and (= 2 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0)) (= ~x~0 ~x$w_buff1~0)), Black: 206#(or (and (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (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))))) (not (= 2 ~z~0)))) (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)))) (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: 204#(and (= ~x~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), 165#true, 128#L756true, Black: 218#(and (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), P3Thread1of1ForFork2InUse, 202#true, P1Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, 248#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P0Thread1of1ForFork3InUse, 172#true, 37#L793true, Black: 225#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 193#(and (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1188~0#1.base| 0) |ULTIMATE.start_main_~#t1186~0#1.base| 0) |ULTIMATE.start_main_~#t1187~0#1.base| 0) |ULTIMATE.start_main_~#t1185~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1186~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1187~0#1.base|))), Black: 226#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 234#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 235#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (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 (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 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)))) (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)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (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: 174#(<= ~z~0 0), 195#true, 78#L2true, Black: 185#(and (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1188~0#1.base| 0) |ULTIMATE.start_main_~#t1186~0#1.base| 0) |ULTIMATE.start_main_~#t1187~0#1.base| 0) |ULTIMATE.start_main_~#t1185~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1186~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1187~0#1.base|)))]) [2023-11-19 08:04:47,525 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2023-11-19 08:04:47,525 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-19 08:04:47,525 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-19 08:04:47,526 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-19 08:04:47,526 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([451] L756-->L763: Formula: (let ((.cse0 (not (= (mod v_~x$r_buff1_thd1~0_24 256) 0))) (.cse1 (not (= (mod v_~x$w_buff0_used~0_153 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_26 256) 0)))) (let ((.cse3 (and (not (= (mod v_~x$w_buff0_used~0_154 256) 0)) .cse5)) (.cse2 (and .cse1 .cse5)) (.cse4 (and .cse0 (not (= (mod v_~x$w_buff1_used~0_143 256) 0))))) (and (= v_~x$r_buff1_thd1~0_23 (ite (or (and .cse0 (not (= (mod v_~x$w_buff1_used~0_142 256) 0))) (and (not (= (mod v_~x$r_buff0_thd1~0_25 256) 0)) .cse1)) 0 v_~x$r_buff1_thd1~0_24)) (= v_~x$r_buff0_thd1~0_25 (ite .cse2 0 v_~x$r_buff0_thd1~0_26)) (= v_~x$w_buff0_used~0_153 (ite .cse3 0 v_~x$w_buff0_used~0_154)) (= (ite .cse3 v_~x$w_buff0~0_72 (ite .cse4 v_~x$w_buff1~0_67 v_~x~0_108)) v_~x~0_107) (= v_~x$w_buff1_used~0_142 (ite (or .cse2 .cse4) 0 v_~x$w_buff1_used~0_143))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_26, ~x$w_buff1~0=v_~x$w_buff1~0_67, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_143, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_24, ~x~0=v_~x~0_108, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_154} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_25, ~x$w_buff1~0=v_~x$w_buff1~0_67, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_142, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_23, ~x~0=v_~x~0_107, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_153} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][156], [139#L832true, 111#L806true, Black: 198#(and (= ~x~0 0) (or (= 0 ~x$w_buff1~0) (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))) (or (= 0 ~x$w_buff0~0) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), Black: 197#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), 69#L786true, Black: 208#(and (= ~x~0 0) (= 0 ~x$w_buff0~0) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 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))) (= 0 ~x$r_buff0_thd0~0)), Black: 205#(and (= 2 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0)) (= ~x~0 ~x$w_buff1~0)), Black: 206#(or (and (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (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))))) (not (= 2 ~z~0)))) (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)))) (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: 204#(and (= ~x~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), 165#true, P3Thread1of1ForFork2InUse, Black: 218#(and (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 202#true, P1Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, 248#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P0Thread1of1ForFork3InUse, 172#true, Black: 225#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 193#(and (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1188~0#1.base| 0) |ULTIMATE.start_main_~#t1186~0#1.base| 0) |ULTIMATE.start_main_~#t1187~0#1.base| 0) |ULTIMATE.start_main_~#t1185~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1186~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1187~0#1.base|))), Black: 226#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 234#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 52#L763true, Black: 235#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (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 (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 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)))) (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)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (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: 174#(<= ~z~0 0), 195#true, 78#L2true, Black: 185#(and (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1188~0#1.base| 0) |ULTIMATE.start_main_~#t1186~0#1.base| 0) |ULTIMATE.start_main_~#t1187~0#1.base| 0) |ULTIMATE.start_main_~#t1185~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1186~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1187~0#1.base|)))]) [2023-11-19 08:04:47,526 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2023-11-19 08:04:47,526 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-19 08:04:47,527 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-19 08:04:47,527 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event