./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix023_power.opt_pso.opt_rmo.opt.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_a297050f-72df-4c33-a050-0a84e702dfaf/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a297050f-72df-4c33-a050-0a84e702dfaf/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_a297050f-72df-4c33-a050-0a84e702dfaf/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a297050f-72df-4c33-a050-0a84e702dfaf/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix023_power.opt_pso.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a297050f-72df-4c33-a050-0a84e702dfaf/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_a297050f-72df-4c33-a050-0a84e702dfaf/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 28f58acc3eb15266c6a84eca373e682a200492b696916dc340e2c03025141f5c --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:33:11,988 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:33:12,103 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a297050f-72df-4c33-a050-0a84e702dfaf/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-19 07:33:12,109 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:33:12,109 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:33:12,144 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:33:12,145 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:33:12,146 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:33:12,147 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:33:12,147 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:33:12,148 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:33:12,149 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:33:12,150 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:33:12,151 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:33:12,151 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:33:12,152 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:33:12,153 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:33:12,153 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:33:12,154 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-19 07:33:12,155 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-19 07:33:12,155 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-19 07:33:12,156 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:33:12,157 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-19 07:33:12,157 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-19 07:33:12,167 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:33:12,168 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:33:12,168 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:33:12,169 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:33:12,169 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:33:12,170 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:33:12,171 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:33:12,171 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:33:12,172 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 07:33:12,172 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 07:33:12,173 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:33:12,173 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:33:12,174 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:33:12,175 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:33:12,175 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_a297050f-72df-4c33-a050-0a84e702dfaf/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_a297050f-72df-4c33-a050-0a84e702dfaf/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 -> 28f58acc3eb15266c6a84eca373e682a200492b696916dc340e2c03025141f5c [2023-11-19 07:33:12,480 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:33:12,524 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:33:12,528 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:33:12,531 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:33:12,532 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:33:12,534 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a297050f-72df-4c33-a050-0a84e702dfaf/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/pthread-wmm/mix023_power.opt_pso.opt_rmo.opt.i [2023-11-19 07:33:15,951 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:33:16,272 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:33:16,273 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a297050f-72df-4c33-a050-0a84e702dfaf/sv-benchmarks/c/pthread-wmm/mix023_power.opt_pso.opt_rmo.opt.i [2023-11-19 07:33:16,295 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a297050f-72df-4c33-a050-0a84e702dfaf/bin/uautomizer-verify-uCwYo4JHxu/data/9a1b36eec/cbbd12cad7e640c887174ad669b37b46/FLAGef43f533b [2023-11-19 07:33:16,312 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a297050f-72df-4c33-a050-0a84e702dfaf/bin/uautomizer-verify-uCwYo4JHxu/data/9a1b36eec/cbbd12cad7e640c887174ad669b37b46 [2023-11-19 07:33:16,315 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:33:16,317 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:33:16,319 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:33:16,319 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:33:16,333 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:33:16,334 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:33:16" (1/1) ... [2023-11-19 07:33:16,339 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fd97c34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:33:16, skipping insertion in model container [2023-11-19 07:33:16,339 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:33:16" (1/1) ... [2023-11-19 07:33:16,428 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:33:16,914 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:33:16,928 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:33:17,000 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:33:17,043 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 07:33:17,044 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 07:33:17,050 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:33:17,051 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:33:17 WrapperNode [2023-11-19 07:33:17,051 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:33:17,052 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:33:17,052 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:33:17,052 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:33:17,060 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:33:17" (1/1) ... [2023-11-19 07:33:17,078 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:33:17" (1/1) ... [2023-11-19 07:33:17,111 INFO L138 Inliner]: procedures = 177, calls = 72, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 150 [2023-11-19 07:33:17,111 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:33:17,112 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:33:17,112 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:33:17,113 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:33:17,123 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:33:17" (1/1) ... [2023-11-19 07:33:17,124 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:33:17" (1/1) ... [2023-11-19 07:33:17,130 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:33:17" (1/1) ... [2023-11-19 07:33:17,130 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:33:17" (1/1) ... [2023-11-19 07:33:17,143 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:33:17" (1/1) ... [2023-11-19 07:33:17,145 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:33:17" (1/1) ... [2023-11-19 07:33:17,148 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:33:17" (1/1) ... [2023-11-19 07:33:17,151 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:33:17" (1/1) ... [2023-11-19 07:33:17,156 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:33:17,157 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:33:17,157 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:33:17,158 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:33:17,159 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:33:17" (1/1) ... [2023-11-19 07:33:17,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:33:17,183 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a297050f-72df-4c33-a050-0a84e702dfaf/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:33:17,197 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a297050f-72df-4c33-a050-0a84e702dfaf/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 07:33:17,235 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a297050f-72df-4c33-a050-0a84e702dfaf/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 07:33:17,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 07:33:17,251 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-19 07:33:17,251 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:33:17,251 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 07:33:17,251 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 07:33:17,251 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-19 07:33:17,251 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-19 07:33:17,252 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-19 07:33:17,252 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-19 07:33:17,252 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-19 07:33:17,252 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-19 07:33:17,252 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-19 07:33:17,252 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-19 07:33:17,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 07:33:17,253 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-19 07:33:17,253 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:33:17,253 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:33:17,254 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-19 07:33:17,420 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:33:17,422 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:33:17,849 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:33:18,007 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:33:18,007 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-19 07:33:18,012 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:33:18 BoogieIcfgContainer [2023-11-19 07:33:18,012 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:33:18,014 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:33:18,014 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:33:18,018 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:33:18,018 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:33:16" (1/3) ... [2023-11-19 07:33:18,019 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b783e53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:33:18, skipping insertion in model container [2023-11-19 07:33:18,019 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:33:17" (2/3) ... [2023-11-19 07:33:18,019 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b783e53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:33:18, skipping insertion in model container [2023-11-19 07:33:18,020 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:33:18" (3/3) ... [2023-11-19 07:33:18,021 INFO L112 eAbstractionObserver]: Analyzing ICFG mix023_power.opt_pso.opt_rmo.opt.i [2023-11-19 07:33:18,041 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:33:18,041 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-11-19 07:33:18,042 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-19 07:33:18,150 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-19 07:33:18,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 162 places, 153 transitions, 322 flow [2023-11-19 07:33:18,281 INFO L124 PetriNetUnfolderBase]: 4/149 cut-off events. [2023-11-19 07:33:18,281 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:33:18,288 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 128 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 07:33:18,288 INFO L82 GeneralOperation]: Start removeDead. Operand has 162 places, 153 transitions, 322 flow [2023-11-19 07:33:18,294 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 158 places, 149 transitions, 310 flow [2023-11-19 07:33:18,298 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-19 07:33:18,309 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 158 places, 149 transitions, 310 flow [2023-11-19 07:33:18,312 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 158 places, 149 transitions, 310 flow [2023-11-19 07:33:18,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 158 places, 149 transitions, 310 flow [2023-11-19 07:33:18,352 INFO L124 PetriNetUnfolderBase]: 4/149 cut-off events. [2023-11-19 07:33:18,352 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:33:18,354 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 128 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 07:33:18,359 INFO L119 LiptonReduction]: Number of co-enabled transitions 4346 [2023-11-19 07:33:24,457 INFO L134 LiptonReduction]: Checked pairs total: 9598 [2023-11-19 07:33:24,457 INFO L136 LiptonReduction]: Total number of compositions: 154 [2023-11-19 07:33:24,487 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:33:24,502 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;@34dcb89e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:33:24,502 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-11-19 07:33:24,505 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-19 07:33:24,505 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-11-19 07:33:24,506 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:33:24,506 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:33:24,507 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-19 07:33:24,507 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 07:33:24,513 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:33:24,513 INFO L85 PathProgramCache]: Analyzing trace with hash 654, now seen corresponding path program 1 times [2023-11-19 07:33:24,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:33:24,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92696338] [2023-11-19 07:33:24,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:33:24,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:33:24,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:24,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:33:24,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:33:24,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92696338] [2023-11-19 07:33:24,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92696338] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:33:24,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:33:24,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-19 07:33:24,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82719353] [2023-11-19 07:33:24,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:33:24,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 07:33:24,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:33:24,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 07:33:24,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 07:33:24,735 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 307 [2023-11-19 07:33:24,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 92 flow. Second operand has 2 states, 2 states have (on average 138.5) internal successors, (277), 2 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:24,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:33:24,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 307 [2023-11-19 07:33:24,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:33:26,599 INFO L124 PetriNetUnfolderBase]: 6935/9524 cut-off events. [2023-11-19 07:33:26,600 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2023-11-19 07:33:26,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19108 conditions, 9524 events. 6935/9524 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 476. Compared 49467 event pairs, 6935 based on Foata normal form. 0/8228 useless extension candidates. Maximal degree in co-relation 19096. Up to 9377 conditions per place. [2023-11-19 07:33:26,697 INFO L140 encePairwiseOnDemand]: 298/307 looper letters, 27 selfloop transitions, 0 changer transitions 0/31 dead transitions. [2023-11-19 07:33:26,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 31 transitions, 128 flow [2023-11-19 07:33:26,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 07:33:26,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-19 07:33:26,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 312 transitions. [2023-11-19 07:33:26,716 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.50814332247557 [2023-11-19 07:33:26,717 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 312 transitions. [2023-11-19 07:33:26,718 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 312 transitions. [2023-11-19 07:33:26,719 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:33:26,722 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 312 transitions. [2023-11-19 07:33:26,731 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 156.0) internal successors, (312), 2 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:26,736 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 307.0) internal successors, (921), 3 states have internal predecessors, (921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:26,738 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 307.0) internal successors, (921), 3 states have internal predecessors, (921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:26,740 INFO L175 Difference]: Start difference. First operand has 52 places, 40 transitions, 92 flow. Second operand 2 states and 312 transitions. [2023-11-19 07:33:26,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 31 transitions, 128 flow [2023-11-19 07:33:26,749 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 07:33:26,752 INFO L231 Difference]: Finished difference. Result has 41 places, 31 transitions, 70 flow [2023-11-19 07:33:26,754 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=70, PETRI_PLACES=41, PETRI_TRANSITIONS=31} [2023-11-19 07:33:26,758 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -11 predicate places. [2023-11-19 07:33:26,759 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 70 flow [2023-11-19 07:33:26,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 138.5) internal successors, (277), 2 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:26,760 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:33:26,760 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:33:26,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 07:33:26,760 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 07:33:26,761 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:33:26,761 INFO L85 PathProgramCache]: Analyzing trace with hash -92582469, now seen corresponding path program 1 times [2023-11-19 07:33:26,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:33:26,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178969205] [2023-11-19 07:33:26,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:33:26,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:33:26,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:27,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:33:27,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:33:27,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178969205] [2023-11-19 07:33:27,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178969205] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:33:27,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:33:27,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 07:33:27,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570604546] [2023-11-19 07:33:27,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:33:27,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:33:27,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:33:27,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:33:27,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:33:27,252 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 307 [2023-11-19 07:33:27,253 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:27,253 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:33:27,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 307 [2023-11-19 07:33:27,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:33:28,666 INFO L124 PetriNetUnfolderBase]: 5463/7944 cut-off events. [2023-11-19 07:33:28,667 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:33:28,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15541 conditions, 7944 events. 5463/7944 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 415. Compared 46512 event pairs, 1047 based on Foata normal form. 0/7380 useless extension candidates. Maximal degree in co-relation 15538. Up to 5857 conditions per place. [2023-11-19 07:33:28,745 INFO L140 encePairwiseOnDemand]: 304/307 looper letters, 39 selfloop transitions, 2 changer transitions 2/47 dead transitions. [2023-11-19 07:33:28,746 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 47 transitions, 190 flow [2023-11-19 07:33:28,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:33:28,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:33:28,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 455 transitions. [2023-11-19 07:33:28,753 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.494028230184582 [2023-11-19 07:33:28,753 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 455 transitions. [2023-11-19 07:33:28,753 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 455 transitions. [2023-11-19 07:33:28,755 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:33:28,755 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 455 transitions. [2023-11-19 07:33:28,759 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:28,765 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 307.0) internal successors, (1228), 4 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:28,769 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 307.0) internal successors, (1228), 4 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:28,770 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 70 flow. Second operand 3 states and 455 transitions. [2023-11-19 07:33:28,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 47 transitions, 190 flow [2023-11-19 07:33:28,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 47 transitions, 190 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-19 07:33:28,773 INFO L231 Difference]: Finished difference. Result has 42 places, 29 transitions, 70 flow [2023-11-19 07:33:28,773 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=42, PETRI_TRANSITIONS=29} [2023-11-19 07:33:28,775 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -10 predicate places. [2023-11-19 07:33:28,776 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 70 flow [2023-11-19 07:33:28,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:28,782 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:33:28,783 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:33:28,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 07:33:28,783 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 07:33:28,785 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:33:28,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1858522381, now seen corresponding path program 1 times [2023-11-19 07:33:28,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:33:28,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539937936] [2023-11-19 07:33:28,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:33:28,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:33:28,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:29,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:33:29,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:33:29,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539937936] [2023-11-19 07:33:29,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539937936] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:33:29,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:33:29,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 07:33:29,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877688720] [2023-11-19 07:33:29,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:33:29,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:33:29,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:33:29,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:33:29,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:33:29,148 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 307 [2023-11-19 07:33:29,149 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:29,149 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:33:29,150 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 307 [2023-11-19 07:33:29,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:33:32,620 INFO L124 PetriNetUnfolderBase]: 19938/26927 cut-off events. [2023-11-19 07:33:32,620 INFO L125 PetriNetUnfolderBase]: For 1224/1224 co-relation queries the response was YES. [2023-11-19 07:33:32,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55489 conditions, 26927 events. 19938/26927 cut-off events. For 1224/1224 co-relation queries the response was YES. Maximal size of possible extension queue 891. Compared 143730 event pairs, 6984 based on Foata normal form. 0/26347 useless extension candidates. Maximal degree in co-relation 55485. Up to 15861 conditions per place. [2023-11-19 07:33:32,836 INFO L140 encePairwiseOnDemand]: 296/307 looper letters, 43 selfloop transitions, 10 changer transitions 0/53 dead transitions. [2023-11-19 07:33:32,836 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 53 transitions, 230 flow [2023-11-19 07:33:32,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:33:32,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:33:32,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 429 transitions. [2023-11-19 07:33:32,839 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46579804560260585 [2023-11-19 07:33:32,839 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 429 transitions. [2023-11-19 07:33:32,840 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 429 transitions. [2023-11-19 07:33:32,840 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:33:32,841 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 429 transitions. [2023-11-19 07:33:32,842 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.0) internal successors, (429), 3 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:32,845 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 307.0) internal successors, (1228), 4 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:32,847 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 307.0) internal successors, (1228), 4 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:32,848 INFO L175 Difference]: Start difference. First operand has 42 places, 29 transitions, 70 flow. Second operand 3 states and 429 transitions. [2023-11-19 07:33:32,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 53 transitions, 230 flow [2023-11-19 07:33:32,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 53 transitions, 224 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 07:33:32,863 INFO L231 Difference]: Finished difference. Result has 43 places, 38 transitions, 144 flow [2023-11-19 07:33:32,863 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=144, PETRI_PLACES=43, PETRI_TRANSITIONS=38} [2023-11-19 07:33:32,865 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -9 predicate places. [2023-11-19 07:33:32,865 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 38 transitions, 144 flow [2023-11-19 07:33:32,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:32,866 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:33:32,866 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:33:32,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 07:33:32,873 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 07:33:32,874 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:33:32,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1779620963, now seen corresponding path program 1 times [2023-11-19 07:33:32,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:33:32,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523401226] [2023-11-19 07:33:32,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:33:32,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:33:32,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:33,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:33:33,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:33:33,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523401226] [2023-11-19 07:33:33,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523401226] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:33:33,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:33:33,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:33:33,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461337602] [2023-11-19 07:33:33,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:33:33,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:33:33,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:33:33,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:33:33,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:33:33,241 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 307 [2023-11-19 07:33:33,243 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 38 transitions, 144 flow. Second operand has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:33,243 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:33:33,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 307 [2023-11-19 07:33:33,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:33:36,261 INFO L124 PetriNetUnfolderBase]: 19732/26649 cut-off events. [2023-11-19 07:33:36,261 INFO L125 PetriNetUnfolderBase]: For 12296/12296 co-relation queries the response was YES. [2023-11-19 07:33:36,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71060 conditions, 26649 events. 19732/26649 cut-off events. For 12296/12296 co-relation queries the response was YES. Maximal size of possible extension queue 887. Compared 141213 event pairs, 1578 based on Foata normal form. 32/26681 useless extension candidates. Maximal degree in co-relation 71055. Up to 14913 conditions per place. [2023-11-19 07:33:36,631 INFO L140 encePairwiseOnDemand]: 296/307 looper letters, 59 selfloop transitions, 14 changer transitions 0/73 dead transitions. [2023-11-19 07:33:36,631 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 73 transitions, 404 flow [2023-11-19 07:33:36,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:33:36,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 07:33:36,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 568 transitions. [2023-11-19 07:33:36,635 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46254071661237783 [2023-11-19 07:33:36,635 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 568 transitions. [2023-11-19 07:33:36,635 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 568 transitions. [2023-11-19 07:33:36,636 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:33:36,636 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 568 transitions. [2023-11-19 07:33:36,638 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:36,641 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 307.0) internal successors, (1535), 5 states have internal predecessors, (1535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:36,642 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 307.0) internal successors, (1535), 5 states have internal predecessors, (1535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:36,642 INFO L175 Difference]: Start difference. First operand has 43 places, 38 transitions, 144 flow. Second operand 4 states and 568 transitions. [2023-11-19 07:33:36,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 73 transitions, 404 flow [2023-11-19 07:33:36,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 73 transitions, 370 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 07:33:36,691 INFO L231 Difference]: Finished difference. Result has 47 places, 47 transitions, 232 flow [2023-11-19 07:33:36,692 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=232, PETRI_PLACES=47, PETRI_TRANSITIONS=47} [2023-11-19 07:33:36,693 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -5 predicate places. [2023-11-19 07:33:36,694 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 47 transitions, 232 flow [2023-11-19 07:33:36,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:36,694 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:33:36,695 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:33:36,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 07:33:36,695 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 07:33:36,695 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:33:36,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1779621738, now seen corresponding path program 1 times [2023-11-19 07:33:36,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:33:36,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41699200] [2023-11-19 07:33:36,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:33:36,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:33:36,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:36,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:33:36,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:33:36,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41699200] [2023-11-19 07:33:36,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41699200] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:33:36,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:33:36,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 07:33:36,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650908482] [2023-11-19 07:33:36,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:33:36,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:33:36,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:33:36,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:33:36,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:33:36,905 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 307 [2023-11-19 07:33:36,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 47 transitions, 232 flow. Second operand has 3 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:36,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:33:36,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 307 [2023-11-19 07:33:36,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:33:39,298 INFO L124 PetriNetUnfolderBase]: 15315/21935 cut-off events. [2023-11-19 07:33:39,298 INFO L125 PetriNetUnfolderBase]: For 21417/21747 co-relation queries the response was YES. [2023-11-19 07:33:39,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61076 conditions, 21935 events. 15315/21935 cut-off events. For 21417/21747 co-relation queries the response was YES. Maximal size of possible extension queue 943. Compared 133468 event pairs, 6004 based on Foata normal form. 241/21644 useless extension candidates. Maximal degree in co-relation 61069. Up to 18214 conditions per place. [2023-11-19 07:33:39,567 INFO L140 encePairwiseOnDemand]: 303/307 looper letters, 54 selfloop transitions, 6 changer transitions 0/71 dead transitions. [2023-11-19 07:33:39,567 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 71 transitions, 446 flow [2023-11-19 07:33:39,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:33:39,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:33:39,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 450 transitions. [2023-11-19 07:33:39,570 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48859934853420195 [2023-11-19 07:33:39,571 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 450 transitions. [2023-11-19 07:33:39,571 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 450 transitions. [2023-11-19 07:33:39,572 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:33:39,572 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 450 transitions. [2023-11-19 07:33:39,574 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 150.0) internal successors, (450), 3 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:39,577 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 307.0) internal successors, (1228), 4 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:39,578 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 307.0) internal successors, (1228), 4 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:39,579 INFO L175 Difference]: Start difference. First operand has 47 places, 47 transitions, 232 flow. Second operand 3 states and 450 transitions. [2023-11-19 07:33:39,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 71 transitions, 446 flow [2023-11-19 07:33:39,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 71 transitions, 446 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-19 07:33:39,636 INFO L231 Difference]: Finished difference. Result has 50 places, 52 transitions, 292 flow [2023-11-19 07:33:39,637 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=292, PETRI_PLACES=50, PETRI_TRANSITIONS=52} [2023-11-19 07:33:39,639 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -2 predicate places. [2023-11-19 07:33:39,640 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 52 transitions, 292 flow [2023-11-19 07:33:39,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:39,641 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:33:39,641 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:33:39,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 07:33:39,642 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 07:33:39,642 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:33:39,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1779617884, now seen corresponding path program 1 times [2023-11-19 07:33:39,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:33:39,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341589083] [2023-11-19 07:33:39,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:33:39,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:33:39,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:40,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:33:40,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:33:40,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341589083] [2023-11-19 07:33:40,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341589083] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:33:40,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:33:40,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:33:40,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915650784] [2023-11-19 07:33:40,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:33:40,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:33:40,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:33:40,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:33:40,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:33:40,835 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 307 [2023-11-19 07:33:40,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 52 transitions, 292 flow. Second operand has 7 states, 7 states have (on average 119.71428571428571) internal successors, (838), 7 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:40,837 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:33:40,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 307 [2023-11-19 07:33:40,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:33:43,301 INFO L124 PetriNetUnfolderBase]: 12782/18128 cut-off events. [2023-11-19 07:33:43,301 INFO L125 PetriNetUnfolderBase]: For 26548/27501 co-relation queries the response was YES. [2023-11-19 07:33:43,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55758 conditions, 18128 events. 12782/18128 cut-off events. For 26548/27501 co-relation queries the response was YES. Maximal size of possible extension queue 884. Compared 108106 event pairs, 2726 based on Foata normal form. 1214/18493 useless extension candidates. Maximal degree in co-relation 55749. Up to 11530 conditions per place. [2023-11-19 07:33:43,460 INFO L140 encePairwiseOnDemand]: 301/307 looper letters, 62 selfloop transitions, 4 changer transitions 29/106 dead transitions. [2023-11-19 07:33:43,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 106 transitions, 789 flow [2023-11-19 07:33:43,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:33:43,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-19 07:33:43,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 881 transitions. [2023-11-19 07:33:43,465 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4099581200558399 [2023-11-19 07:33:43,466 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 881 transitions. [2023-11-19 07:33:43,466 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 881 transitions. [2023-11-19 07:33:43,467 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:33:43,467 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 881 transitions. [2023-11-19 07:33:43,470 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 125.85714285714286) internal successors, (881), 7 states have internal predecessors, (881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:43,476 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 307.0) internal successors, (2456), 8 states have internal predecessors, (2456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:43,478 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 307.0) internal successors, (2456), 8 states have internal predecessors, (2456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:43,478 INFO L175 Difference]: Start difference. First operand has 50 places, 52 transitions, 292 flow. Second operand 7 states and 881 transitions. [2023-11-19 07:33:43,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 106 transitions, 789 flow [2023-11-19 07:33:43,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 106 transitions, 772 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-19 07:33:43,559 INFO L231 Difference]: Finished difference. Result has 54 places, 48 transitions, 274 flow [2023-11-19 07:33:43,559 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=274, PETRI_PLACES=54, PETRI_TRANSITIONS=48} [2023-11-19 07:33:43,563 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 2 predicate places. [2023-11-19 07:33:43,564 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 48 transitions, 274 flow [2023-11-19 07:33:43,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 119.71428571428571) internal successors, (838), 7 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:43,565 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:33:43,565 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:33:43,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 07:33:43,566 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 07:33:43,566 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:33:43,566 INFO L85 PathProgramCache]: Analyzing trace with hash 620189698, now seen corresponding path program 1 times [2023-11-19 07:33:43,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:33:43,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209097465] [2023-11-19 07:33:43,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:33:43,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:33:43,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:43,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:33:43,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:33:43,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209097465] [2023-11-19 07:33:43,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209097465] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:33:43,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:33:43,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 07:33:43,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111391676] [2023-11-19 07:33:43,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:33:43,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:33:43,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:33:43,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:33:43,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:33:43,798 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 307 [2023-11-19 07:33:43,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 48 transitions, 274 flow. Second operand has 3 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:43,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:33:43,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 307 [2023-11-19 07:33:43,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:33:45,256 INFO L124 PetriNetUnfolderBase]: 9309/13348 cut-off events. [2023-11-19 07:33:45,256 INFO L125 PetriNetUnfolderBase]: For 18851/19376 co-relation queries the response was YES. [2023-11-19 07:33:45,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38647 conditions, 13348 events. 9309/13348 cut-off events. For 18851/19376 co-relation queries the response was YES. Maximal size of possible extension queue 553. Compared 74792 event pairs, 3075 based on Foata normal form. 356/13482 useless extension candidates. Maximal degree in co-relation 38638. Up to 8187 conditions per place. [2023-11-19 07:33:45,372 INFO L140 encePairwiseOnDemand]: 304/307 looper letters, 54 selfloop transitions, 3 changer transitions 0/66 dead transitions. [2023-11-19 07:33:45,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 66 transitions, 480 flow [2023-11-19 07:33:45,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:33:45,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:33:45,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 444 transitions. [2023-11-19 07:33:45,375 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4820846905537459 [2023-11-19 07:33:45,375 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 444 transitions. [2023-11-19 07:33:45,375 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 444 transitions. [2023-11-19 07:33:45,376 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:33:45,376 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 444 transitions. [2023-11-19 07:33:45,378 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 148.0) internal successors, (444), 3 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:45,381 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 307.0) internal successors, (1228), 4 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:45,382 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 307.0) internal successors, (1228), 4 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:45,382 INFO L175 Difference]: Start difference. First operand has 54 places, 48 transitions, 274 flow. Second operand 3 states and 444 transitions. [2023-11-19 07:33:45,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 66 transitions, 480 flow [2023-11-19 07:33:45,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 66 transitions, 473 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-19 07:33:45,423 INFO L231 Difference]: Finished difference. Result has 51 places, 48 transitions, 278 flow [2023-11-19 07:33:45,424 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=267, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=278, PETRI_PLACES=51, PETRI_TRANSITIONS=48} [2023-11-19 07:33:45,424 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -1 predicate places. [2023-11-19 07:33:45,425 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 48 transitions, 278 flow [2023-11-19 07:33:45,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:45,425 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:33:45,425 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:33:45,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 07:33:45,426 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 07:33:45,426 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:33:45,426 INFO L85 PathProgramCache]: Analyzing trace with hash -967468973, now seen corresponding path program 1 times [2023-11-19 07:33:45,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:33:45,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461150641] [2023-11-19 07:33:45,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:33:45,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:33:45,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:45,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:33:45,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:33:45,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461150641] [2023-11-19 07:33:45,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461150641] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:33:45,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:33:45,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 07:33:45,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313553919] [2023-11-19 07:33:45,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:33:45,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:33:45,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:33:45,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:33:45,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:33:45,660 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 307 [2023-11-19 07:33:45,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 48 transitions, 278 flow. Second operand has 3 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:45,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:33:45,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 307 [2023-11-19 07:33:45,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:33:47,102 INFO L124 PetriNetUnfolderBase]: 8769/12522 cut-off events. [2023-11-19 07:33:47,102 INFO L125 PetriNetUnfolderBase]: For 19769/20009 co-relation queries the response was YES. [2023-11-19 07:33:47,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37442 conditions, 12522 events. 8769/12522 cut-off events. For 19769/20009 co-relation queries the response was YES. Maximal size of possible extension queue 545. Compared 70923 event pairs, 2616 based on Foata normal form. 261/12182 useless extension candidates. Maximal degree in co-relation 37432. Up to 7913 conditions per place. [2023-11-19 07:33:47,192 INFO L140 encePairwiseOnDemand]: 304/307 looper letters, 56 selfloop transitions, 4 changer transitions 0/68 dead transitions. [2023-11-19 07:33:47,193 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 68 transitions, 481 flow [2023-11-19 07:33:47,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:33:47,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:33:47,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 448 transitions. [2023-11-19 07:33:47,196 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48642779587404994 [2023-11-19 07:33:47,196 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 448 transitions. [2023-11-19 07:33:47,197 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 448 transitions. [2023-11-19 07:33:47,197 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:33:47,198 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 448 transitions. [2023-11-19 07:33:47,199 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 149.33333333333334) internal successors, (448), 3 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:47,202 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 307.0) internal successors, (1228), 4 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:47,204 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 307.0) internal successors, (1228), 4 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:47,204 INFO L175 Difference]: Start difference. First operand has 51 places, 48 transitions, 278 flow. Second operand 3 states and 448 transitions. [2023-11-19 07:33:47,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 68 transitions, 481 flow [2023-11-19 07:33:47,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 68 transitions, 475 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 07:33:47,266 INFO L231 Difference]: Finished difference. Result has 52 places, 48 transitions, 286 flow [2023-11-19 07:33:47,267 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=286, PETRI_PLACES=52, PETRI_TRANSITIONS=48} [2023-11-19 07:33:47,268 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 0 predicate places. [2023-11-19 07:33:47,268 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 48 transitions, 286 flow [2023-11-19 07:33:47,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:47,269 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:33:47,269 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:33:47,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-19 07:33:47,269 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 07:33:47,270 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:33:47,270 INFO L85 PathProgramCache]: Analyzing trace with hash 73212619, now seen corresponding path program 1 times [2023-11-19 07:33:47,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:33:47,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232756477] [2023-11-19 07:33:47,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:33:47,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:33:47,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:47,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:33:47,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:33:47,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232756477] [2023-11-19 07:33:47,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232756477] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:33:47,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:33:47,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:33:47,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312239466] [2023-11-19 07:33:47,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:33:47,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:33:47,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:33:47,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:33:47,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:33:47,498 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 307 [2023-11-19 07:33:47,499 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 48 transitions, 286 flow. Second operand has 4 states, 4 states have (on average 134.25) internal successors, (537), 4 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:47,499 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:33:47,499 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 307 [2023-11-19 07:33:47,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:33:48,726 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([459] L835-->L842: Formula: (let ((.cse1 (not (= (mod v_~y$w_buff0_used~0_117 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0))) (.cse0 (not (= (mod v_~y$r_buff1_thd4~0_22 256) 0)))) (let ((.cse2 (and (not (= (mod v_~y$w_buff1_used~0_103 256) 0)) .cse0)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_118 256) 0)) .cse5)) (.cse3 (and .cse1 .cse5))) (and (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_102 256) 0)) .cse0) (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse1)) 0 v_~y$r_buff1_thd4~0_22) v_~y$r_buff1_thd4~0_21) (= (ite (or .cse2 .cse3) 0 v_~y$w_buff1_used~0_103) v_~y$w_buff1_used~0_102) (= v_~y~0_72 (ite .cse4 v_~y$w_buff0~0_54 (ite .cse2 v_~y$w_buff1~0_47 v_~y~0_73))) (= v_~y$w_buff0_used~0_117 (ite .cse4 0 v_~y$w_buff0_used~0_118)) (= v_~y$r_buff0_thd4~0_25 (ite .cse3 0 v_~y$r_buff0_thd4~0_26))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_22, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_118, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$w_buff0~0=v_~y$w_buff0~0_54, ~y~0=v_~y~0_73, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_103} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_21, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_117, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$w_buff0~0=v_~y$w_buff0~0_54, ~y~0=v_~y~0_72, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_102} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][107], [72#L812true, P3Thread1of1ForFork1InUse, P1Thread1of1ForFork0InUse, 83#L2true, 88#P0EXITtrue, 6#L842true, Black: 203#(= ~__unbuffered_p3_EAX~0 0), 211#true, Black: 174#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 208#(= ~__unbuffered_p1_EAX~0 0), 39#P1EXITtrue, Black: 181#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 165#true, Black: 180#(= ~z~0 0), 206#true, 196#(and (not (= |ULTIMATE.start_main_~#t606~0#1.base| |ULTIMATE.start_main_~#t605~0#1.base|)) (not (= |ULTIMATE.start_main_~#t607~0#1.base| |ULTIMATE.start_main_~#t605~0#1.base|)) (not (= |ULTIMATE.start_main_~#t607~0#1.base| |ULTIMATE.start_main_~#t606~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t606~0#1.base| 0) |ULTIMATE.start_main_~#t607~0#1.base| 0) |ULTIMATE.start_main_~#t608~0#1.base| 0) |ULTIMATE.start_main_~#t605~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t608~0#1.base| |ULTIMATE.start_main_~#t607~0#1.base|)) (not (= |ULTIMATE.start_main_~#t608~0#1.base| |ULTIMATE.start_main_~#t606~0#1.base|)) (not (= |ULTIMATE.start_main_~#t608~0#1.base| |ULTIMATE.start_main_~#t605~0#1.base|))), P2Thread1of1ForFork3InUse, Black: 188#(= ~x~0 0), 178#true, P0Thread1of1ForFork2InUse]) [2023-11-19 07:33:48,727 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-11-19 07:33:48,727 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-19 07:33:48,727 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-19 07:33:48,727 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-19 07:33:48,771 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([459] L835-->L842: Formula: (let ((.cse1 (not (= (mod v_~y$w_buff0_used~0_117 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0))) (.cse0 (not (= (mod v_~y$r_buff1_thd4~0_22 256) 0)))) (let ((.cse2 (and (not (= (mod v_~y$w_buff1_used~0_103 256) 0)) .cse0)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_118 256) 0)) .cse5)) (.cse3 (and .cse1 .cse5))) (and (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_102 256) 0)) .cse0) (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse1)) 0 v_~y$r_buff1_thd4~0_22) v_~y$r_buff1_thd4~0_21) (= (ite (or .cse2 .cse3) 0 v_~y$w_buff1_used~0_103) v_~y$w_buff1_used~0_102) (= v_~y~0_72 (ite .cse4 v_~y$w_buff0~0_54 (ite .cse2 v_~y$w_buff1~0_47 v_~y~0_73))) (= v_~y$w_buff0_used~0_117 (ite .cse4 0 v_~y$w_buff0_used~0_118)) (= v_~y$r_buff0_thd4~0_25 (ite .cse3 0 v_~y$r_buff0_thd4~0_26))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_22, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_118, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$w_buff0~0=v_~y$w_buff0~0_54, ~y~0=v_~y~0_73, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_103} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_21, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_117, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$w_buff0~0=v_~y$w_buff0~0_54, ~y~0=v_~y~0_72, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_102} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][108], [72#L812true, P3Thread1of1ForFork1InUse, P1Thread1of1ForFork0InUse, 83#L2true, 88#P0EXITtrue, 6#L842true, Black: 203#(= ~__unbuffered_p3_EAX~0 0), 214#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 174#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 208#(= ~__unbuffered_p1_EAX~0 0), Black: 181#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 39#P1EXITtrue, 165#true, Black: 180#(= ~z~0 0), 206#true, 196#(and (not (= |ULTIMATE.start_main_~#t606~0#1.base| |ULTIMATE.start_main_~#t605~0#1.base|)) (not (= |ULTIMATE.start_main_~#t607~0#1.base| |ULTIMATE.start_main_~#t605~0#1.base|)) (not (= |ULTIMATE.start_main_~#t607~0#1.base| |ULTIMATE.start_main_~#t606~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t606~0#1.base| 0) |ULTIMATE.start_main_~#t607~0#1.base| 0) |ULTIMATE.start_main_~#t608~0#1.base| 0) |ULTIMATE.start_main_~#t605~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t608~0#1.base| |ULTIMATE.start_main_~#t607~0#1.base|)) (not (= |ULTIMATE.start_main_~#t608~0#1.base| |ULTIMATE.start_main_~#t606~0#1.base|)) (not (= |ULTIMATE.start_main_~#t608~0#1.base| |ULTIMATE.start_main_~#t605~0#1.base|))), P2Thread1of1ForFork3InUse, Black: 188#(= ~x~0 0), 178#true, P0Thread1of1ForFork2InUse]) [2023-11-19 07:33:48,772 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-11-19 07:33:48,772 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-19 07:33:48,772 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-19 07:33:48,772 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-19 07:33:48,790 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([451] L812-->L819: Formula: (let ((.cse5 (not (= (mod v_~y$r_buff0_thd3~0_27 256) 0))) (.cse2 (not (= (mod v_~y$w_buff0_used~0_99 256) 0))) (.cse1 (not (= (mod v_~y$r_buff1_thd3~0_20 256) 0)))) (let ((.cse4 (and (not (= (mod v_~y$w_buff1_used~0_89 256) 0)) .cse1)) (.cse0 (and .cse5 .cse2)) (.cse3 (and (not (= (mod v_~y$w_buff0_used~0_100 256) 0)) .cse5))) (and (= (ite .cse0 0 v_~y$r_buff0_thd3~0_27) v_~y$r_buff0_thd3~0_26) (= (ite (or (and .cse1 (not (= (mod v_~y$w_buff1_used~0_88 256) 0))) (and (not (= 0 (mod v_~y$r_buff0_thd3~0_26 256))) .cse2)) 0 v_~y$r_buff1_thd3~0_20) v_~y$r_buff1_thd3~0_19) (= v_~y~0_60 (ite .cse3 v_~y$w_buff0~0_40 (ite .cse4 v_~y$w_buff1~0_37 v_~y~0_61))) (= (ite (or .cse4 .cse0) 0 v_~y$w_buff1_used~0_89) v_~y$w_buff1_used~0_88) (= v_~y$w_buff0_used~0_99 (ite .cse3 0 v_~y$w_buff0_used~0_100))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_100, ~y$w_buff1~0=v_~y$w_buff1~0_37, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_27, ~y$w_buff0~0=v_~y$w_buff0~0_40, ~y~0=v_~y~0_61, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_89} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_99, ~y$w_buff1~0=v_~y$w_buff1~0_37, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_26, ~y$w_buff0~0=v_~y$w_buff0~0_40, ~y~0=v_~y~0_60, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_88} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][49], [P3Thread1of1ForFork1InUse, P1Thread1of1ForFork0InUse, 83#L2true, 88#P0EXITtrue, Black: 203#(= ~__unbuffered_p3_EAX~0 0), Black: 172#true, 211#true, Black: 208#(= ~__unbuffered_p1_EAX~0 0), 15#L819true, 181#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 39#P1EXITtrue, 165#true, Black: 180#(= ~z~0 0), Black: 178#true, 206#true, P2Thread1of1ForFork3InUse, 196#(and (not (= |ULTIMATE.start_main_~#t606~0#1.base| |ULTIMATE.start_main_~#t605~0#1.base|)) (not (= |ULTIMATE.start_main_~#t607~0#1.base| |ULTIMATE.start_main_~#t605~0#1.base|)) (not (= |ULTIMATE.start_main_~#t607~0#1.base| |ULTIMATE.start_main_~#t606~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t606~0#1.base| 0) |ULTIMATE.start_main_~#t607~0#1.base| 0) |ULTIMATE.start_main_~#t608~0#1.base| 0) |ULTIMATE.start_main_~#t605~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t608~0#1.base| |ULTIMATE.start_main_~#t607~0#1.base|)) (not (= |ULTIMATE.start_main_~#t608~0#1.base| |ULTIMATE.start_main_~#t606~0#1.base|)) (not (= |ULTIMATE.start_main_~#t608~0#1.base| |ULTIMATE.start_main_~#t605~0#1.base|))), Black: 188#(= ~x~0 0), P0Thread1of1ForFork2InUse, 23#L835true]) [2023-11-19 07:33:48,791 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-11-19 07:33:48,791 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-19 07:33:48,791 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-19 07:33:48,791 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-19 07:33:48,804 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([451] L812-->L819: Formula: (let ((.cse5 (not (= (mod v_~y$r_buff0_thd3~0_27 256) 0))) (.cse2 (not (= (mod v_~y$w_buff0_used~0_99 256) 0))) (.cse1 (not (= (mod v_~y$r_buff1_thd3~0_20 256) 0)))) (let ((.cse4 (and (not (= (mod v_~y$w_buff1_used~0_89 256) 0)) .cse1)) (.cse0 (and .cse5 .cse2)) (.cse3 (and (not (= (mod v_~y$w_buff0_used~0_100 256) 0)) .cse5))) (and (= (ite .cse0 0 v_~y$r_buff0_thd3~0_27) v_~y$r_buff0_thd3~0_26) (= (ite (or (and .cse1 (not (= (mod v_~y$w_buff1_used~0_88 256) 0))) (and (not (= 0 (mod v_~y$r_buff0_thd3~0_26 256))) .cse2)) 0 v_~y$r_buff1_thd3~0_20) v_~y$r_buff1_thd3~0_19) (= v_~y~0_60 (ite .cse3 v_~y$w_buff0~0_40 (ite .cse4 v_~y$w_buff1~0_37 v_~y~0_61))) (= (ite (or .cse4 .cse0) 0 v_~y$w_buff1_used~0_89) v_~y$w_buff1_used~0_88) (= v_~y$w_buff0_used~0_99 (ite .cse3 0 v_~y$w_buff0_used~0_100))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_100, ~y$w_buff1~0=v_~y$w_buff1~0_37, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_27, ~y$w_buff0~0=v_~y$w_buff0~0_40, ~y~0=v_~y~0_61, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_89} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_99, ~y$w_buff1~0=v_~y$w_buff1~0_37, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_26, ~y$w_buff0~0=v_~y$w_buff0~0_40, ~y~0=v_~y~0_60, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_88} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][103], [P3Thread1of1ForFork1InUse, P1Thread1of1ForFork0InUse, 83#L2true, 88#P0EXITtrue, Black: 203#(= ~__unbuffered_p3_EAX~0 0), 214#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 172#true, Black: 208#(= ~__unbuffered_p1_EAX~0 0), 15#L819true, 181#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 39#P1EXITtrue, 165#true, Black: 180#(= ~z~0 0), Black: 178#true, 206#true, P2Thread1of1ForFork3InUse, 196#(and (not (= |ULTIMATE.start_main_~#t606~0#1.base| |ULTIMATE.start_main_~#t605~0#1.base|)) (not (= |ULTIMATE.start_main_~#t607~0#1.base| |ULTIMATE.start_main_~#t605~0#1.base|)) (not (= |ULTIMATE.start_main_~#t607~0#1.base| |ULTIMATE.start_main_~#t606~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t606~0#1.base| 0) |ULTIMATE.start_main_~#t607~0#1.base| 0) |ULTIMATE.start_main_~#t608~0#1.base| 0) |ULTIMATE.start_main_~#t605~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t608~0#1.base| |ULTIMATE.start_main_~#t607~0#1.base|)) (not (= |ULTIMATE.start_main_~#t608~0#1.base| |ULTIMATE.start_main_~#t606~0#1.base|)) (not (= |ULTIMATE.start_main_~#t608~0#1.base| |ULTIMATE.start_main_~#t605~0#1.base|))), Black: 188#(= ~x~0 0), P0Thread1of1ForFork2InUse, 23#L835true]) [2023-11-19 07:33:48,804 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-11-19 07:33:48,804 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-19 07:33:48,804 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-19 07:33:48,804 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-19 07:33:48,849 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([604] L877-->ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= (ite (= (ite (not (and (= 2 v_~__unbuffered_p3_EAX~0_18) (= v_~__unbuffered_p1_EBX~0_30 0) (= v_~x~0_24 2) (= 0 v_~__unbuffered_p3_EBX~0_16) (= v_~z~0_20 2) (= 2 v_~__unbuffered_p1_EAX~0_18))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_16) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_30| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_44|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_44| 0) (= (mod v_~main$tmp_guard1~0_16 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_30|)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_30, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_18, ~z~0=v_~z~0_20, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_16, ~x~0=v_~x~0_24} OutVars{ULTIMATE.start_reach_error_#t~nondet0#1.offset=|v_ULTIMATE.start_reach_error_#t~nondet0#1.offset_30|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_44|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_30, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_30|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ULTIMATE.start_reach_error_#t~nondet0#1.base=|v_ULTIMATE.start_reach_error_#t~nondet0#1.base_30|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_18, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~z~0=v_~z~0_20, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_16, ~x~0=v_~x~0_24} AuxVars[] AssignedVars[ULTIMATE.start_reach_error_#t~nondet0#1.offset, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_reach_error_#t~nondet0#1.base, ~main$tmp_guard1~0][122], [72#L812true, P3Thread1of1ForFork1InUse, P1Thread1of1ForFork0InUse, 88#P0EXITtrue, Black: 203#(= ~__unbuffered_p3_EAX~0 0), 211#true, Black: 174#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 208#(= ~__unbuffered_p1_EAX~0 0), 78#ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAKtrue, 39#P1EXITtrue, Black: 181#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 180#(= ~z~0 0), 165#true, 206#true, 196#(and (not (= |ULTIMATE.start_main_~#t606~0#1.base| |ULTIMATE.start_main_~#t605~0#1.base|)) (not (= |ULTIMATE.start_main_~#t607~0#1.base| |ULTIMATE.start_main_~#t605~0#1.base|)) (not (= |ULTIMATE.start_main_~#t607~0#1.base| |ULTIMATE.start_main_~#t606~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t606~0#1.base| 0) |ULTIMATE.start_main_~#t607~0#1.base| 0) |ULTIMATE.start_main_~#t608~0#1.base| 0) |ULTIMATE.start_main_~#t605~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t608~0#1.base| |ULTIMATE.start_main_~#t607~0#1.base|)) (not (= |ULTIMATE.start_main_~#t608~0#1.base| |ULTIMATE.start_main_~#t606~0#1.base|)) (not (= |ULTIMATE.start_main_~#t608~0#1.base| |ULTIMATE.start_main_~#t605~0#1.base|))), P2Thread1of1ForFork3InUse, Black: 188#(= ~x~0 0), 178#true, P0Thread1of1ForFork2InUse, 23#L835true]) [2023-11-19 07:33:48,849 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-11-19 07:33:48,849 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-19 07:33:48,850 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-19 07:33:48,850 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-19 07:33:48,850 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([459] L835-->L842: Formula: (let ((.cse1 (not (= (mod v_~y$w_buff0_used~0_117 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0))) (.cse0 (not (= (mod v_~y$r_buff1_thd4~0_22 256) 0)))) (let ((.cse2 (and (not (= (mod v_~y$w_buff1_used~0_103 256) 0)) .cse0)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_118 256) 0)) .cse5)) (.cse3 (and .cse1 .cse5))) (and (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_102 256) 0)) .cse0) (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse1)) 0 v_~y$r_buff1_thd4~0_22) v_~y$r_buff1_thd4~0_21) (= (ite (or .cse2 .cse3) 0 v_~y$w_buff1_used~0_103) v_~y$w_buff1_used~0_102) (= v_~y~0_72 (ite .cse4 v_~y$w_buff0~0_54 (ite .cse2 v_~y$w_buff1~0_47 v_~y~0_73))) (= v_~y$w_buff0_used~0_117 (ite .cse4 0 v_~y$w_buff0_used~0_118)) (= v_~y$r_buff0_thd4~0_25 (ite .cse3 0 v_~y$r_buff0_thd4~0_26))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_22, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_118, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$w_buff0~0=v_~y$w_buff0~0_54, ~y~0=v_~y~0_73, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_103} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_21, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_117, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$w_buff0~0=v_~y$w_buff0~0_54, ~y~0=v_~y~0_72, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_102} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][107], [72#L812true, P3Thread1of1ForFork1InUse, P1Thread1of1ForFork0InUse, 88#P0EXITtrue, 6#L842true, Black: 203#(= ~__unbuffered_p3_EAX~0 0), 211#true, 17#L877true, Black: 174#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 208#(= ~__unbuffered_p1_EAX~0 0), 39#P1EXITtrue, Black: 181#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 165#true, Black: 180#(= ~z~0 0), 206#true, 196#(and (not (= |ULTIMATE.start_main_~#t606~0#1.base| |ULTIMATE.start_main_~#t605~0#1.base|)) (not (= |ULTIMATE.start_main_~#t607~0#1.base| |ULTIMATE.start_main_~#t605~0#1.base|)) (not (= |ULTIMATE.start_main_~#t607~0#1.base| |ULTIMATE.start_main_~#t606~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t606~0#1.base| 0) |ULTIMATE.start_main_~#t607~0#1.base| 0) |ULTIMATE.start_main_~#t608~0#1.base| 0) |ULTIMATE.start_main_~#t605~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t608~0#1.base| |ULTIMATE.start_main_~#t607~0#1.base|)) (not (= |ULTIMATE.start_main_~#t608~0#1.base| |ULTIMATE.start_main_~#t606~0#1.base|)) (not (= |ULTIMATE.start_main_~#t608~0#1.base| |ULTIMATE.start_main_~#t605~0#1.base|))), P2Thread1of1ForFork3InUse, Black: 188#(= ~x~0 0), 178#true, P0Thread1of1ForFork2InUse]) [2023-11-19 07:33:48,850 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-11-19 07:33:48,850 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-19 07:33:48,850 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-19 07:33:48,850 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-19 07:33:48,898 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([451] L812-->L819: Formula: (let ((.cse5 (not (= (mod v_~y$r_buff0_thd3~0_27 256) 0))) (.cse2 (not (= (mod v_~y$w_buff0_used~0_99 256) 0))) (.cse1 (not (= (mod v_~y$r_buff1_thd3~0_20 256) 0)))) (let ((.cse4 (and (not (= (mod v_~y$w_buff1_used~0_89 256) 0)) .cse1)) (.cse0 (and .cse5 .cse2)) (.cse3 (and (not (= (mod v_~y$w_buff0_used~0_100 256) 0)) .cse5))) (and (= (ite .cse0 0 v_~y$r_buff0_thd3~0_27) v_~y$r_buff0_thd3~0_26) (= (ite (or (and .cse1 (not (= (mod v_~y$w_buff1_used~0_88 256) 0))) (and (not (= 0 (mod v_~y$r_buff0_thd3~0_26 256))) .cse2)) 0 v_~y$r_buff1_thd3~0_20) v_~y$r_buff1_thd3~0_19) (= v_~y~0_60 (ite .cse3 v_~y$w_buff0~0_40 (ite .cse4 v_~y$w_buff1~0_37 v_~y~0_61))) (= (ite (or .cse4 .cse0) 0 v_~y$w_buff1_used~0_89) v_~y$w_buff1_used~0_88) (= v_~y$w_buff0_used~0_99 (ite .cse3 0 v_~y$w_buff0_used~0_100))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_100, ~y$w_buff1~0=v_~y$w_buff1~0_37, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_27, ~y$w_buff0~0=v_~y$w_buff0~0_40, ~y~0=v_~y~0_61, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_89} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_99, ~y$w_buff1~0=v_~y$w_buff1~0_37, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_26, ~y$w_buff0~0=v_~y$w_buff0~0_40, ~y~0=v_~y~0_60, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_88} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][49], [P3Thread1of1ForFork1InUse, P1Thread1of1ForFork0InUse, 88#P0EXITtrue, Black: 203#(= ~__unbuffered_p3_EAX~0 0), Black: 172#true, 211#true, 17#L877true, Black: 208#(= ~__unbuffered_p1_EAX~0 0), 15#L819true, 181#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 39#P1EXITtrue, 165#true, Black: 180#(= ~z~0 0), Black: 178#true, 206#true, P2Thread1of1ForFork3InUse, 196#(and (not (= |ULTIMATE.start_main_~#t606~0#1.base| |ULTIMATE.start_main_~#t605~0#1.base|)) (not (= |ULTIMATE.start_main_~#t607~0#1.base| |ULTIMATE.start_main_~#t605~0#1.base|)) (not (= |ULTIMATE.start_main_~#t607~0#1.base| |ULTIMATE.start_main_~#t606~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t606~0#1.base| 0) |ULTIMATE.start_main_~#t607~0#1.base| 0) |ULTIMATE.start_main_~#t608~0#1.base| 0) |ULTIMATE.start_main_~#t605~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t608~0#1.base| |ULTIMATE.start_main_~#t607~0#1.base|)) (not (= |ULTIMATE.start_main_~#t608~0#1.base| |ULTIMATE.start_main_~#t606~0#1.base|)) (not (= |ULTIMATE.start_main_~#t608~0#1.base| |ULTIMATE.start_main_~#t605~0#1.base|))), Black: 188#(= ~x~0 0), P0Thread1of1ForFork2InUse, 23#L835true]) [2023-11-19 07:33:48,898 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-11-19 07:33:48,899 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-19 07:33:48,899 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-19 07:33:48,899 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-19 07:33:49,003 INFO L124 PetriNetUnfolderBase]: 7864/11569 cut-off events. [2023-11-19 07:33:49,003 INFO L125 PetriNetUnfolderBase]: For 19008/19674 co-relation queries the response was YES. [2023-11-19 07:33:49,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34078 conditions, 11569 events. 7864/11569 cut-off events. For 19008/19674 co-relation queries the response was YES. Maximal size of possible extension queue 715. Compared 71228 event pairs, 1284 based on Foata normal form. 1102/12142 useless extension candidates. Maximal degree in co-relation 34067. Up to 7047 conditions per place. [2023-11-19 07:33:49,094 INFO L140 encePairwiseOnDemand]: 300/307 looper letters, 110 selfloop transitions, 10 changer transitions 0/131 dead transitions. [2023-11-19 07:33:49,094 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 131 transitions, 981 flow [2023-11-19 07:33:49,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:33:49,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-19 07:33:49,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 723 transitions. [2023-11-19 07:33:49,098 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4710097719869707 [2023-11-19 07:33:49,098 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 723 transitions. [2023-11-19 07:33:49,098 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 723 transitions. [2023-11-19 07:33:49,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:33:49,099 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 723 transitions. [2023-11-19 07:33:49,102 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 144.6) internal successors, (723), 5 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:49,106 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 307.0) internal successors, (1842), 6 states have internal predecessors, (1842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:49,106 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 307.0) internal successors, (1842), 6 states have internal predecessors, (1842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:49,107 INFO L175 Difference]: Start difference. First operand has 52 places, 48 transitions, 286 flow. Second operand 5 states and 723 transitions. [2023-11-19 07:33:49,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 131 transitions, 981 flow [2023-11-19 07:33:49,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 131 transitions, 973 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 07:33:49,136 INFO L231 Difference]: Finished difference. Result has 57 places, 57 transitions, 353 flow [2023-11-19 07:33:49,136 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=353, PETRI_PLACES=57, PETRI_TRANSITIONS=57} [2023-11-19 07:33:49,136 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 5 predicate places. [2023-11-19 07:33:49,137 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 57 transitions, 353 flow [2023-11-19 07:33:49,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 134.25) internal successors, (537), 4 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:49,137 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:33:49,137 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:33:49,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-19 07:33:49,137 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 07:33:49,138 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:33:49,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1640664372, now seen corresponding path program 1 times [2023-11-19 07:33:49,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:33:49,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773191143] [2023-11-19 07:33:49,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:33:49,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:33:49,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:49,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:33:49,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:33:49,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773191143] [2023-11-19 07:33:49,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773191143] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:33:49,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:33:49,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:33:49,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12313532] [2023-11-19 07:33:49,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:33:49,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:33:49,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:33:49,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:33:49,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:33:49,367 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 307 [2023-11-19 07:33:49,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 57 transitions, 353 flow. Second operand has 5 states, 5 states have (on average 134.2) internal successors, (671), 5 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:49,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:33:49,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 307 [2023-11-19 07:33:49,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:33:50,781 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([459] L835-->L842: Formula: (let ((.cse1 (not (= (mod v_~y$w_buff0_used~0_117 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0))) (.cse0 (not (= (mod v_~y$r_buff1_thd4~0_22 256) 0)))) (let ((.cse2 (and (not (= (mod v_~y$w_buff1_used~0_103 256) 0)) .cse0)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_118 256) 0)) .cse5)) (.cse3 (and .cse1 .cse5))) (and (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_102 256) 0)) .cse0) (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse1)) 0 v_~y$r_buff1_thd4~0_22) v_~y$r_buff1_thd4~0_21) (= (ite (or .cse2 .cse3) 0 v_~y$w_buff1_used~0_103) v_~y$w_buff1_used~0_102) (= v_~y~0_72 (ite .cse4 v_~y$w_buff0~0_54 (ite .cse2 v_~y$w_buff1~0_47 v_~y~0_73))) (= v_~y$w_buff0_used~0_117 (ite .cse4 0 v_~y$w_buff0_used~0_118)) (= v_~y$r_buff0_thd4~0_25 (ite .cse3 0 v_~y$r_buff0_thd4~0_26))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_22, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_118, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$w_buff0~0=v_~y$w_buff0~0_54, ~y~0=v_~y~0_73, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_103} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_21, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_117, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$w_buff0~0=v_~y$w_buff0~0_54, ~y~0=v_~y~0_72, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_102} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][158], [72#L812true, P3Thread1of1ForFork1InUse, P1Thread1of1ForFork0InUse, 83#L2true, 88#P0EXITtrue, 6#L842true, Black: 203#(= ~__unbuffered_p3_EAX~0 0), 211#true, Black: 174#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 225#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 208#(= ~__unbuffered_p1_EAX~0 0), 39#P1EXITtrue, Black: 181#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 165#true, Black: 180#(= ~z~0 0), Black: 214#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 213#(= ~__unbuffered_cnt~0 0), Black: 216#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 196#(and (not (= |ULTIMATE.start_main_~#t606~0#1.base| |ULTIMATE.start_main_~#t605~0#1.base|)) (not (= |ULTIMATE.start_main_~#t607~0#1.base| |ULTIMATE.start_main_~#t605~0#1.base|)) (not (= |ULTIMATE.start_main_~#t607~0#1.base| |ULTIMATE.start_main_~#t606~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t606~0#1.base| 0) |ULTIMATE.start_main_~#t607~0#1.base| 0) |ULTIMATE.start_main_~#t608~0#1.base| 0) |ULTIMATE.start_main_~#t605~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t608~0#1.base| |ULTIMATE.start_main_~#t607~0#1.base|)) (not (= |ULTIMATE.start_main_~#t608~0#1.base| |ULTIMATE.start_main_~#t606~0#1.base|)) (not (= |ULTIMATE.start_main_~#t608~0#1.base| |ULTIMATE.start_main_~#t605~0#1.base|))), P2Thread1of1ForFork3InUse, Black: 188#(= ~x~0 0), P0Thread1of1ForFork2InUse, 178#true]) [2023-11-19 07:33:50,782 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-11-19 07:33:50,782 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-19 07:33:50,782 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-19 07:33:50,782 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-19 07:33:50,818 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([459] L835-->L842: Formula: (let ((.cse1 (not (= (mod v_~y$w_buff0_used~0_117 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0))) (.cse0 (not (= (mod v_~y$r_buff1_thd4~0_22 256) 0)))) (let ((.cse2 (and (not (= (mod v_~y$w_buff1_used~0_103 256) 0)) .cse0)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_118 256) 0)) .cse5)) (.cse3 (and .cse1 .cse5))) (and (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_102 256) 0)) .cse0) (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse1)) 0 v_~y$r_buff1_thd4~0_22) v_~y$r_buff1_thd4~0_21) (= (ite (or .cse2 .cse3) 0 v_~y$w_buff1_used~0_103) v_~y$w_buff1_used~0_102) (= v_~y~0_72 (ite .cse4 v_~y$w_buff0~0_54 (ite .cse2 v_~y$w_buff1~0_47 v_~y~0_73))) (= v_~y$w_buff0_used~0_117 (ite .cse4 0 v_~y$w_buff0_used~0_118)) (= v_~y$r_buff0_thd4~0_25 (ite .cse3 0 v_~y$r_buff0_thd4~0_26))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_22, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_118, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$w_buff0~0=v_~y$w_buff0~0_54, ~y~0=v_~y~0_73, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_103} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_21, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_117, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$w_buff0~0=v_~y$w_buff0~0_54, ~y~0=v_~y~0_72, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_102} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][158], [72#L812true, P3Thread1of1ForFork1InUse, P1Thread1of1ForFork0InUse, 83#L2true, 88#P0EXITtrue, 6#L842true, Black: 203#(= ~__unbuffered_p3_EAX~0 0), 214#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 174#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 225#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 208#(= ~__unbuffered_p1_EAX~0 0), 39#P1EXITtrue, Black: 181#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 165#true, Black: 180#(= ~z~0 0), Black: 213#(= ~__unbuffered_cnt~0 0), Black: 216#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 196#(and (not (= |ULTIMATE.start_main_~#t606~0#1.base| |ULTIMATE.start_main_~#t605~0#1.base|)) (not (= |ULTIMATE.start_main_~#t607~0#1.base| |ULTIMATE.start_main_~#t605~0#1.base|)) (not (= |ULTIMATE.start_main_~#t607~0#1.base| |ULTIMATE.start_main_~#t606~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t606~0#1.base| 0) |ULTIMATE.start_main_~#t607~0#1.base| 0) |ULTIMATE.start_main_~#t608~0#1.base| 0) |ULTIMATE.start_main_~#t605~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t608~0#1.base| |ULTIMATE.start_main_~#t607~0#1.base|)) (not (= |ULTIMATE.start_main_~#t608~0#1.base| |ULTIMATE.start_main_~#t606~0#1.base|)) (not (= |ULTIMATE.start_main_~#t608~0#1.base| |ULTIMATE.start_main_~#t605~0#1.base|))), P2Thread1of1ForFork3InUse, Black: 188#(= ~x~0 0), P0Thread1of1ForFork2InUse, 178#true]) [2023-11-19 07:33:50,818 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-11-19 07:33:50,818 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-19 07:33:50,818 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-19 07:33:50,819 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-19 07:33:50,837 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([451] L812-->L819: Formula: (let ((.cse5 (not (= (mod v_~y$r_buff0_thd3~0_27 256) 0))) (.cse2 (not (= (mod v_~y$w_buff0_used~0_99 256) 0))) (.cse1 (not (= (mod v_~y$r_buff1_thd3~0_20 256) 0)))) (let ((.cse4 (and (not (= (mod v_~y$w_buff1_used~0_89 256) 0)) .cse1)) (.cse0 (and .cse5 .cse2)) (.cse3 (and (not (= (mod v_~y$w_buff0_used~0_100 256) 0)) .cse5))) (and (= (ite .cse0 0 v_~y$r_buff0_thd3~0_27) v_~y$r_buff0_thd3~0_26) (= (ite (or (and .cse1 (not (= (mod v_~y$w_buff1_used~0_88 256) 0))) (and (not (= 0 (mod v_~y$r_buff0_thd3~0_26 256))) .cse2)) 0 v_~y$r_buff1_thd3~0_20) v_~y$r_buff1_thd3~0_19) (= v_~y~0_60 (ite .cse3 v_~y$w_buff0~0_40 (ite .cse4 v_~y$w_buff1~0_37 v_~y~0_61))) (= (ite (or .cse4 .cse0) 0 v_~y$w_buff1_used~0_89) v_~y$w_buff1_used~0_88) (= v_~y$w_buff0_used~0_99 (ite .cse3 0 v_~y$w_buff0_used~0_100))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_100, ~y$w_buff1~0=v_~y$w_buff1~0_37, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_27, ~y$w_buff0~0=v_~y$w_buff0~0_40, ~y~0=v_~y~0_61, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_89} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_99, ~y$w_buff1~0=v_~y$w_buff1~0_37, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_26, ~y$w_buff0~0=v_~y$w_buff0~0_40, ~y~0=v_~y~0_60, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_88} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][157], [P3Thread1of1ForFork1InUse, P1Thread1of1ForFork0InUse, 83#L2true, 88#P0EXITtrue, Black: 203#(= ~__unbuffered_p3_EAX~0 0), 211#true, Black: 172#true, 225#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 208#(= ~__unbuffered_p1_EAX~0 0), 15#L819true, 181#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 39#P1EXITtrue, 165#true, Black: 180#(= ~z~0 0), Black: 178#true, Black: 214#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 213#(= ~__unbuffered_cnt~0 0), Black: 216#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P2Thread1of1ForFork3InUse, 196#(and (not (= |ULTIMATE.start_main_~#t606~0#1.base| |ULTIMATE.start_main_~#t605~0#1.base|)) (not (= |ULTIMATE.start_main_~#t607~0#1.base| |ULTIMATE.start_main_~#t605~0#1.base|)) (not (= |ULTIMATE.start_main_~#t607~0#1.base| |ULTIMATE.start_main_~#t606~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t606~0#1.base| 0) |ULTIMATE.start_main_~#t607~0#1.base| 0) |ULTIMATE.start_main_~#t608~0#1.base| 0) |ULTIMATE.start_main_~#t605~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t608~0#1.base| |ULTIMATE.start_main_~#t607~0#1.base|)) (not (= |ULTIMATE.start_main_~#t608~0#1.base| |ULTIMATE.start_main_~#t606~0#1.base|)) (not (= |ULTIMATE.start_main_~#t608~0#1.base| |ULTIMATE.start_main_~#t605~0#1.base|))), Black: 188#(= ~x~0 0), P0Thread1of1ForFork2InUse, 23#L835true]) [2023-11-19 07:33:50,837 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-11-19 07:33:50,838 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-19 07:33:50,838 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-19 07:33:50,838 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-19 07:33:50,846 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([451] L812-->L819: Formula: (let ((.cse5 (not (= (mod v_~y$r_buff0_thd3~0_27 256) 0))) (.cse2 (not (= (mod v_~y$w_buff0_used~0_99 256) 0))) (.cse1 (not (= (mod v_~y$r_buff1_thd3~0_20 256) 0)))) (let ((.cse4 (and (not (= (mod v_~y$w_buff1_used~0_89 256) 0)) .cse1)) (.cse0 (and .cse5 .cse2)) (.cse3 (and (not (= (mod v_~y$w_buff0_used~0_100 256) 0)) .cse5))) (and (= (ite .cse0 0 v_~y$r_buff0_thd3~0_27) v_~y$r_buff0_thd3~0_26) (= (ite (or (and .cse1 (not (= (mod v_~y$w_buff1_used~0_88 256) 0))) (and (not (= 0 (mod v_~y$r_buff0_thd3~0_26 256))) .cse2)) 0 v_~y$r_buff1_thd3~0_20) v_~y$r_buff1_thd3~0_19) (= v_~y~0_60 (ite .cse3 v_~y$w_buff0~0_40 (ite .cse4 v_~y$w_buff1~0_37 v_~y~0_61))) (= (ite (or .cse4 .cse0) 0 v_~y$w_buff1_used~0_89) v_~y$w_buff1_used~0_88) (= v_~y$w_buff0_used~0_99 (ite .cse3 0 v_~y$w_buff0_used~0_100))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_100, ~y$w_buff1~0=v_~y$w_buff1~0_37, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_27, ~y$w_buff0~0=v_~y$w_buff0~0_40, ~y~0=v_~y~0_61, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_89} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_99, ~y$w_buff1~0=v_~y$w_buff1~0_37, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_26, ~y$w_buff0~0=v_~y$w_buff0~0_40, ~y~0=v_~y~0_60, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_88} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][157], [P3Thread1of1ForFork1InUse, P1Thread1of1ForFork0InUse, 83#L2true, 88#P0EXITtrue, Black: 203#(= ~__unbuffered_p3_EAX~0 0), 214#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 172#true, 225#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 208#(= ~__unbuffered_p1_EAX~0 0), 15#L819true, 181#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 39#P1EXITtrue, 165#true, Black: 180#(= ~z~0 0), Black: 178#true, Black: 213#(= ~__unbuffered_cnt~0 0), Black: 216#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P2Thread1of1ForFork3InUse, 196#(and (not (= |ULTIMATE.start_main_~#t606~0#1.base| |ULTIMATE.start_main_~#t605~0#1.base|)) (not (= |ULTIMATE.start_main_~#t607~0#1.base| |ULTIMATE.start_main_~#t605~0#1.base|)) (not (= |ULTIMATE.start_main_~#t607~0#1.base| |ULTIMATE.start_main_~#t606~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t606~0#1.base| 0) |ULTIMATE.start_main_~#t607~0#1.base| 0) |ULTIMATE.start_main_~#t608~0#1.base| 0) |ULTIMATE.start_main_~#t605~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t608~0#1.base| |ULTIMATE.start_main_~#t607~0#1.base|)) (not (= |ULTIMATE.start_main_~#t608~0#1.base| |ULTIMATE.start_main_~#t606~0#1.base|)) (not (= |ULTIMATE.start_main_~#t608~0#1.base| |ULTIMATE.start_main_~#t605~0#1.base|))), Black: 188#(= ~x~0 0), P0Thread1of1ForFork2InUse, 23#L835true]) [2023-11-19 07:33:50,846 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-11-19 07:33:50,846 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-19 07:33:50,846 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-19 07:33:50,846 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-19 07:33:51,019 INFO L124 PetriNetUnfolderBase]: 6456/9782 cut-off events. [2023-11-19 07:33:51,020 INFO L125 PetriNetUnfolderBase]: For 18855/19336 co-relation queries the response was YES. [2023-11-19 07:33:51,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34989 conditions, 9782 events. 6456/9782 cut-off events. For 18855/19336 co-relation queries the response was YES. Maximal size of possible extension queue 591. Compared 61439 event pairs, 588 based on Foata normal form. 777/10192 useless extension candidates. Maximal degree in co-relation 34975. Up to 2936 conditions per place. [2023-11-19 07:33:51,110 INFO L140 encePairwiseOnDemand]: 300/307 looper letters, 148 selfloop transitions, 19 changer transitions 2/180 dead transitions. [2023-11-19 07:33:51,110 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 180 transitions, 1437 flow [2023-11-19 07:33:51,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:33:51,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-19 07:33:51,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1014 transitions. [2023-11-19 07:33:51,115 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4718473708701722 [2023-11-19 07:33:51,116 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1014 transitions. [2023-11-19 07:33:51,116 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1014 transitions. [2023-11-19 07:33:51,117 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:33:51,118 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1014 transitions. [2023-11-19 07:33:51,122 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 144.85714285714286) internal successors, (1014), 7 states have internal predecessors, (1014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:51,128 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 307.0) internal successors, (2456), 8 states have internal predecessors, (2456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:51,129 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 307.0) internal successors, (2456), 8 states have internal predecessors, (2456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:51,129 INFO L175 Difference]: Start difference. First operand has 57 places, 57 transitions, 353 flow. Second operand 7 states and 1014 transitions. [2023-11-19 07:33:51,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 180 transitions, 1437 flow [2023-11-19 07:33:51,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 180 transitions, 1432 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-19 07:33:51,190 INFO L231 Difference]: Finished difference. Result has 65 places, 66 transitions, 482 flow [2023-11-19 07:33:51,190 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=482, PETRI_PLACES=65, PETRI_TRANSITIONS=66} [2023-11-19 07:33:51,191 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 13 predicate places. [2023-11-19 07:33:51,191 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 66 transitions, 482 flow [2023-11-19 07:33:51,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 134.2) internal successors, (671), 5 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:51,192 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:33:51,192 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:33:51,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-19 07:33:51,193 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 07:33:51,193 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:33:51,193 INFO L85 PathProgramCache]: Analyzing trace with hash -2127660642, now seen corresponding path program 1 times [2023-11-19 07:33:51,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:33:51,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607852940] [2023-11-19 07:33:51,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:33:51,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:33:51,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:51,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:33:51,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:33:51,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607852940] [2023-11-19 07:33:51,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607852940] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:33:51,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:33:51,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:33:51,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640601706] [2023-11-19 07:33:51,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:33:51,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:33:51,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:33:51,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:33:51,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:33:51,548 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 307 [2023-11-19 07:33:51,549 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 66 transitions, 482 flow. Second operand has 4 states, 4 states have (on average 128.25) internal successors, (513), 4 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:51,549 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:33:51,549 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 307 [2023-11-19 07:33:51,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:33:53,481 INFO L124 PetriNetUnfolderBase]: 9562/13965 cut-off events. [2023-11-19 07:33:53,481 INFO L125 PetriNetUnfolderBase]: For 44840/44840 co-relation queries the response was YES. [2023-11-19 07:33:53,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59948 conditions, 13965 events. 9562/13965 cut-off events. For 44840/44840 co-relation queries the response was YES. Maximal size of possible extension queue 528. Compared 80702 event pairs, 1200 based on Foata normal form. 47/14012 useless extension candidates. Maximal degree in co-relation 59931. Up to 6375 conditions per place. [2023-11-19 07:33:53,577 INFO L140 encePairwiseOnDemand]: 296/307 looper letters, 106 selfloop transitions, 34 changer transitions 38/178 dead transitions. [2023-11-19 07:33:53,577 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 178 transitions, 1640 flow [2023-11-19 07:33:53,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:33:53,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-19 07:33:53,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 706 transitions. [2023-11-19 07:33:53,581 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45993485342019547 [2023-11-19 07:33:53,582 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 706 transitions. [2023-11-19 07:33:53,582 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 706 transitions. [2023-11-19 07:33:53,583 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:33:53,583 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 706 transitions. [2023-11-19 07:33:53,585 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 141.2) internal successors, (706), 5 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:53,589 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 307.0) internal successors, (1842), 6 states have internal predecessors, (1842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:53,590 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 307.0) internal successors, (1842), 6 states have internal predecessors, (1842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:53,590 INFO L175 Difference]: Start difference. First operand has 65 places, 66 transitions, 482 flow. Second operand 5 states and 706 transitions. [2023-11-19 07:33:53,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 178 transitions, 1640 flow [2023-11-19 07:33:54,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 178 transitions, 1468 flow, removed 60 selfloop flow, removed 3 redundant places. [2023-11-19 07:33:54,516 INFO L231 Difference]: Finished difference. Result has 69 places, 75 transitions, 647 flow [2023-11-19 07:33:54,516 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=432, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=647, PETRI_PLACES=69, PETRI_TRANSITIONS=75} [2023-11-19 07:33:54,517 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 17 predicate places. [2023-11-19 07:33:54,517 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 75 transitions, 647 flow [2023-11-19 07:33:54,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 128.25) internal successors, (513), 4 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:54,518 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:33:54,518 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:33:54,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-19 07:33:54,518 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 07:33:54,519 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:33:54,519 INFO L85 PathProgramCache]: Analyzing trace with hash -973583022, now seen corresponding path program 1 times [2023-11-19 07:33:54,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:33:54,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796374443] [2023-11-19 07:33:54,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:33:54,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:33:54,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:54,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:33:54,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:33:54,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796374443] [2023-11-19 07:33:54,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796374443] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:33:54,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:33:54,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:33:54,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189493267] [2023-11-19 07:33:54,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:33:54,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:33:54,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:33:54,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:33:54,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:33:54,826 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 307 [2023-11-19 07:33:54,828 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 75 transitions, 647 flow. Second operand has 6 states, 6 states have (on average 134.0) internal successors, (804), 6 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:54,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:33:54,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 307 [2023-11-19 07:33:54,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:33:55,824 INFO L124 PetriNetUnfolderBase]: 3234/5117 cut-off events. [2023-11-19 07:33:55,825 INFO L125 PetriNetUnfolderBase]: For 19735/20202 co-relation queries the response was YES. [2023-11-19 07:33:55,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21607 conditions, 5117 events. 3234/5117 cut-off events. For 19735/20202 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 29889 event pairs, 420 based on Foata normal form. 331/5329 useless extension candidates. Maximal degree in co-relation 21587. Up to 1705 conditions per place. [2023-11-19 07:33:55,865 INFO L140 encePairwiseOnDemand]: 300/307 looper letters, 149 selfloop transitions, 18 changer transitions 28/214 dead transitions. [2023-11-19 07:33:55,866 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 214 transitions, 2200 flow [2023-11-19 07:33:55,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:33:55,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-19 07:33:55,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1015 transitions. [2023-11-19 07:33:55,871 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4723127035830619 [2023-11-19 07:33:55,871 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1015 transitions. [2023-11-19 07:33:55,871 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1015 transitions. [2023-11-19 07:33:55,872 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:33:55,872 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1015 transitions. [2023-11-19 07:33:55,876 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 145.0) internal successors, (1015), 7 states have internal predecessors, (1015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:55,880 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 307.0) internal successors, (2456), 8 states have internal predecessors, (2456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:55,882 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 307.0) internal successors, (2456), 8 states have internal predecessors, (2456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:55,882 INFO L175 Difference]: Start difference. First operand has 69 places, 75 transitions, 647 flow. Second operand 7 states and 1015 transitions. [2023-11-19 07:33:55,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 214 transitions, 2200 flow [2023-11-19 07:33:55,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 214 transitions, 2162 flow, removed 19 selfloop flow, removed 3 redundant places. [2023-11-19 07:33:55,926 INFO L231 Difference]: Finished difference. Result has 71 places, 84 transitions, 771 flow [2023-11-19 07:33:55,927 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=633, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=771, PETRI_PLACES=71, PETRI_TRANSITIONS=84} [2023-11-19 07:33:55,927 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 19 predicate places. [2023-11-19 07:33:55,928 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 84 transitions, 771 flow [2023-11-19 07:33:55,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 134.0) internal successors, (804), 6 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:55,928 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:33:55,929 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:33:55,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-19 07:33:55,929 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 07:33:55,929 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:33:55,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1951308636, now seen corresponding path program 1 times [2023-11-19 07:33:55,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:33:55,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248262169] [2023-11-19 07:33:55,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:33:55,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:33:55,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:56,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:33:56,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:33:56,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248262169] [2023-11-19 07:33:56,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248262169] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:33:56,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:33:56,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:33:56,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589933494] [2023-11-19 07:33:56,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:33:56,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:33:56,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:33:56,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:33:56,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:33:56,543 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 307 [2023-11-19 07:33:56,544 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 84 transitions, 771 flow. Second operand has 6 states, 6 states have (on average 136.5) internal successors, (819), 6 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:56,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:33:56,545 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 307 [2023-11-19 07:33:56,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:33:57,655 INFO L124 PetriNetUnfolderBase]: 4877/7908 cut-off events. [2023-11-19 07:33:57,655 INFO L125 PetriNetUnfolderBase]: For 34810/35409 co-relation queries the response was YES. [2023-11-19 07:33:57,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37232 conditions, 7908 events. 4877/7908 cut-off events. For 34810/35409 co-relation queries the response was YES. Maximal size of possible extension queue 409. Compared 51506 event pairs, 535 based on Foata normal form. 98/7826 useless extension candidates. Maximal degree in co-relation 37211. Up to 2675 conditions per place. [2023-11-19 07:33:57,728 INFO L140 encePairwiseOnDemand]: 300/307 looper letters, 180 selfloop transitions, 11 changer transitions 40/250 dead transitions. [2023-11-19 07:33:57,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 250 transitions, 2767 flow [2023-11-19 07:33:57,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:33:57,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-19 07:33:57,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 878 transitions. [2023-11-19 07:33:57,732 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4766558089033659 [2023-11-19 07:33:57,732 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 878 transitions. [2023-11-19 07:33:57,733 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 878 transitions. [2023-11-19 07:33:57,734 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:33:57,734 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 878 transitions. [2023-11-19 07:33:57,736 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 146.33333333333334) internal successors, (878), 6 states have internal predecessors, (878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:57,739 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 307.0) internal successors, (2149), 7 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:57,740 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 307.0) internal successors, (2149), 7 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:57,740 INFO L175 Difference]: Start difference. First operand has 71 places, 84 transitions, 771 flow. Second operand 6 states and 878 transitions. [2023-11-19 07:33:57,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 250 transitions, 2767 flow [2023-11-19 07:33:58,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 250 transitions, 2476 flow, removed 118 selfloop flow, removed 2 redundant places. [2023-11-19 07:33:58,075 INFO L231 Difference]: Finished difference. Result has 77 places, 93 transitions, 831 flow [2023-11-19 07:33:58,076 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=706, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=831, PETRI_PLACES=77, PETRI_TRANSITIONS=93} [2023-11-19 07:33:58,076 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 25 predicate places. [2023-11-19 07:33:58,076 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 93 transitions, 831 flow [2023-11-19 07:33:58,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 136.5) internal successors, (819), 6 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:58,077 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:33:58,077 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:33:58,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-19 07:33:58,078 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 07:33:58,078 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:33:58,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1715035945, now seen corresponding path program 1 times [2023-11-19 07:33:58,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:33:58,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962366131] [2023-11-19 07:33:58,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:33:58,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:33:58,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:58,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:33:58,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:33:58,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962366131] [2023-11-19 07:33:58,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962366131] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:33:58,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:33:58,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:33:58,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504500333] [2023-11-19 07:33:58,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:33:58,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:33:58,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:33:58,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:33:58,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:33:58,288 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 307 [2023-11-19 07:33:58,289 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 93 transitions, 831 flow. Second operand has 4 states, 4 states have (on average 139.25) internal successors, (557), 4 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:58,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:33:58,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 307 [2023-11-19 07:33:58,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:33:59,878 INFO L124 PetriNetUnfolderBase]: 6199/10253 cut-off events. [2023-11-19 07:33:59,878 INFO L125 PetriNetUnfolderBase]: For 42564/43341 co-relation queries the response was YES. [2023-11-19 07:33:59,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47264 conditions, 10253 events. 6199/10253 cut-off events. For 42564/43341 co-relation queries the response was YES. Maximal size of possible extension queue 503. Compared 70868 event pairs, 1292 based on Foata normal form. 170/10262 useless extension candidates. Maximal degree in co-relation 47239. Up to 5073 conditions per place. [2023-11-19 07:33:59,961 INFO L140 encePairwiseOnDemand]: 304/307 looper letters, 99 selfloop transitions, 3 changer transitions 50/165 dead transitions. [2023-11-19 07:33:59,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 165 transitions, 1639 flow [2023-11-19 07:33:59,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:33:59,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 07:33:59,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 592 transitions. [2023-11-19 07:33:59,964 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4820846905537459 [2023-11-19 07:33:59,965 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 592 transitions. [2023-11-19 07:33:59,965 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 592 transitions. [2023-11-19 07:33:59,965 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:33:59,965 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 592 transitions. [2023-11-19 07:33:59,967 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 148.0) internal successors, (592), 4 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:59,968 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 307.0) internal successors, (1535), 5 states have internal predecessors, (1535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:59,969 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 307.0) internal successors, (1535), 5 states have internal predecessors, (1535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:59,970 INFO L175 Difference]: Start difference. First operand has 77 places, 93 transitions, 831 flow. Second operand 4 states and 592 transitions. [2023-11-19 07:33:59,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 165 transitions, 1639 flow [2023-11-19 07:34:00,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 165 transitions, 1617 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-11-19 07:34:00,400 INFO L231 Difference]: Finished difference. Result has 79 places, 84 transitions, 733 flow [2023-11-19 07:34:00,400 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=819, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=733, PETRI_PLACES=79, PETRI_TRANSITIONS=84} [2023-11-19 07:34:00,401 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 27 predicate places. [2023-11-19 07:34:00,401 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 84 transitions, 733 flow [2023-11-19 07:34:00,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 139.25) internal successors, (557), 4 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:34:00,402 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:34:00,402 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:34:00,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-19 07:34:00,402 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 07:34:00,402 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:34:00,403 INFO L85 PathProgramCache]: Analyzing trace with hash -416062538, now seen corresponding path program 2 times [2023-11-19 07:34:00,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:34:00,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590386310] [2023-11-19 07:34:00,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:34:00,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:34:00,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:00,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:34:00,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:34:00,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590386310] [2023-11-19 07:34:00,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590386310] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:34:00,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:34:00,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:34:00,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041087798] [2023-11-19 07:34:00,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:34:00,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:34:00,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:34:00,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:34:00,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:34:00,653 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 307 [2023-11-19 07:34:00,654 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 84 transitions, 733 flow. Second operand has 4 states, 4 states have (on average 138.75) internal successors, (555), 4 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:34:00,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:34:00,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 307 [2023-11-19 07:34:00,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:34:02,516 INFO L124 PetriNetUnfolderBase]: 7787/13471 cut-off events. [2023-11-19 07:34:02,516 INFO L125 PetriNetUnfolderBase]: For 53914/54575 co-relation queries the response was YES. [2023-11-19 07:34:02,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61590 conditions, 13471 events. 7787/13471 cut-off events. For 53914/54575 co-relation queries the response was YES. Maximal size of possible extension queue 702. Compared 103058 event pairs, 2202 based on Foata normal form. 261/13628 useless extension candidates. Maximal degree in co-relation 61564. Up to 5138 conditions per place. [2023-11-19 07:34:02,628 INFO L140 encePairwiseOnDemand]: 303/307 looper letters, 86 selfloop transitions, 7 changer transitions 67/166 dead transitions. [2023-11-19 07:34:02,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 166 transitions, 1684 flow [2023-11-19 07:34:02,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:34:02,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 07:34:02,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 587 transitions. [2023-11-19 07:34:02,632 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4780130293159609 [2023-11-19 07:34:02,632 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 587 transitions. [2023-11-19 07:34:02,632 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 587 transitions. [2023-11-19 07:34:02,633 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:34:02,633 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 587 transitions. [2023-11-19 07:34:02,635 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 146.75) internal successors, (587), 4 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:34:02,637 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 307.0) internal successors, (1535), 5 states have internal predecessors, (1535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:34:02,638 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 307.0) internal successors, (1535), 5 states have internal predecessors, (1535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:34:02,638 INFO L175 Difference]: Start difference. First operand has 79 places, 84 transitions, 733 flow. Second operand 4 states and 587 transitions. [2023-11-19 07:34:02,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 166 transitions, 1684 flow [2023-11-19 07:34:03,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 166 transitions, 1656 flow, removed 1 selfloop flow, removed 4 redundant places. [2023-11-19 07:34:03,506 INFO L231 Difference]: Finished difference. Result has 80 places, 75 transitions, 660 flow [2023-11-19 07:34:03,506 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=712, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=660, PETRI_PLACES=80, PETRI_TRANSITIONS=75} [2023-11-19 07:34:03,507 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 28 predicate places. [2023-11-19 07:34:03,507 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 75 transitions, 660 flow [2023-11-19 07:34:03,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 138.75) internal successors, (555), 4 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:34:03,507 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:34:03,507 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:34:03,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-19 07:34:03,508 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 07:34:03,508 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:34:03,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1524191727, now seen corresponding path program 2 times [2023-11-19 07:34:03,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:34:03,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136492291] [2023-11-19 07:34:03,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:34:03,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:34:03,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:03,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:34:03,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:34:03,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136492291] [2023-11-19 07:34:03,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136492291] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:34:03,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:34:03,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:34:03,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785084378] [2023-11-19 07:34:03,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:34:03,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:34:03,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:34:03,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:34:03,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:34:03,821 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 307 [2023-11-19 07:34:03,822 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 75 transitions, 660 flow. Second operand has 4 states, 4 states have (on average 130.75) internal successors, (523), 4 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:34:03,823 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:34:03,823 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 307 [2023-11-19 07:34:03,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand