./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability 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_442f955e-8d82-4eee-a6d4-bc4313644aae/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_442f955e-8d82-4eee-a6d4-bc4313644aae/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_442f955e-8d82-4eee-a6d4-bc4313644aae/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_442f955e-8d82-4eee-a6d4-bc4313644aae/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_442f955e-8d82-4eee-a6d4-bc4313644aae/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_442f955e-8d82-4eee-a6d4-bc4313644aae/bin/uautomizer-verify-uCwYo4JHxu --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0b278c8af08551c2e27294e2c5dca8c5bd0f6f00874366f88466c32210c557af --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:42:26,949 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:42:27,052 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_442f955e-8d82-4eee-a6d4-bc4313644aae/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-19 07:42:27,062 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:42:27,063 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:42:27,105 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:42:27,107 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:42:27,107 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:42:27,109 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:42:27,114 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:42:27,115 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:42:27,115 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:42:27,116 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:42:27,118 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:42:27,118 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 07:42:27,119 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:42:27,119 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:42:27,120 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:42:27,120 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:42:27,120 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 07:42:27,121 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:42:27,122 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 07:42:27,122 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:42:27,122 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 07:42:27,123 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:42:27,124 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:42:27,124 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:42:27,125 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:42:27,125 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:42:27,126 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:42:27,127 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:42:27,128 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 07:42:27,128 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 07:42:27,128 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 07:42:27,128 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:42:27,129 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 07:42:27,129 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:42:27,129 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:42:27,130 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:42:27,130 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_442f955e-8d82-4eee-a6d4-bc4313644aae/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_442f955e-8d82-4eee-a6d4-bc4313644aae/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 ! call(reach_error())) ) 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 -> 0b278c8af08551c2e27294e2c5dca8c5bd0f6f00874366f88466c32210c557af [2023-11-19 07:42:27,421 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:42:27,456 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:42:27,458 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:42:27,460 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:42:27,461 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:42:27,462 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_442f955e-8d82-4eee-a6d4-bc4313644aae/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.i [2023-11-19 07:42:30,519 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:42:30,941 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:42:30,942 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_442f955e-8d82-4eee-a6d4-bc4313644aae/sv-benchmarks/c/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.i [2023-11-19 07:42:30,968 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_442f955e-8d82-4eee-a6d4-bc4313644aae/bin/uautomizer-verify-uCwYo4JHxu/data/094e7f66e/f65db89b5cbd4431b60ccaf7399a1700/FLAG21843c56e [2023-11-19 07:42:30,988 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_442f955e-8d82-4eee-a6d4-bc4313644aae/bin/uautomizer-verify-uCwYo4JHxu/data/094e7f66e/f65db89b5cbd4431b60ccaf7399a1700 [2023-11-19 07:42:30,997 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:42:31,001 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:42:31,007 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:42:31,007 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:42:31,014 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:42:31,015 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:42:30" (1/1) ... [2023-11-19 07:42:31,016 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@245414da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:42:31, skipping insertion in model container [2023-11-19 07:42:31,016 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:42:30" (1/1) ... [2023-11-19 07:42:31,101 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:42:31,287 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_442f955e-8d82-4eee-a6d4-bc4313644aae/sv-benchmarks/c/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.i[966,979] [2023-11-19 07:42:31,615 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:42:31,630 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:42:31,645 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_442f955e-8d82-4eee-a6d4-bc4313644aae/sv-benchmarks/c/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.i[966,979] [2023-11-19 07:42:31,692 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:42:31,732 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 07:42:31,732 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 07:42:31,740 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:42:31,741 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:42:31 WrapperNode [2023-11-19 07:42:31,741 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:42:31,743 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:42:31,743 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:42:31,743 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:42:31,752 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:42:31" (1/1) ... [2023-11-19 07:42:31,790 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:42:31" (1/1) ... [2023-11-19 07:42:31,841 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 160 [2023-11-19 07:42:31,850 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:42:31,851 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:42:31,851 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:42:31,851 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:42:31,861 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:42:31" (1/1) ... [2023-11-19 07:42:31,862 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:42:31" (1/1) ... [2023-11-19 07:42:31,877 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:42:31" (1/1) ... [2023-11-19 07:42:31,881 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:42:31" (1/1) ... [2023-11-19 07:42:31,891 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:42:31" (1/1) ... [2023-11-19 07:42:31,908 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:42:31" (1/1) ... [2023-11-19 07:42:31,910 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:42:31" (1/1) ... [2023-11-19 07:42:31,921 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:42:31" (1/1) ... [2023-11-19 07:42:31,925 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:42:31,926 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:42:31,926 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:42:31,933 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:42:31,934 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:42:31" (1/1) ... [2023-11-19 07:42:31,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:42:31,954 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_442f955e-8d82-4eee-a6d4-bc4313644aae/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:42:31,967 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_442f955e-8d82-4eee-a6d4-bc4313644aae/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:42:32,005 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_442f955e-8d82-4eee-a6d4-bc4313644aae/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:42:32,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 07:42:32,015 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-19 07:42:32,015 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:42:32,015 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 07:42:32,016 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 07:42:32,016 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-19 07:42:32,016 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-19 07:42:32,016 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-19 07:42:32,016 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-19 07:42:32,017 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-19 07:42:32,018 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-19 07:42:32,019 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-19 07:42:32,019 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-19 07:42:32,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 07:42:32,019 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-19 07:42:32,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:42:32,020 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:42:32,021 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:42:32,230 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:42:32,233 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:42:32,598 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:42:32,830 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:42:32,831 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-19 07:42:32,835 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:42:32 BoogieIcfgContainer [2023-11-19 07:42:32,835 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:42:32,837 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:42:32,837 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:42:32,840 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:42:32,840 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:42:30" (1/3) ... [2023-11-19 07:42:32,841 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31253edb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:42:32, skipping insertion in model container [2023-11-19 07:42:32,841 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:42:31" (2/3) ... [2023-11-19 07:42:32,842 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31253edb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:42:32, skipping insertion in model container [2023-11-19 07:42:32,842 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:42:32" (3/3) ... [2023-11-19 07:42:32,846 INFO L112 eAbstractionObserver]: Analyzing ICFG mix029_power.opt_pso.opt_rmo.opt.i [2023-11-19 07:42:32,855 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-19 07:42:32,866 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:42:32,867 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-19 07:42:32,867 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-19 07:42:32,943 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-19 07:42:32,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 133 transitions, 282 flow [2023-11-19 07:42:33,095 INFO L124 PetriNetUnfolderBase]: 2/129 cut-off events. [2023-11-19 07:42:33,096 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:42:33,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 129 events. 2/129 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 74 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 92. Up to 2 conditions per place. [2023-11-19 07:42:33,102 INFO L82 GeneralOperation]: Start removeDead. Operand has 144 places, 133 transitions, 282 flow [2023-11-19 07:42:33,113 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 140 places, 129 transitions, 270 flow [2023-11-19 07:42:33,116 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-19 07:42:33,132 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 140 places, 129 transitions, 270 flow [2023-11-19 07:42:33,134 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 140 places, 129 transitions, 270 flow [2023-11-19 07:42:33,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 129 transitions, 270 flow [2023-11-19 07:42:33,169 INFO L124 PetriNetUnfolderBase]: 2/129 cut-off events. [2023-11-19 07:42:33,169 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:42:33,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 129 events. 2/129 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 74 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 92. Up to 2 conditions per place. [2023-11-19 07:42:33,174 INFO L119 LiptonReduction]: Number of co-enabled transitions 3376 [2023-11-19 07:42:38,248 INFO L134 LiptonReduction]: Checked pairs total: 8788 [2023-11-19 07:42:38,248 INFO L136 LiptonReduction]: Total number of compositions: 111 [2023-11-19 07:42:38,275 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:42:38,286 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@1a7e7feb, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:42:38,287 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-11-19 07:42:38,303 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-19 07:42:38,303 INFO L124 PetriNetUnfolderBase]: 0/12 cut-off events. [2023-11-19 07:42:38,304 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:42:38,304 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:42:38,305 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:42:38,305 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-19 07:42:38,311 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:42:38,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1733348035, now seen corresponding path program 1 times [2023-11-19 07:42:38,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:42:38,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955136455] [2023-11-19 07:42:38,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:42:38,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:42:38,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:38,951 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:42:38,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:42:38,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955136455] [2023-11-19 07:42:38,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955136455] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:42:38,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:42:38,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 07:42:38,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612633116] [2023-11-19 07:42:38,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:42:38,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:42:38,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:42:38,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:42:39,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:42:39,007 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 244 [2023-11-19 07:42:39,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 0 states 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:42:39,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:42:39,011 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 244 [2023-11-19 07:42:39,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:42:40,459 INFO L124 PetriNetUnfolderBase]: 5463/7779 cut-off events. [2023-11-19 07:42:40,459 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2023-11-19 07:42:40,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15379 conditions, 7779 events. 5463/7779 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 391. Compared 41715 event pairs, 1495 based on Foata normal form. 256/7471 useless extension candidates. Maximal degree in co-relation 15367. Up to 5857 conditions per place. [2023-11-19 07:42:40,522 INFO L140 encePairwiseOnDemand]: 240/244 looper letters, 37 selfloop transitions, 2 changer transitions 4/47 dead transitions. [2023-11-19 07:42:40,522 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 47 transitions, 195 flow [2023-11-19 07:42:40,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:42:40,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:42:40,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 400 transitions. [2023-11-19 07:42:40,547 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.546448087431694 [2023-11-19 07:42:40,548 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 400 transitions. [2023-11-19 07:42:40,548 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 400 transitions. [2023-11-19 07:42:40,553 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:42:40,556 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 400 transitions. [2023-11-19 07:42:40,561 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 0 states have call successors, (0), 0 states 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:42:40,569 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 244.0) internal successors, (976), 4 states have internal predecessors, (976), 0 states have call successors, (0), 0 states 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:42:40,570 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 244.0) internal successors, (976), 4 states have internal predecessors, (976), 0 states have call successors, (0), 0 states 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:42:40,572 INFO L175 Difference]: Start difference. First operand has 44 places, 32 transitions, 76 flow. Second operand 3 states and 400 transitions. [2023-11-19 07:42:40,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 47 transitions, 195 flow [2023-11-19 07:42:40,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 47 transitions, 190 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-19 07:42:40,582 INFO L231 Difference]: Finished difference. Result has 41 places, 28 transitions, 68 flow [2023-11-19 07:42:40,584 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, 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=68, PETRI_PLACES=41, PETRI_TRANSITIONS=28} [2023-11-19 07:42:40,588 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -3 predicate places. [2023-11-19 07:42:40,589 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 28 transitions, 68 flow [2023-11-19 07:42:40,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 0 states 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:42:40,590 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:42:40,590 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:42:40,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 07:42:40,591 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-19 07:42:40,591 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:42:40,591 INFO L85 PathProgramCache]: Analyzing trace with hash 132579770, now seen corresponding path program 1 times [2023-11-19 07:42:40,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:42:40,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057520788] [2023-11-19 07:42:40,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:42:40,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:42:40,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:42,446 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:42:42,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:42:42,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057520788] [2023-11-19 07:42:42,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057520788] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:42:42,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:42:42,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:42:42,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682137294] [2023-11-19 07:42:42,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:42:42,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:42:42,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:42:42,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:42:42,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:42:42,564 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 244 [2023-11-19 07:42:42,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 28 transitions, 68 flow. Second operand has 5 states, 5 states have (on average 106.4) internal successors, (532), 5 states have internal predecessors, (532), 0 states have call successors, (0), 0 states 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:42:42,567 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:42:42,567 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 244 [2023-11-19 07:42:42,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:42:44,819 INFO L124 PetriNetUnfolderBase]: 9939/13515 cut-off events. [2023-11-19 07:42:44,821 INFO L125 PetriNetUnfolderBase]: For 564/564 co-relation queries the response was YES. [2023-11-19 07:42:44,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27833 conditions, 13515 events. 9939/13515 cut-off events. For 564/564 co-relation queries the response was YES. Maximal size of possible extension queue 531. Compared 67484 event pairs, 1559 based on Foata normal form. 572/14083 useless extension candidates. Maximal degree in co-relation 27823. Up to 9785 conditions per place. [2023-11-19 07:42:44,929 INFO L140 encePairwiseOnDemand]: 232/244 looper letters, 45 selfloop transitions, 12 changer transitions 38/96 dead transitions. [2023-11-19 07:42:44,929 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 96 transitions, 404 flow [2023-11-19 07:42:44,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:42:44,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-19 07:42:44,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 826 transitions. [2023-11-19 07:42:44,933 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48360655737704916 [2023-11-19 07:42:44,934 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 826 transitions. [2023-11-19 07:42:44,935 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 826 transitions. [2023-11-19 07:42:44,938 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:42:44,938 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 826 transitions. [2023-11-19 07:42:44,942 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 118.0) internal successors, (826), 7 states have internal predecessors, (826), 0 states have call successors, (0), 0 states 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:42:44,947 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 244.0) internal successors, (1952), 8 states have internal predecessors, (1952), 0 states have call successors, (0), 0 states 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:42:44,949 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 244.0) internal successors, (1952), 8 states have internal predecessors, (1952), 0 states have call successors, (0), 0 states 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:42:44,949 INFO L175 Difference]: Start difference. First operand has 41 places, 28 transitions, 68 flow. Second operand 7 states and 826 transitions. [2023-11-19 07:42:44,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 96 transitions, 404 flow [2023-11-19 07:42:44,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 96 transitions, 394 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 07:42:44,958 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 159 flow [2023-11-19 07:42:44,963 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=159, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2023-11-19 07:42:44,964 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 4 predicate places. [2023-11-19 07:42:44,965 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 159 flow [2023-11-19 07:42:44,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 106.4) internal successors, (532), 5 states have internal predecessors, (532), 0 states have call successors, (0), 0 states 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:42:44,966 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:42:44,966 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:42:44,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 07:42:44,966 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-19 07:42:44,967 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:42:44,967 INFO L85 PathProgramCache]: Analyzing trace with hash -185027458, now seen corresponding path program 1 times [2023-11-19 07:42:44,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:42:44,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037035634] [2023-11-19 07:42:44,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:42:44,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:42:45,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:46,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:42:46,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:42:46,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037035634] [2023-11-19 07:42:46,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037035634] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:42:46,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:42:46,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:42:46,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357178401] [2023-11-19 07:42:46,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:42:46,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:42:46,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:42:46,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:42:46,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:42:46,375 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 244 [2023-11-19 07:42:46,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 159 flow. Second operand has 5 states, 5 states have (on average 106.6) internal successors, (533), 5 states have internal predecessors, (533), 0 states have call successors, (0), 0 states 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:42:46,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:42:46,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 244 [2023-11-19 07:42:46,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:42:48,600 INFO L124 PetriNetUnfolderBase]: 8903/12147 cut-off events. [2023-11-19 07:42:48,600 INFO L125 PetriNetUnfolderBase]: For 8393/8393 co-relation queries the response was YES. [2023-11-19 07:42:48,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36726 conditions, 12147 events. 8903/12147 cut-off events. For 8393/8393 co-relation queries the response was YES. Maximal size of possible extension queue 462. Compared 59999 event pairs, 2091 based on Foata normal form. 528/12671 useless extension candidates. Maximal degree in co-relation 36711. Up to 6833 conditions per place. [2023-11-19 07:42:48,714 INFO L140 encePairwiseOnDemand]: 233/244 looper letters, 50 selfloop transitions, 10 changer transitions 40/101 dead transitions. [2023-11-19 07:42:48,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 101 transitions, 595 flow [2023-11-19 07:42:48,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:42:48,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-19 07:42:48,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 819 transitions. [2023-11-19 07:42:48,720 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47950819672131145 [2023-11-19 07:42:48,720 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 819 transitions. [2023-11-19 07:42:48,720 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 819 transitions. [2023-11-19 07:42:48,721 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:42:48,721 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 819 transitions. [2023-11-19 07:42:48,725 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 117.0) internal successors, (819), 7 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:42:48,730 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 244.0) internal successors, (1952), 8 states have internal predecessors, (1952), 0 states have call successors, (0), 0 states 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:42:48,732 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 244.0) internal successors, (1952), 8 states have internal predecessors, (1952), 0 states have call successors, (0), 0 states 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:42:48,732 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 159 flow. Second operand 7 states and 819 transitions. [2023-11-19 07:42:48,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 101 transitions, 595 flow [2023-11-19 07:42:49,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 101 transitions, 587 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-11-19 07:42:49,025 INFO L231 Difference]: Finished difference. Result has 55 places, 43 transitions, 246 flow [2023-11-19 07:42:49,025 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=246, PETRI_PLACES=55, PETRI_TRANSITIONS=43} [2023-11-19 07:42:49,026 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 11 predicate places. [2023-11-19 07:42:49,026 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 43 transitions, 246 flow [2023-11-19 07:42:49,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 106.6) internal successors, (533), 5 states have internal predecessors, (533), 0 states have call successors, (0), 0 states 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:42:49,027 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:42:49,028 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:42:49,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 07:42:49,028 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-19 07:42:49,029 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:42:49,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1458833818, now seen corresponding path program 1 times [2023-11-19 07:42:49,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:42:49,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906483324] [2023-11-19 07:42:49,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:42:49,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:42:49,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:49,713 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:42:49,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:42:49,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906483324] [2023-11-19 07:42:49,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906483324] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:42:49,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:42:49,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:42:49,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909082392] [2023-11-19 07:42:49,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:42:49,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:42:49,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:42:49,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:42:49,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:42:49,764 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 244 [2023-11-19 07:42:49,765 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 43 transitions, 246 flow. Second operand has 5 states, 5 states have (on average 117.6) internal successors, (588), 5 states have internal predecessors, (588), 0 states have call successors, (0), 0 states 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:42:49,766 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:42:49,766 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 244 [2023-11-19 07:42:49,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:42:51,162 INFO L124 PetriNetUnfolderBase]: 6585/9401 cut-off events. [2023-11-19 07:42:51,162 INFO L125 PetriNetUnfolderBase]: For 15880/16280 co-relation queries the response was YES. [2023-11-19 07:42:51,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32432 conditions, 9401 events. 6585/9401 cut-off events. For 15880/16280 co-relation queries the response was YES. Maximal size of possible extension queue 432. Compared 50799 event pairs, 1267 based on Foata normal form. 700/10075 useless extension candidates. Maximal degree in co-relation 32411. Up to 6455 conditions per place. [2023-11-19 07:42:51,244 INFO L140 encePairwiseOnDemand]: 240/244 looper letters, 46 selfloop transitions, 2 changer transitions 24/80 dead transitions. [2023-11-19 07:42:51,244 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 80 transitions, 545 flow [2023-11-19 07:42:51,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:42:51,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-19 07:42:51,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 634 transitions. [2023-11-19 07:42:51,248 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.519672131147541 [2023-11-19 07:42:51,248 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 634 transitions. [2023-11-19 07:42:51,248 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 634 transitions. [2023-11-19 07:42:51,249 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:42:51,249 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 634 transitions. [2023-11-19 07:42:51,251 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 126.8) internal successors, (634), 5 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:42:51,254 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 244.0) internal successors, (1464), 6 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states 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:42:51,255 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 244.0) internal successors, (1464), 6 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states 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:42:51,256 INFO L175 Difference]: Start difference. First operand has 55 places, 43 transitions, 246 flow. Second operand 5 states and 634 transitions. [2023-11-19 07:42:51,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 80 transitions, 545 flow [2023-11-19 07:42:51,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 80 transitions, 528 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-11-19 07:42:51,549 INFO L231 Difference]: Finished difference. Result has 56 places, 43 transitions, 244 flow [2023-11-19 07:42:51,550 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=244, PETRI_PLACES=56, PETRI_TRANSITIONS=43} [2023-11-19 07:42:51,552 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 12 predicate places. [2023-11-19 07:42:51,552 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 43 transitions, 244 flow [2023-11-19 07:42:51,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.6) internal successors, (588), 5 states have internal predecessors, (588), 0 states have call successors, (0), 0 states 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:42:51,553 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:42:51,553 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:42:51,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 07:42:51,553 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-19 07:42:51,554 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:42:51,554 INFO L85 PathProgramCache]: Analyzing trace with hash 2020775203, now seen corresponding path program 1 times [2023-11-19 07:42:51,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:42:51,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086671377] [2023-11-19 07:42:51,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:42:51,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:42:51,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:52,337 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:42:52,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:42:52,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086671377] [2023-11-19 07:42:52,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086671377] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:42:52,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:42:52,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:42:52,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269504539] [2023-11-19 07:42:52,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:42:52,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:42:52,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:42:52,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:42:52,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:42:52,393 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 244 [2023-11-19 07:42:52,394 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 43 transitions, 244 flow. Second operand has 6 states, 6 states have (on average 117.33333333333333) internal successors, (704), 6 states have internal predecessors, (704), 0 states have call successors, (0), 0 states 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:42:52,394 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:42:52,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 244 [2023-11-19 07:42:52,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:42:54,386 INFO L124 PetriNetUnfolderBase]: 7907/11323 cut-off events. [2023-11-19 07:42:54,386 INFO L125 PetriNetUnfolderBase]: For 16151/16640 co-relation queries the response was YES. [2023-11-19 07:42:54,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40200 conditions, 11323 events. 7907/11323 cut-off events. For 16151/16640 co-relation queries the response was YES. Maximal size of possible extension queue 535. Compared 63471 event pairs, 1343 based on Foata normal form. 785/11966 useless extension candidates. Maximal degree in co-relation 40177. Up to 6715 conditions per place. [2023-11-19 07:42:54,466 INFO L140 encePairwiseOnDemand]: 236/244 looper letters, 60 selfloop transitions, 13 changer transitions 28/109 dead transitions. [2023-11-19 07:42:54,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 109 transitions, 778 flow [2023-11-19 07:42:54,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:42:54,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-19 07:42:54,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 763 transitions. [2023-11-19 07:42:54,471 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5211748633879781 [2023-11-19 07:42:54,471 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 763 transitions. [2023-11-19 07:42:54,471 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 763 transitions. [2023-11-19 07:42:54,472 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:42:54,472 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 763 transitions. [2023-11-19 07:42:54,474 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 127.16666666666667) internal successors, (763), 6 states have internal predecessors, (763), 0 states have call successors, (0), 0 states 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:42:54,477 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 244.0) internal successors, (1708), 7 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states 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:42:54,478 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 244.0) internal successors, (1708), 7 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states 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:42:54,478 INFO L175 Difference]: Start difference. First operand has 56 places, 43 transitions, 244 flow. Second operand 6 states and 763 transitions. [2023-11-19 07:42:54,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 109 transitions, 778 flow [2023-11-19 07:42:54,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 109 transitions, 756 flow, removed 9 selfloop flow, removed 6 redundant places. [2023-11-19 07:42:54,959 INFO L231 Difference]: Finished difference. Result has 56 places, 54 transitions, 385 flow [2023-11-19 07:42:54,959 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=385, PETRI_PLACES=56, PETRI_TRANSITIONS=54} [2023-11-19 07:42:54,960 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 12 predicate places. [2023-11-19 07:42:54,960 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 54 transitions, 385 flow [2023-11-19 07:42:54,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 117.33333333333333) internal successors, (704), 6 states have internal predecessors, (704), 0 states have call successors, (0), 0 states 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:42:54,961 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:42:54,961 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:42:54,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 07:42:54,961 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-19 07:42:54,962 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:42:54,962 INFO L85 PathProgramCache]: Analyzing trace with hash 2019852643, now seen corresponding path program 2 times [2023-11-19 07:42:54,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:42:54,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974094083] [2023-11-19 07:42:54,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:42:54,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:42:54,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:55,636 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:42:55,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:42:55,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974094083] [2023-11-19 07:42:55,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974094083] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:42:55,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:42:55,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:42:55,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444649157] [2023-11-19 07:42:55,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:42:55,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:42:55,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:42:55,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:42:55,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:42:55,671 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 244 [2023-11-19 07:42:55,672 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 54 transitions, 385 flow. Second operand has 6 states, 6 states have (on average 115.33333333333333) internal successors, (692), 6 states have internal predecessors, (692), 0 states have call successors, (0), 0 states 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:42:55,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:42:55,673 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 244 [2023-11-19 07:42:55,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:42:57,313 INFO L124 PetriNetUnfolderBase]: 9246/13168 cut-off events. [2023-11-19 07:42:57,313 INFO L125 PetriNetUnfolderBase]: For 31096/32416 co-relation queries the response was YES. [2023-11-19 07:42:57,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53429 conditions, 13168 events. 9246/13168 cut-off events. For 31096/32416 co-relation queries the response was YES. Maximal size of possible extension queue 546. Compared 72522 event pairs, 2136 based on Foata normal form. 1156/14038 useless extension candidates. Maximal degree in co-relation 53407. Up to 9770 conditions per place. [2023-11-19 07:42:57,410 INFO L140 encePairwiseOnDemand]: 237/244 looper letters, 72 selfloop transitions, 15 changer transitions 26/120 dead transitions. [2023-11-19 07:42:57,410 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 120 transitions, 1029 flow [2023-11-19 07:42:57,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:42:57,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-19 07:42:57,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 750 transitions. [2023-11-19 07:42:57,414 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5122950819672131 [2023-11-19 07:42:57,415 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 750 transitions. [2023-11-19 07:42:57,415 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 750 transitions. [2023-11-19 07:42:57,416 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:42:57,416 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 750 transitions. [2023-11-19 07:42:57,418 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 125.0) internal successors, (750), 6 states have internal predecessors, (750), 0 states have call successors, (0), 0 states 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:42:57,421 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 244.0) internal successors, (1708), 7 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states 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:42:57,422 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 244.0) internal successors, (1708), 7 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states 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:42:57,422 INFO L175 Difference]: Start difference. First operand has 56 places, 54 transitions, 385 flow. Second operand 6 states and 750 transitions. [2023-11-19 07:42:57,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 120 transitions, 1029 flow [2023-11-19 07:42:57,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 120 transitions, 1004 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-11-19 07:42:57,767 INFO L231 Difference]: Finished difference. Result has 60 places, 68 transitions, 572 flow [2023-11-19 07:42:57,767 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=369, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=572, PETRI_PLACES=60, PETRI_TRANSITIONS=68} [2023-11-19 07:42:57,768 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 16 predicate places. [2023-11-19 07:42:57,768 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 68 transitions, 572 flow [2023-11-19 07:42:57,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 115.33333333333333) internal successors, (692), 6 states have internal predecessors, (692), 0 states have call successors, (0), 0 states 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:42:57,769 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:42:57,769 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:42:57,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 07:42:57,770 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-19 07:42:57,770 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:42:57,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1984247715, now seen corresponding path program 1 times [2023-11-19 07:42:57,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:42:57,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543106732] [2023-11-19 07:42:57,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:42:57,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:42:57,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:58,996 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:42:58,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:42:58,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543106732] [2023-11-19 07:42:58,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543106732] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:42:58,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:42:58,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 07:42:58,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700350281] [2023-11-19 07:42:58,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:42:58,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-19 07:42:59,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:42:59,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-19 07:42:59,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-11-19 07:42:59,125 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 244 [2023-11-19 07:42:59,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 68 transitions, 572 flow. Second operand has 8 states, 8 states have (on average 102.125) internal successors, (817), 8 states have internal predecessors, (817), 0 states have call successors, (0), 0 states 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:42:59,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:42:59,127 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 244 [2023-11-19 07:42:59,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:43:02,402 INFO L124 PetriNetUnfolderBase]: 13891/18866 cut-off events. [2023-11-19 07:43:02,402 INFO L125 PetriNetUnfolderBase]: For 49712/49712 co-relation queries the response was YES. [2023-11-19 07:43:02,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80231 conditions, 18866 events. 13891/18866 cut-off events. For 49712/49712 co-relation queries the response was YES. Maximal size of possible extension queue 589. Compared 95751 event pairs, 3570 based on Foata normal form. 264/19130 useless extension candidates. Maximal degree in co-relation 80206. Up to 13154 conditions per place. [2023-11-19 07:43:02,563 INFO L140 encePairwiseOnDemand]: 230/244 looper letters, 98 selfloop transitions, 93 changer transitions 35/226 dead transitions. [2023-11-19 07:43:02,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 226 transitions, 2162 flow [2023-11-19 07:43:02,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-19 07:43:02,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-19 07:43:02,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1140 transitions. [2023-11-19 07:43:02,572 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4672131147540984 [2023-11-19 07:43:02,572 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1140 transitions. [2023-11-19 07:43:02,573 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1140 transitions. [2023-11-19 07:43:02,574 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:43:02,574 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1140 transitions. [2023-11-19 07:43:02,580 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states 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:43:02,590 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 244.0) internal successors, (2684), 11 states have internal predecessors, (2684), 0 states have call successors, (0), 0 states 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:43:02,591 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 244.0) internal successors, (2684), 11 states have internal predecessors, (2684), 0 states have call successors, (0), 0 states 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:43:02,591 INFO L175 Difference]: Start difference. First operand has 60 places, 68 transitions, 572 flow. Second operand 10 states and 1140 transitions. [2023-11-19 07:43:02,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 226 transitions, 2162 flow [2023-11-19 07:43:03,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 226 transitions, 2106 flow, removed 28 selfloop flow, removed 2 redundant places. [2023-11-19 07:43:03,533 INFO L231 Difference]: Finished difference. Result has 73 places, 140 transitions, 1636 flow [2023-11-19 07:43:03,533 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=552, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1636, PETRI_PLACES=73, PETRI_TRANSITIONS=140} [2023-11-19 07:43:03,534 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 29 predicate places. [2023-11-19 07:43:03,534 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 140 transitions, 1636 flow [2023-11-19 07:43:03,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 102.125) internal successors, (817), 8 states have internal predecessors, (817), 0 states have call successors, (0), 0 states 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:43:03,535 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:43:03,535 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:43:03,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 07:43:03,535 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-19 07:43:03,535 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:43:03,536 INFO L85 PathProgramCache]: Analyzing trace with hash -72927969, now seen corresponding path program 2 times [2023-11-19 07:43:03,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:43:03,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143961531] [2023-11-19 07:43:03,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:43:03,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:43:03,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:04,204 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:43:04,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:43:04,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143961531] [2023-11-19 07:43:04,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143961531] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:43:04,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:43:04,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:43:04,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699190947] [2023-11-19 07:43:04,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:43:04,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:43:04,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:43:04,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:43:04,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:43:04,225 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 244 [2023-11-19 07:43:04,228 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 140 transitions, 1636 flow. Second operand has 7 states, 7 states have (on average 115.28571428571429) internal successors, (807), 7 states have internal predecessors, (807), 0 states have call successors, (0), 0 states 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:43:04,228 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:43:04,228 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 244 [2023-11-19 07:43:04,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:43:07,394 INFO L124 PetriNetUnfolderBase]: 11472/16179 cut-off events. [2023-11-19 07:43:07,394 INFO L125 PetriNetUnfolderBase]: For 93058/94995 co-relation queries the response was YES. [2023-11-19 07:43:07,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86816 conditions, 16179 events. 11472/16179 cut-off events. For 93058/94995 co-relation queries the response was YES. Maximal size of possible extension queue 655. Compared 90669 event pairs, 4308 based on Foata normal form. 1361/17276 useless extension candidates. Maximal degree in co-relation 86783. Up to 11156 conditions per place. [2023-11-19 07:43:07,575 INFO L140 encePairwiseOnDemand]: 237/244 looper letters, 96 selfloop transitions, 57 changer transitions 27/197 dead transitions. [2023-11-19 07:43:07,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 197 transitions, 2572 flow [2023-11-19 07:43:07,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:43:07,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-19 07:43:07,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 740 transitions. [2023-11-19 07:43:07,581 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.505464480874317 [2023-11-19 07:43:07,581 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 740 transitions. [2023-11-19 07:43:07,581 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 740 transitions. [2023-11-19 07:43:07,582 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:43:07,582 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 740 transitions. [2023-11-19 07:43:07,585 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 123.33333333333333) internal successors, (740), 6 states have internal predecessors, (740), 0 states have call successors, (0), 0 states 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:43:07,589 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 244.0) internal successors, (1708), 7 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states 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:43:07,590 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 244.0) internal successors, (1708), 7 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states 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:43:07,590 INFO L175 Difference]: Start difference. First operand has 73 places, 140 transitions, 1636 flow. Second operand 6 states and 740 transitions. [2023-11-19 07:43:07,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 197 transitions, 2572 flow [2023-11-19 07:43:08,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 197 transitions, 2501 flow, removed 35 selfloop flow, removed 4 redundant places. [2023-11-19 07:43:08,925 INFO L231 Difference]: Finished difference. Result has 74 places, 153 transitions, 1981 flow [2023-11-19 07:43:08,926 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=1571, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1981, PETRI_PLACES=74, PETRI_TRANSITIONS=153} [2023-11-19 07:43:08,927 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 30 predicate places. [2023-11-19 07:43:08,927 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 153 transitions, 1981 flow [2023-11-19 07:43:08,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 115.28571428571429) internal successors, (807), 7 states have internal predecessors, (807), 0 states have call successors, (0), 0 states 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:43:08,928 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:43:08,928 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:43:08,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-19 07:43:08,929 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-19 07:43:08,929 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:43:08,930 INFO L85 PathProgramCache]: Analyzing trace with hash -583346700, now seen corresponding path program 1 times [2023-11-19 07:43:08,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:43:08,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697737367] [2023-11-19 07:43:08,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:43:08,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:43:08,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:09,177 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:43:09,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:43:09,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697737367] [2023-11-19 07:43:09,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697737367] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:43:09,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:43:09,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:43:09,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715737198] [2023-11-19 07:43:09,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:43:09,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:43:09,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:43:09,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:43:09,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:43:09,192 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 244 [2023-11-19 07:43:09,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 153 transitions, 1981 flow. Second operand has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states 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:43:09,193 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:43:09,193 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 244 [2023-11-19 07:43:09,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:43:10,565 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([468] L857-1-->L864: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd0~0_70 256) 0))) (.cse5 (not (= 0 (mod v_~y$r_buff0_thd0~0_74 256)))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_161 256) 0)))) (let ((.cse1 (and .cse5 .cse4)) (.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_162 256) 0)))) (.cse2 (and .cse3 (not (= (mod v_~y$w_buff1_used~0_137 256) 0))))) (and (= v_~y$w_buff0_used~0_161 (ite .cse0 0 v_~y$w_buff0_used~0_162)) (= v_~y$w_buff1_used~0_136 (ite (or .cse1 .cse2) 0 v_~y$w_buff1_used~0_137)) (= v_~y$r_buff0_thd0~0_73 (ite .cse1 0 v_~y$r_buff0_thd0~0_74)) (= (ite .cse0 v_~y$w_buff0~0_75 (ite .cse2 v_~y$w_buff1~0_70 v_~y~0_88)) v_~y~0_87) (= (ite (or (and .cse3 (not (= (mod v_~y$w_buff1_used~0_136 256) 0))) (and .cse4 (not (= (mod v_~y$r_buff0_thd0~0_73 256) 0)))) 0 v_~y$r_buff1_thd0~0_70) v_~y$r_buff1_thd0~0_69)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_162, ~y$w_buff1~0=v_~y$w_buff1~0_70, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_74, ~y$w_buff0~0=v_~y$w_buff0~0_75, ~y~0=v_~y~0_88, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_70, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_137} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_161, ~y$w_buff1~0=v_~y$w_buff1~0_70, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_73, ~y$w_buff0~0=v_~y$w_buff0~0_75, ~y~0=v_~y~0_87, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_69, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_136, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8|} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1][103], [114#P0EXITtrue, Black: 253#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), Black: 257#(and (= ~y$r_buff0_thd0~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), Black: 259#(and (= ~y$r_buff0_thd0~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~y$r_buff1_thd0~0 0)), 166#true, Black: 200#(and (<= 0 (div ~y$r_buff0_thd0~0 256)) (not (= 2 ~y~0)) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0))), P0Thread1of1ForFork3InUse, Black: 197#(and (<= 0 (div ~y$r_buff0_thd0~0 256)) (not (= 2 ~y~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0))), P2Thread1of1ForFork2InUse, P1Thread1of1ForFork1InUse, P3Thread1of1ForFork0InUse, Black: 208#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y$w_buff0_used~0 1)), Black: 212#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 0) (= ~y$r_buff1_thd0~0 0)), 45#L822true, 222#(= ~y$r_buff0_thd0~0 0), 264#true, Black: 154#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), 205#true, 99#P1EXITtrue, 151#true, 117#L864true, 252#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 231#(and (= ~y$r_buff0_thd0~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~y~0 1)), Black: 169#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))), 25#L799true, Black: 229#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))), Black: 233#(and (= ~y$r_buff0_thd0~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), Black: 168#(= ~__unbuffered_p3_EAX~0 0), Black: 223#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 184#(and (= ~y$w_buff1~0 0) (not (= 2 ~y~0)) (= ~y$w_buff0_used~0 0) (<= 0 ~y$w_buff1_used~0) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (= ~y$w_buff0~0 0))]) [2023-11-19 07:43:10,565 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-11-19 07:43:10,565 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-19 07:43:10,565 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-19 07:43:10,565 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-19 07:43:10,566 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([406] L822-->L829: Formula: (let ((.cse1 (not (= (mod v_~y$w_buff0_used~0_135 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_30 256) 0))) (.cse0 (not (= (mod v_~y$r_buff1_thd4~0_28 256) 0)))) (let ((.cse3 (and .cse0 (not (= (mod v_~y$w_buff1_used~0_119 256) 0)))) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_136 256) 0)) .cse5)) (.cse2 (and .cse1 .cse5))) (and (= (ite (or (and .cse0 (not (= (mod v_~y$w_buff1_used~0_118 256) 0))) (and .cse1 (not (= (mod v_~y$r_buff0_thd4~0_29 256) 0)))) 0 v_~y$r_buff1_thd4~0_28) v_~y$r_buff1_thd4~0_27) (= v_~y$w_buff1_used~0_118 (ite (or .cse2 .cse3) 0 v_~y$w_buff1_used~0_119)) (= v_~y~0_77 (ite .cse4 v_~y$w_buff0~0_51 (ite .cse3 v_~y$w_buff1~0_56 v_~y~0_78))) (= v_~y$w_buff0_used~0_135 (ite .cse4 0 v_~y$w_buff0_used~0_136)) (= v_~y$r_buff0_thd4~0_29 (ite .cse2 0 v_~y$r_buff0_thd4~0_30))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_30, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_28, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_136, ~y$w_buff1~0=v_~y$w_buff1~0_56, ~y$w_buff0~0=v_~y$w_buff0~0_51, ~y~0=v_~y~0_78, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_119} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_29, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_27, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_135, ~y$w_buff1~0=v_~y$w_buff1~0_56, ~y$w_buff0~0=v_~y$w_buff0~0_51, ~y~0=v_~y~0_77, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_118} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][151], [114#P0EXITtrue, Black: 253#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), Black: 257#(and (= ~y$r_buff0_thd0~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), Black: 259#(and (= ~y$r_buff0_thd0~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~y$r_buff1_thd0~0 0)), 137#L857-1true, 166#true, Black: 200#(and (<= 0 (div ~y$r_buff0_thd0~0 256)) (not (= 2 ~y~0)) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0))), P0Thread1of1ForFork3InUse, Black: 197#(and (<= 0 (div ~y$r_buff0_thd0~0 256)) (not (= 2 ~y~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0))), P2Thread1of1ForFork2InUse, P1Thread1of1ForFork1InUse, P3Thread1of1ForFork0InUse, Black: 208#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y$w_buff0_used~0 1)), Black: 212#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 0) (= ~y$r_buff1_thd0~0 0)), 222#(= ~y$r_buff0_thd0~0 0), 264#true, Black: 154#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))), 205#true, Black: 159#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), 99#P1EXITtrue, 151#true, 252#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 231#(and (= ~y$r_buff0_thd0~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~y~0 1)), Black: 169#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))), 25#L799true, Black: 229#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))), Black: 233#(and (= ~y$r_buff0_thd0~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), Black: 168#(= ~__unbuffered_p3_EAX~0 0), Black: 223#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), 12#L829true, Black: 184#(and (= ~y$w_buff1~0 0) (not (= 2 ~y~0)) (= ~y$w_buff0_used~0 0) (<= 0 ~y$w_buff1_used~0) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (= ~y$w_buff0~0 0))]) [2023-11-19 07:43:10,566 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-11-19 07:43:10,566 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-19 07:43:10,566 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-19 07:43:10,566 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-19 07:43:10,567 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([398] L799-->L806: Formula: (let ((.cse1 (not (= (mod v_~y$r_buff1_thd3~0_22 256) 0))) (.cse2 (not (= (mod v_~y$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_31 256) 0)))) (let ((.cse3 (and .cse2 .cse5)) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_100 256) 0)) .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_85 256) 0)) .cse1))) (and (= (ite .cse0 0 v_~y$w_buff0_used~0_100) v_~y$w_buff0_used~0_99) (= (ite (or (and .cse1 (not (= (mod v_~y$w_buff1_used~0_84 256) 0))) (and (not (= (mod v_~y$r_buff0_thd3~0_30 256) 0)) .cse2)) 0 v_~y$r_buff1_thd3~0_22) v_~y$r_buff1_thd3~0_21) (= v_~y$w_buff1_used~0_84 (ite (or .cse3 .cse4) 0 v_~y$w_buff1_used~0_85)) (= v_~y$r_buff0_thd3~0_30 (ite .cse3 0 v_~y$r_buff0_thd3~0_31)) (= v_~y~0_53 (ite .cse0 v_~y$w_buff0~0_29 (ite .cse4 v_~y$w_buff1~0_38 v_~y~0_54)))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_22, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_100, ~y$w_buff1~0=v_~y$w_buff1~0_38, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_31, ~y$w_buff0~0=v_~y$w_buff0~0_29, ~y~0=v_~y~0_54, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_85} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_21, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_99, ~y$w_buff1~0=v_~y$w_buff1~0_38, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_30, ~y$w_buff0~0=v_~y$w_buff0~0_29, ~y~0=v_~y~0_53, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_84} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][123], [114#P0EXITtrue, Black: 253#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), Black: 257#(and (= ~y$r_buff0_thd0~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), Black: 259#(and (= ~y$r_buff0_thd0~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~y$r_buff1_thd0~0 0)), 137#L857-1true, 166#true, Black: 200#(and (<= 0 (div ~y$r_buff0_thd0~0 256)) (not (= 2 ~y~0)) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0))), P0Thread1of1ForFork3InUse, Black: 197#(and (<= 0 (div ~y$r_buff0_thd0~0 256)) (not (= 2 ~y~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0))), P2Thread1of1ForFork2InUse, P1Thread1of1ForFork1InUse, P3Thread1of1ForFork0InUse, Black: 208#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y$w_buff0_used~0 1)), Black: 212#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 0) (= ~y$r_buff1_thd0~0 0)), 45#L822true, 222#(= ~y$r_buff0_thd0~0 0), 264#true, Black: 154#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), 205#true, 99#P1EXITtrue, 36#L806true, 151#true, 252#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 231#(and (= ~y$r_buff0_thd0~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~y~0 1)), Black: 169#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 229#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))), Black: 233#(and (= ~y$r_buff0_thd0~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), Black: 168#(= ~__unbuffered_p3_EAX~0 0), Black: 223#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 184#(and (= ~y$w_buff1~0 0) (not (= 2 ~y~0)) (= ~y$w_buff0_used~0 0) (<= 0 ~y$w_buff1_used~0) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (= ~y$w_buff0~0 0))]) [2023-11-19 07:43:10,567 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-11-19 07:43:10,567 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-19 07:43:10,567 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-19 07:43:10,567 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-19 07:43:10,837 INFO L124 PetriNetUnfolderBase]: 6533/9258 cut-off events. [2023-11-19 07:43:10,838 INFO L125 PetriNetUnfolderBase]: For 96509/99794 co-relation queries the response was YES. [2023-11-19 07:43:10,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55338 conditions, 9258 events. 6533/9258 cut-off events. For 96509/99794 co-relation queries the response was YES. Maximal size of possible extension queue 477. Compared 49846 event pairs, 1029 based on Foata normal form. 1558/10318 useless extension candidates. Maximal degree in co-relation 55304. Up to 7222 conditions per place. [2023-11-19 07:43:10,927 INFO L140 encePairwiseOnDemand]: 238/244 looper letters, 187 selfloop transitions, 5 changer transitions 0/215 dead transitions. [2023-11-19 07:43:10,927 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 215 transitions, 3163 flow [2023-11-19 07:43:10,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:43:10,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:43:10,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 385 transitions. [2023-11-19 07:43:10,930 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5259562841530054 [2023-11-19 07:43:10,930 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 385 transitions. [2023-11-19 07:43:10,930 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 385 transitions. [2023-11-19 07:43:10,931 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:43:10,931 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 385 transitions. [2023-11-19 07:43:10,933 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 0 states have call successors, (0), 0 states 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:43:10,935 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 244.0) internal successors, (976), 4 states have internal predecessors, (976), 0 states have call successors, (0), 0 states 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:43:10,936 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 244.0) internal successors, (976), 4 states have internal predecessors, (976), 0 states have call successors, (0), 0 states 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:43:10,936 INFO L175 Difference]: Start difference. First operand has 74 places, 153 transitions, 1981 flow. Second operand 3 states and 385 transitions. [2023-11-19 07:43:10,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 215 transitions, 3163 flow [2023-11-19 07:43:11,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 215 transitions, 3007 flow, removed 25 selfloop flow, removed 5 redundant places. [2023-11-19 07:43:11,164 INFO L231 Difference]: Finished difference. Result has 70 places, 153 transitions, 1860 flow [2023-11-19 07:43:11,164 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=1827, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1860, PETRI_PLACES=70, PETRI_TRANSITIONS=153} [2023-11-19 07:43:11,165 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 26 predicate places. [2023-11-19 07:43:11,165 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 153 transitions, 1860 flow [2023-11-19 07:43:11,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states 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:43:11,166 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:43:11,166 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:43:11,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-19 07:43:11,167 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-19 07:43:11,167 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:43:11,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1345323933, now seen corresponding path program 1 times [2023-11-19 07:43:11,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:43:11,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444738019] [2023-11-19 07:43:11,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:43:11,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:43:11,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:11,483 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:43:11,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:43:11,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444738019] [2023-11-19 07:43:11,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444738019] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:43:11,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:43:11,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:43:11,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047792784] [2023-11-19 07:43:11,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:43:11,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:43:11,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:43:11,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:43:11,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:43:11,495 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 244 [2023-11-19 07:43:11,496 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 153 transitions, 1860 flow. Second operand has 4 states, 4 states have (on average 118.0) internal successors, (472), 4 states have internal predecessors, (472), 0 states have call successors, (0), 0 states 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:43:11,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:43:11,496 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 244 [2023-11-19 07:43:11,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:43:12,519 INFO L124 PetriNetUnfolderBase]: 3271/4889 cut-off events. [2023-11-19 07:43:12,519 INFO L125 PetriNetUnfolderBase]: For 42278/43404 co-relation queries the response was YES. [2023-11-19 07:43:12,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28451 conditions, 4889 events. 3271/4889 cut-off events. For 42278/43404 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 25419 event pairs, 422 based on Foata normal form. 839/5583 useless extension candidates. Maximal degree in co-relation 28419. Up to 2556 conditions per place. [2023-11-19 07:43:12,561 INFO L140 encePairwiseOnDemand]: 238/244 looper letters, 205 selfloop transitions, 9 changer transitions 0/237 dead transitions. [2023-11-19 07:43:12,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 237 transitions, 3287 flow [2023-11-19 07:43:12,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:43:12,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 07:43:12,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 515 transitions. [2023-11-19 07:43:12,564 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5276639344262295 [2023-11-19 07:43:12,564 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 515 transitions. [2023-11-19 07:43:12,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 515 transitions. [2023-11-19 07:43:12,565 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:43:12,565 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 515 transitions. [2023-11-19 07:43:12,566 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 128.75) internal successors, (515), 4 states have internal predecessors, (515), 0 states have call successors, (0), 0 states 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:43:12,568 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 244.0) internal successors, (1220), 5 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states 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:43:12,569 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 244.0) internal successors, (1220), 5 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states 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:43:12,569 INFO L175 Difference]: Start difference. First operand has 70 places, 153 transitions, 1860 flow. Second operand 4 states and 515 transitions. [2023-11-19 07:43:12,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 237 transitions, 3287 flow [2023-11-19 07:43:12,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 237 transitions, 3252 flow, removed 15 selfloop flow, removed 1 redundant places. [2023-11-19 07:43:12,648 INFO L231 Difference]: Finished difference. Result has 73 places, 135 transitions, 1571 flow [2023-11-19 07:43:12,648 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=1519, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1571, PETRI_PLACES=73, PETRI_TRANSITIONS=135} [2023-11-19 07:43:12,649 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 29 predicate places. [2023-11-19 07:43:12,649 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 135 transitions, 1571 flow [2023-11-19 07:43:12,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 118.0) internal successors, (472), 4 states have internal predecessors, (472), 0 states have call successors, (0), 0 states 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:43:12,650 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:43:12,650 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:43:12,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-19 07:43:12,650 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-19 07:43:12,651 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:43:12,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1505461921, now seen corresponding path program 1 times [2023-11-19 07:43:12,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:43:12,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367062553] [2023-11-19 07:43:12,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:43:12,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:43:12,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:12,880 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:43:12,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:43:12,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367062553] [2023-11-19 07:43:12,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367062553] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:43:12,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:43:12,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:43:12,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481224866] [2023-11-19 07:43:12,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:43:12,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:43:12,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:43:12,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:43:12,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:43:12,893 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 244 [2023-11-19 07:43:12,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 135 transitions, 1571 flow. Second operand has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 0 states have call successors, (0), 0 states 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:43:12,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:43:12,894 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 244 [2023-11-19 07:43:12,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:43:13,499 INFO L124 PetriNetUnfolderBase]: 2388/3594 cut-off events. [2023-11-19 07:43:13,500 INFO L125 PetriNetUnfolderBase]: For 29079/29638 co-relation queries the response was YES. [2023-11-19 07:43:13,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21263 conditions, 3594 events. 2388/3594 cut-off events. For 29079/29638 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 18196 event pairs, 319 based on Foata normal form. 471/3997 useless extension candidates. Maximal degree in co-relation 21229. Up to 1820 conditions per place. [2023-11-19 07:43:13,526 INFO L140 encePairwiseOnDemand]: 238/244 looper letters, 201 selfloop transitions, 13 changer transitions 0/237 dead transitions. [2023-11-19 07:43:13,526 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 237 transitions, 3200 flow [2023-11-19 07:43:13,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:43:13,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-19 07:43:13,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 643 transitions. [2023-11-19 07:43:13,528 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5270491803278688 [2023-11-19 07:43:13,528 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 643 transitions. [2023-11-19 07:43:13,529 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 643 transitions. [2023-11-19 07:43:13,529 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:43:13,529 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 643 transitions. [2023-11-19 07:43:13,531 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 128.6) internal successors, (643), 5 states have internal predecessors, (643), 0 states have call successors, (0), 0 states 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:43:13,534 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 244.0) internal successors, (1464), 6 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states 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:43:13,535 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 244.0) internal successors, (1464), 6 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states 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:43:13,535 INFO L175 Difference]: Start difference. First operand has 73 places, 135 transitions, 1571 flow. Second operand 5 states and 643 transitions. [2023-11-19 07:43:13,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 237 transitions, 3200 flow [2023-11-19 07:43:13,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 237 transitions, 3110 flow, removed 40 selfloop flow, removed 2 redundant places. [2023-11-19 07:43:13,637 INFO L231 Difference]: Finished difference. Result has 76 places, 121 transitions, 1336 flow [2023-11-19 07:43:13,637 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=1268, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1336, PETRI_PLACES=76, PETRI_TRANSITIONS=121} [2023-11-19 07:43:13,638 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 32 predicate places. [2023-11-19 07:43:13,638 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 121 transitions, 1336 flow [2023-11-19 07:43:13,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 0 states have call successors, (0), 0 states 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:43:13,639 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:43:13,639 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:43:13,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-19 07:43:13,639 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-19 07:43:13,640 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:43:13,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1092966052, now seen corresponding path program 1 times [2023-11-19 07:43:13,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:43:13,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809701388] [2023-11-19 07:43:13,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:43:13,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:43:13,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:13,914 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:43:13,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:43:13,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809701388] [2023-11-19 07:43:13,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809701388] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:43:13,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:43:13,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:43:13,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873286361] [2023-11-19 07:43:13,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:43:13,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:43:13,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:43:13,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:43:13,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:43:13,932 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 244 [2023-11-19 07:43:13,933 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 121 transitions, 1336 flow. Second operand has 5 states, 5 states have (on average 117.4) internal successors, (587), 5 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:43:13,933 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:43:13,933 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 244 [2023-11-19 07:43:13,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:43:14,793 INFO L124 PetriNetUnfolderBase]: 3272/4954 cut-off events. [2023-11-19 07:43:14,793 INFO L125 PetriNetUnfolderBase]: For 37846/38563 co-relation queries the response was YES. [2023-11-19 07:43:14,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29672 conditions, 4954 events. 3272/4954 cut-off events. For 37846/38563 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 27211 event pairs, 304 based on Foata normal form. 528/5334 useless extension candidates. Maximal degree in co-relation 29637. Up to 2676 conditions per place. [2023-11-19 07:43:14,830 INFO L140 encePairwiseOnDemand]: 240/244 looper letters, 183 selfloop transitions, 3 changer transitions 72/277 dead transitions. [2023-11-19 07:43:14,830 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 277 transitions, 3684 flow [2023-11-19 07:43:14,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:43:14,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-19 07:43:14,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 634 transitions. [2023-11-19 07:43:14,833 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.519672131147541 [2023-11-19 07:43:14,833 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 634 transitions. [2023-11-19 07:43:14,834 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 634 transitions. [2023-11-19 07:43:14,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:43:14,834 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 634 transitions. [2023-11-19 07:43:14,836 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 126.8) internal successors, (634), 5 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:43:14,839 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 244.0) internal successors, (1464), 6 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states 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:43:14,840 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 244.0) internal successors, (1464), 6 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states 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:43:14,840 INFO L175 Difference]: Start difference. First operand has 76 places, 121 transitions, 1336 flow. Second operand 5 states and 634 transitions. [2023-11-19 07:43:14,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 277 transitions, 3684 flow [2023-11-19 07:43:15,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 277 transitions, 3594 flow, removed 22 selfloop flow, removed 3 redundant places. [2023-11-19 07:43:15,014 INFO L231 Difference]: Finished difference. Result has 80 places, 123 transitions, 1344 flow [2023-11-19 07:43:15,014 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=1302, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1344, PETRI_PLACES=80, PETRI_TRANSITIONS=123} [2023-11-19 07:43:15,015 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 36 predicate places. [2023-11-19 07:43:15,015 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 123 transitions, 1344 flow [2023-11-19 07:43:15,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.4) internal successors, (587), 5 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:43:15,015 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:43:15,016 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:43:15,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-19 07:43:15,016 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-19 07:43:15,016 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:43:15,016 INFO L85 PathProgramCache]: Analyzing trace with hash 753834070, now seen corresponding path program 2 times [2023-11-19 07:43:15,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:43:15,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169834180] [2023-11-19 07:43:15,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:43:15,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:43:15,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:15,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:43:15,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:43:15,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169834180] [2023-11-19 07:43:15,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169834180] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:43:15,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:43:15,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:43:15,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433881799] [2023-11-19 07:43:15,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:43:15,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:43:15,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:43:15,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:43:15,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:43:15,255 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 244 [2023-11-19 07:43:15,256 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 123 transitions, 1344 flow. Second operand has 6 states, 6 states have (on average 117.5) internal successors, (705), 6 states have internal predecessors, (705), 0 states have call successors, (0), 0 states 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:43:15,256 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:43:15,256 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 244 [2023-11-19 07:43:15,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:43:16,052 INFO L124 PetriNetUnfolderBase]: 3081/4547 cut-off events. [2023-11-19 07:43:16,053 INFO L125 PetriNetUnfolderBase]: For 38276/38994 co-relation queries the response was YES. [2023-11-19 07:43:16,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27227 conditions, 4547 events. 3081/4547 cut-off events. For 38276/38994 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 24052 event pairs, 354 based on Foata normal form. 500/4928 useless extension candidates. Maximal degree in co-relation 27196. Up to 2354 conditions per place. [2023-11-19 07:43:16,090 INFO L140 encePairwiseOnDemand]: 238/244 looper letters, 168 selfloop transitions, 17 changer transitions 27/234 dead transitions. [2023-11-19 07:43:16,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 234 transitions, 3099 flow [2023-11-19 07:43:16,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:43:16,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-19 07:43:16,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 757 transitions. [2023-11-19 07:43:16,094 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5170765027322405 [2023-11-19 07:43:16,094 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 757 transitions. [2023-11-19 07:43:16,094 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 757 transitions. [2023-11-19 07:43:16,094 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:43:16,095 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 757 transitions. [2023-11-19 07:43:16,097 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 126.16666666666667) internal successors, (757), 6 states have internal predecessors, (757), 0 states have call successors, (0), 0 states 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:43:16,100 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 244.0) internal successors, (1708), 7 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states 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:43:16,100 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 244.0) internal successors, (1708), 7 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states 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:43:16,101 INFO L175 Difference]: Start difference. First operand has 80 places, 123 transitions, 1344 flow. Second operand 6 states and 757 transitions. [2023-11-19 07:43:16,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 234 transitions, 3099 flow [2023-11-19 07:43:16,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 234 transitions, 2949 flow, removed 33 selfloop flow, removed 5 redundant places. [2023-11-19 07:43:16,345 INFO L231 Difference]: Finished difference. Result has 80 places, 110 transitions, 1165 flow [2023-11-19 07:43:16,345 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=1204, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1165, PETRI_PLACES=80, PETRI_TRANSITIONS=110} [2023-11-19 07:43:16,346 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 36 predicate places. [2023-11-19 07:43:16,346 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 110 transitions, 1165 flow [2023-11-19 07:43:16,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 117.5) internal successors, (705), 6 states have internal predecessors, (705), 0 states have call successors, (0), 0 states 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:43:16,346 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:43:16,347 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:43:16,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-19 07:43:16,347 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-19 07:43:16,347 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:43:16,347 INFO L85 PathProgramCache]: Analyzing trace with hash -688459015, now seen corresponding path program 1 times [2023-11-19 07:43:16,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:43:16,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140176811] [2023-11-19 07:43:16,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:43:16,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:43:16,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat