./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b2eff8ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c679fc7-e413-49c4-92be-c9cee6359f7e/bin/uautomizer-GMMbpWq8iD/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c679fc7-e413-49c4-92be-c9cee6359f7e/bin/uautomizer-GMMbpWq8iD/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c679fc7-e413-49c4-92be-c9cee6359f7e/bin/uautomizer-GMMbpWq8iD/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c679fc7-e413-49c4-92be-c9cee6359f7e/bin/uautomizer-GMMbpWq8iD/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c679fc7-e413-49c4-92be-c9cee6359f7e/bin/uautomizer-GMMbpWq8iD/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c679fc7-e413-49c4-92be-c9cee6359f7e/bin/uautomizer-GMMbpWq8iD --witnessprinter.witness.filename witness.graphml --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 473191b5f1326a38296af26dcd2c7f553c42833f82b512e9fb358484309bc769 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-b2eff8b [2021-10-29 00:01:04,440 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-29 00:01:04,442 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-29 00:01:04,480 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-29 00:01:04,481 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-29 00:01:04,483 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-29 00:01:04,485 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-29 00:01:04,488 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-29 00:01:04,491 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-29 00:01:04,492 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-29 00:01:04,494 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-29 00:01:04,496 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-29 00:01:04,497 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-29 00:01:04,499 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-29 00:01:04,501 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-29 00:01:04,503 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-29 00:01:04,505 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-29 00:01:04,506 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-29 00:01:04,509 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-29 00:01:04,512 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-29 00:01:04,514 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-29 00:01:04,516 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-29 00:01:04,518 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-29 00:01:04,519 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-29 00:01:04,524 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-29 00:01:04,525 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-29 00:01:04,526 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-29 00:01:04,527 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-29 00:01:04,528 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-29 00:01:04,529 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-29 00:01:04,530 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-29 00:01:04,531 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-29 00:01:04,533 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-29 00:01:04,534 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-29 00:01:04,536 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-29 00:01:04,536 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-29 00:01:04,538 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-29 00:01:04,538 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-29 00:01:04,539 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-29 00:01:04,540 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-29 00:01:04,541 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-29 00:01:04,543 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c679fc7-e413-49c4-92be-c9cee6359f7e/bin/uautomizer-GMMbpWq8iD/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-29 00:01:04,577 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-29 00:01:04,578 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-29 00:01:04,578 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-29 00:01:04,579 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-29 00:01:04,580 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-29 00:01:04,580 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-29 00:01:04,581 INFO L138 SettingsManager]: * Use SBE=true [2021-10-29 00:01:04,581 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-29 00:01:04,581 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-29 00:01:04,582 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-29 00:01:04,582 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-29 00:01:04,582 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-29 00:01:04,583 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-29 00:01:04,583 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-29 00:01:04,583 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-29 00:01:04,583 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-29 00:01:04,584 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-29 00:01:04,584 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-29 00:01:04,584 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-29 00:01:04,585 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-29 00:01:04,585 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-29 00:01:04,585 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-29 00:01:04,585 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-29 00:01:04,586 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-29 00:01:04,586 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-29 00:01:04,587 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-29 00:01:04,587 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-29 00:01:04,587 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-29 00:01:04,587 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-10-29 00:01:04,588 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-10-29 00:01:04,588 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-29 00:01:04,588 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-29 00:01:04,593 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_7c679fc7-e413-49c4-92be-c9cee6359f7e/bin/uautomizer-GMMbpWq8iD/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_7c679fc7-e413-49c4-92be-c9cee6359f7e/bin/uautomizer-GMMbpWq8iD Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 473191b5f1326a38296af26dcd2c7f553c42833f82b512e9fb358484309bc769 [2021-10-29 00:01:04,971 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-29 00:01:05,004 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-29 00:01:05,007 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-29 00:01:05,009 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-29 00:01:05,010 INFO L275 PluginConnector]: CDTParser initialized [2021-10-29 00:01:05,011 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c679fc7-e413-49c4-92be-c9cee6359f7e/bin/uautomizer-GMMbpWq8iD/../../sv-benchmarks/c/pthread-wmm/mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2021-10-29 00:01:05,091 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c679fc7-e413-49c4-92be-c9cee6359f7e/bin/uautomizer-GMMbpWq8iD/data/e98d0266b/633bb1a137514cb6b0a0ec724e81f597/FLAG1c79310c5 [2021-10-29 00:01:05,836 INFO L306 CDTParser]: Found 1 translation units. [2021-10-29 00:01:05,837 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c679fc7-e413-49c4-92be-c9cee6359f7e/sv-benchmarks/c/pthread-wmm/mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2021-10-29 00:01:05,859 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c679fc7-e413-49c4-92be-c9cee6359f7e/bin/uautomizer-GMMbpWq8iD/data/e98d0266b/633bb1a137514cb6b0a0ec724e81f597/FLAG1c79310c5 [2021-10-29 00:01:06,078 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c679fc7-e413-49c4-92be-c9cee6359f7e/bin/uautomizer-GMMbpWq8iD/data/e98d0266b/633bb1a137514cb6b0a0ec724e81f597 [2021-10-29 00:01:06,081 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-29 00:01:06,083 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-29 00:01:06,087 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-29 00:01:06,087 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-29 00:01:06,108 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-29 00:01:06,109 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 12:01:06" (1/1) ... [2021-10-29 00:01:06,112 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11901696 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 12:01:06, skipping insertion in model container [2021-10-29 00:01:06,112 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 12:01:06" (1/1) ... [2021-10-29 00:01:06,122 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-29 00:01:06,192 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-29 00:01:06,432 WARN L228 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_7c679fc7-e413-49c4-92be-c9cee6359f7e/sv-benchmarks/c/pthread-wmm/mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2021-10-29 00:01:06,703 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-29 00:01:06,727 INFO L203 MainTranslator]: Completed pre-run [2021-10-29 00:01:06,753 WARN L228 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_7c679fc7-e413-49c4-92be-c9cee6359f7e/sv-benchmarks/c/pthread-wmm/mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2021-10-29 00:01:06,831 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-29 00:01:06,889 INFO L208 MainTranslator]: Completed translation [2021-10-29 00:01:06,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 12:01:06 WrapperNode [2021-10-29 00:01:06,890 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-29 00:01:06,892 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-29 00:01:06,892 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-29 00:01:06,893 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-29 00:01:06,903 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 12:01:06" (1/1) ... [2021-10-29 00:01:06,936 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 12:01:06" (1/1) ... [2021-10-29 00:01:06,983 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-29 00:01:06,984 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-29 00:01:06,984 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-29 00:01:06,985 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-29 00:01:06,995 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 12:01:06" (1/1) ... [2021-10-29 00:01:06,995 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 12:01:06" (1/1) ... [2021-10-29 00:01:07,011 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 12:01:06" (1/1) ... [2021-10-29 00:01:07,025 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 12:01:06" (1/1) ... [2021-10-29 00:01:07,039 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 12:01:06" (1/1) ... [2021-10-29 00:01:07,044 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 12:01:06" (1/1) ... [2021-10-29 00:01:07,049 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 12:01:06" (1/1) ... [2021-10-29 00:01:07,056 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-29 00:01:07,057 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-29 00:01:07,058 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-29 00:01:07,058 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-29 00:01:07,059 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 12:01:06" (1/1) ... [2021-10-29 00:01:07,069 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-29 00:01:07,091 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c679fc7-e413-49c4-92be-c9cee6359f7e/bin/uautomizer-GMMbpWq8iD/z3 [2021-10-29 00:01:07,107 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c679fc7-e413-49c4-92be-c9cee6359f7e/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-29 00:01:07,124 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c679fc7-e413-49c4-92be-c9cee6359f7e/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-29 00:01:07,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-29 00:01:07,180 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-10-29 00:01:07,180 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-29 00:01:07,181 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-29 00:01:07,181 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-10-29 00:01:07,181 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-10-29 00:01:07,181 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-10-29 00:01:07,181 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-10-29 00:01:07,182 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-10-29 00:01:07,182 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-10-29 00:01:07,182 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-10-29 00:01:07,182 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-10-29 00:01:07,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-29 00:01:07,183 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-10-29 00:01:07,183 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-29 00:01:07,183 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-29 00:01:07,186 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-10-29 00:01:09,602 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-29 00:01:09,603 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-10-29 00:01:09,607 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 12:01:09 BoogieIcfgContainer [2021-10-29 00:01:09,608 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-29 00:01:09,613 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-29 00:01:09,613 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-29 00:01:09,617 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-29 00:01:09,617 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.10 12:01:06" (1/3) ... [2021-10-29 00:01:09,619 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55793eda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.10 12:01:09, skipping insertion in model container [2021-10-29 00:01:09,619 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 12:01:06" (2/3) ... [2021-10-29 00:01:09,620 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55793eda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.10 12:01:09, skipping insertion in model container [2021-10-29 00:01:09,620 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 12:01:09" (3/3) ... [2021-10-29 00:01:09,626 INFO L111 eAbstractionObserver]: Analyzing ICFG mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2021-10-29 00:01:09,664 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-10-29 00:01:09,664 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-29 00:01:09,664 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-10-29 00:01:09,664 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-10-29 00:01:09,726 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,727 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,727 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,727 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,727 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,728 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,728 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,728 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,728 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,729 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,729 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,729 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,731 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,731 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,732 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,733 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,733 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,733 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,733 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,734 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,734 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,735 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,735 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,736 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,736 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,737 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,738 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,738 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,738 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,739 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,739 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,739 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,739 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,740 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,740 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,740 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,740 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,740 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,740 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,741 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,741 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,741 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,742 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,742 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,742 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,742 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,743 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,743 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,743 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,744 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,745 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,745 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,745 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,745 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,746 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,746 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,746 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,746 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,746 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,746 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,747 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,747 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,747 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,747 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,748 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,748 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,748 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,749 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,749 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,749 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,749 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,750 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,750 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,751 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,751 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,751 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,751 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,752 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,752 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,752 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,753 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,753 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,753 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,754 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,763 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,766 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,766 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,767 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,767 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,767 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,768 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,769 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,769 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,770 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,780 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,780 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,780 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,781 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,783 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,783 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,783 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,783 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,784 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,784 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,784 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,784 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,785 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,785 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,785 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,786 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,788 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,788 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,789 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,789 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-29 00:01:09,790 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-10-29 00:01:09,856 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-29 00:01:09,864 INFO L339 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=LoopsAndPotentialCycles, 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, mLoopAccelerationTechnique=FAST_UPR [2021-10-29 00:01:09,865 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-10-29 00:01:09,882 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 139 places, 128 transitions, 276 flow [2021-10-29 00:01:09,973 INFO L129 PetriNetUnfolder]: 2/124 cut-off events. [2021-10-29 00:01:09,974 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-10-29 00:01:09,980 INFO L84 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 124 events. 2/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2021-10-29 00:01:09,980 INFO L82 GeneralOperation]: Start removeDead. Operand has 139 places, 128 transitions, 276 flow [2021-10-29 00:01:09,993 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 135 places, 124 transitions, 260 flow [2021-10-29 00:01:10,036 INFO L129 PetriNetUnfolder]: 0/87 cut-off events. [2021-10-29 00:01:10,037 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-10-29 00:01:10,037 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-29 00:01:10,038 INFO L254 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 00:01:10,039 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-29 00:01:10,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 00:01:10,050 INFO L85 PathProgramCache]: Analyzing trace with hash -2072098972, now seen corresponding path program 1 times [2021-10-29 00:01:10,061 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-29 00:01:10,063 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804979240] [2021-10-29 00:01:10,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 00:01:10,065 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 00:01:10,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:01:10,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 00:01:10,668 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-29 00:01:10,669 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804979240] [2021-10-29 00:01:10,670 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804979240] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 00:01:10,671 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 00:01:10,671 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-29 00:01:10,673 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195765422] [2021-10-29 00:01:10,686 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 00:01:10,686 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-29 00:01:10,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 00:01:10,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 00:01:10,710 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 128 [2021-10-29 00:01:10,720 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 124 transitions, 260 flow. Second operand has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:01:10,720 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-29 00:01:10,721 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 128 [2021-10-29 00:01:10,722 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-29 00:01:10,947 INFO L129 PetriNetUnfolder]: 16/198 cut-off events. [2021-10-29 00:01:10,948 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-10-29 00:01:10,952 INFO L84 FinitePrefix]: Finished finitePrefix Result has 246 conditions, 198 events. 16/198 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 472 event pairs, 2 based on Foata normal form. 9/200 useless extension candidates. Maximal degree in co-relation 193. Up to 27 conditions per place. [2021-10-29 00:01:10,957 INFO L132 encePairwiseOnDemand]: 123/128 looper letters, 7 selfloop transitions, 2 changer transitions 0/123 dead transitions. [2021-10-29 00:01:10,957 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 123 transitions, 276 flow [2021-10-29 00:01:10,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 00:01:10,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-10-29 00:01:10,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 368 transitions. [2021-10-29 00:01:10,984 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9583333333333334 [2021-10-29 00:01:10,985 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 368 transitions. [2021-10-29 00:01:10,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 368 transitions. [2021-10-29 00:01:10,992 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-29 00:01:10,995 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 368 transitions. [2021-10-29 00:01:11,003 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:01:11,018 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:01:11,019 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:01:11,021 INFO L186 Difference]: Start difference. First operand has 135 places, 124 transitions, 260 flow. Second operand 3 states and 368 transitions. [2021-10-29 00:01:11,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 123 transitions, 276 flow [2021-10-29 00:01:11,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 123 transitions, 272 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-10-29 00:01:11,037 INFO L242 Difference]: Finished difference. Result has 131 places, 120 transitions, 252 flow [2021-10-29 00:01:11,040 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=252, PETRI_PLACES=131, PETRI_TRANSITIONS=120} [2021-10-29 00:01:11,042 INFO L334 CegarLoopForPetriNet]: 135 programPoint places, -4 predicate places. [2021-10-29 00:01:11,043 INFO L470 AbstractCegarLoop]: Abstraction has has 131 places, 120 transitions, 252 flow [2021-10-29 00:01:11,044 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:01:11,045 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-29 00:01:11,045 INFO L254 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 00:01:11,045 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-29 00:01:11,046 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-29 00:01:11,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 00:01:11,047 INFO L85 PathProgramCache]: Analyzing trace with hash -882085588, now seen corresponding path program 1 times [2021-10-29 00:01:11,047 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-29 00:01:11,048 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325578965] [2021-10-29 00:01:11,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 00:01:11,048 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 00:01:11,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:01:11,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 00:01:11,497 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-29 00:01:11,498 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325578965] [2021-10-29 00:01:11,498 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325578965] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 00:01:11,498 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 00:01:11,498 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-29 00:01:11,499 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468682844] [2021-10-29 00:01:11,501 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-29 00:01:11,502 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-29 00:01:11,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-29 00:01:11,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-29 00:01:11,506 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 128 [2021-10-29 00:01:11,508 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 120 transitions, 252 flow. Second operand has 6 states, 6 states have (on average 116.16666666666667) internal successors, (697), 6 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:01:11,509 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-29 00:01:11,509 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 128 [2021-10-29 00:01:11,509 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-29 00:01:11,761 INFO L129 PetriNetUnfolder]: 30/278 cut-off events. [2021-10-29 00:01:11,762 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-10-29 00:01:11,767 INFO L84 FinitePrefix]: Finished finitePrefix Result has 364 conditions, 278 events. 30/278 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 945 event pairs, 6 based on Foata normal form. 0/272 useless extension candidates. Maximal degree in co-relation 316. Up to 36 conditions per place. [2021-10-29 00:01:11,769 INFO L132 encePairwiseOnDemand]: 121/128 looper letters, 8 selfloop transitions, 3 changer transitions 33/143 dead transitions. [2021-10-29 00:01:11,770 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 143 transitions, 364 flow [2021-10-29 00:01:11,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-29 00:01:11,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-10-29 00:01:11,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1070 transitions. [2021-10-29 00:01:11,779 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9288194444444444 [2021-10-29 00:01:11,784 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1070 transitions. [2021-10-29 00:01:11,785 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1070 transitions. [2021-10-29 00:01:11,786 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-29 00:01:11,786 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1070 transitions. [2021-10-29 00:01:11,791 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 118.88888888888889) internal successors, (1070), 9 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:01:11,799 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 128.0) internal successors, (1280), 10 states have internal predecessors, (1280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:01:11,801 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 128.0) internal successors, (1280), 10 states have internal predecessors, (1280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:01:11,801 INFO L186 Difference]: Start difference. First operand has 131 places, 120 transitions, 252 flow. Second operand 9 states and 1070 transitions. [2021-10-29 00:01:11,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 143 transitions, 364 flow [2021-10-29 00:01:11,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 143 transitions, 360 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-10-29 00:01:11,815 INFO L242 Difference]: Finished difference. Result has 144 places, 110 transitions, 267 flow [2021-10-29 00:01:11,815 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=267, PETRI_PLACES=144, PETRI_TRANSITIONS=110} [2021-10-29 00:01:11,816 INFO L334 CegarLoopForPetriNet]: 135 programPoint places, 9 predicate places. [2021-10-29 00:01:11,817 INFO L470 AbstractCegarLoop]: Abstraction has has 144 places, 110 transitions, 267 flow [2021-10-29 00:01:11,818 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 116.16666666666667) internal successors, (697), 6 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:01:11,818 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-29 00:01:11,818 INFO L254 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, 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, 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] [2021-10-29 00:01:11,819 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-29 00:01:11,819 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-29 00:01:11,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 00:01:11,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1020796469, now seen corresponding path program 1 times [2021-10-29 00:01:11,820 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-29 00:01:11,821 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555717152] [2021-10-29 00:01:11,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 00:01:11,822 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 00:01:11,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:01:12,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 00:01:12,103 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-29 00:01:12,104 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555717152] [2021-10-29 00:01:12,105 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555717152] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 00:01:12,106 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 00:01:12,106 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-29 00:01:12,106 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002425827] [2021-10-29 00:01:12,108 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-29 00:01:12,108 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-29 00:01:12,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-29 00:01:12,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-29 00:01:12,115 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 128 [2021-10-29 00:01:12,117 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 110 transitions, 267 flow. Second operand has 6 states, 6 states have (on average 117.16666666666667) internal successors, (703), 6 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:01:12,117 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-29 00:01:12,117 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 128 [2021-10-29 00:01:12,118 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-29 00:01:12,316 INFO L129 PetriNetUnfolder]: 28/212 cut-off events. [2021-10-29 00:01:12,317 INFO L130 PetriNetUnfolder]: For 171/172 co-relation queries the response was YES. [2021-10-29 00:01:12,319 INFO L84 FinitePrefix]: Finished finitePrefix Result has 415 conditions, 212 events. 28/212 cut-off events. For 171/172 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 587 event pairs, 9 based on Foata normal form. 6/212 useless extension candidates. Maximal degree in co-relation 380. Up to 31 conditions per place. [2021-10-29 00:01:12,321 INFO L132 encePairwiseOnDemand]: 122/128 looper letters, 6 selfloop transitions, 2 changer transitions 10/120 dead transitions. [2021-10-29 00:01:12,321 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 120 transitions, 341 flow [2021-10-29 00:01:12,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-29 00:01:12,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-10-29 00:01:12,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1064 transitions. [2021-10-29 00:01:12,327 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9236111111111112 [2021-10-29 00:01:12,328 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1064 transitions. [2021-10-29 00:01:12,328 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1064 transitions. [2021-10-29 00:01:12,329 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-29 00:01:12,329 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1064 transitions. [2021-10-29 00:01:12,335 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 118.22222222222223) internal successors, (1064), 9 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:01:12,340 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 128.0) internal successors, (1280), 10 states have internal predecessors, (1280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:01:12,342 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 128.0) internal successors, (1280), 10 states have internal predecessors, (1280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:01:12,342 INFO L186 Difference]: Start difference. First operand has 144 places, 110 transitions, 267 flow. Second operand 9 states and 1064 transitions. [2021-10-29 00:01:12,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 120 transitions, 341 flow [2021-10-29 00:01:12,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 120 transitions, 324 flow, removed 7 selfloop flow, removed 4 redundant places. [2021-10-29 00:01:12,351 INFO L242 Difference]: Finished difference. Result has 137 places, 110 transitions, 278 flow [2021-10-29 00:01:12,351 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=278, PETRI_PLACES=137, PETRI_TRANSITIONS=110} [2021-10-29 00:01:12,352 INFO L334 CegarLoopForPetriNet]: 135 programPoint places, 2 predicate places. [2021-10-29 00:01:12,352 INFO L470 AbstractCegarLoop]: Abstraction has has 137 places, 110 transitions, 278 flow [2021-10-29 00:01:12,353 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 117.16666666666667) internal successors, (703), 6 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:01:12,354 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-29 00:01:12,354 INFO L254 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, 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, 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, 1] [2021-10-29 00:01:12,354 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-29 00:01:12,355 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-29 00:01:12,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 00:01:12,355 INFO L85 PathProgramCache]: Analyzing trace with hash -735059568, now seen corresponding path program 1 times [2021-10-29 00:01:12,356 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-29 00:01:12,356 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788237232] [2021-10-29 00:01:12,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 00:01:12,357 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 00:01:12,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:01:12,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 00:01:12,623 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-29 00:01:12,624 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788237232] [2021-10-29 00:01:12,624 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788237232] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 00:01:12,624 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 00:01:12,624 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-29 00:01:12,625 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817777165] [2021-10-29 00:01:12,627 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-29 00:01:12,627 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-29 00:01:12,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-29 00:01:12,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-29 00:01:12,639 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 128 [2021-10-29 00:01:12,641 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 110 transitions, 278 flow. Second operand has 6 states, 6 states have (on average 116.16666666666667) internal successors, (697), 6 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:01:12,642 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-29 00:01:12,642 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 128 [2021-10-29 00:01:12,643 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-29 00:01:12,910 INFO L129 PetriNetUnfolder]: 56/266 cut-off events. [2021-10-29 00:01:12,910 INFO L130 PetriNetUnfolder]: For 324/336 co-relation queries the response was YES. [2021-10-29 00:01:12,913 INFO L84 FinitePrefix]: Finished finitePrefix Result has 613 conditions, 266 events. 56/266 cut-off events. For 324/336 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 956 event pairs, 16 based on Foata normal form. 6/263 useless extension candidates. Maximal degree in co-relation 549. Up to 60 conditions per place. [2021-10-29 00:01:12,916 INFO L132 encePairwiseOnDemand]: 121/128 looper letters, 8 selfloop transitions, 3 changer transitions 19/131 dead transitions. [2021-10-29 00:01:12,916 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 131 transitions, 408 flow [2021-10-29 00:01:12,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-29 00:01:12,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-10-29 00:01:12,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1067 transitions. [2021-10-29 00:01:12,922 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9262152777777778 [2021-10-29 00:01:12,922 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1067 transitions. [2021-10-29 00:01:12,922 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1067 transitions. [2021-10-29 00:01:12,923 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-29 00:01:12,924 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1067 transitions. [2021-10-29 00:01:12,929 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 118.55555555555556) internal successors, (1067), 9 states have internal predecessors, (1067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:01:12,933 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 128.0) internal successors, (1280), 10 states have internal predecessors, (1280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:01:12,934 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 128.0) internal successors, (1280), 10 states have internal predecessors, (1280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:01:12,935 INFO L186 Difference]: Start difference. First operand has 137 places, 110 transitions, 278 flow. Second operand 9 states and 1067 transitions. [2021-10-29 00:01:12,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 131 transitions, 408 flow [2021-10-29 00:01:12,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 131 transitions, 376 flow, removed 14 selfloop flow, removed 8 redundant places. [2021-10-29 00:01:12,945 INFO L242 Difference]: Finished difference. Result has 138 places, 112 transitions, 305 flow [2021-10-29 00:01:12,946 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=305, PETRI_PLACES=138, PETRI_TRANSITIONS=112} [2021-10-29 00:01:12,946 INFO L334 CegarLoopForPetriNet]: 135 programPoint places, 3 predicate places. [2021-10-29 00:01:12,947 INFO L470 AbstractCegarLoop]: Abstraction has has 138 places, 112 transitions, 305 flow [2021-10-29 00:01:12,947 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 116.16666666666667) internal successors, (697), 6 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:01:12,948 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-29 00:01:12,948 INFO L254 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, 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, 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, 1, 1] [2021-10-29 00:01:12,948 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-29 00:01:12,949 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-29 00:01:12,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 00:01:12,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1435381022, now seen corresponding path program 1 times [2021-10-29 00:01:12,950 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-29 00:01:12,950 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617653687] [2021-10-29 00:01:12,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 00:01:12,950 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 00:01:13,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:01:13,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 00:01:13,166 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-29 00:01:13,167 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617653687] [2021-10-29 00:01:13,168 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617653687] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 00:01:13,168 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 00:01:13,168 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-29 00:01:13,168 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774220607] [2021-10-29 00:01:13,169 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-29 00:01:13,170 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-29 00:01:13,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-29 00:01:13,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-29 00:01:13,173 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 128 [2021-10-29 00:01:13,175 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 112 transitions, 305 flow. Second operand has 6 states, 6 states have (on average 116.33333333333333) internal successors, (698), 6 states have internal predecessors, (698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:01:13,175 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-29 00:01:13,175 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 128 [2021-10-29 00:01:13,176 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-29 00:01:13,413 INFO L129 PetriNetUnfolder]: 35/266 cut-off events. [2021-10-29 00:01:13,413 INFO L130 PetriNetUnfolder]: For 479/572 co-relation queries the response was YES. [2021-10-29 00:01:13,416 INFO L84 FinitePrefix]: Finished finitePrefix Result has 683 conditions, 266 events. 35/266 cut-off events. For 479/572 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1014 event pairs, 4 based on Foata normal form. 8/264 useless extension candidates. Maximal degree in co-relation 618. Up to 36 conditions per place. [2021-10-29 00:01:13,419 INFO L132 encePairwiseOnDemand]: 122/128 looper letters, 12 selfloop transitions, 3 changer transitions 10/126 dead transitions. [2021-10-29 00:01:13,419 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 126 transitions, 455 flow [2021-10-29 00:01:13,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-29 00:01:13,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-10-29 00:01:13,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1061 transitions. [2021-10-29 00:01:13,424 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9210069444444444 [2021-10-29 00:01:13,425 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1061 transitions. [2021-10-29 00:01:13,425 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1061 transitions. [2021-10-29 00:01:13,426 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-29 00:01:13,426 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1061 transitions. [2021-10-29 00:01:13,430 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 117.88888888888889) internal successors, (1061), 9 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:01:13,435 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 128.0) internal successors, (1280), 10 states have internal predecessors, (1280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:01:13,436 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 128.0) internal successors, (1280), 10 states have internal predecessors, (1280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:01:13,436 INFO L186 Difference]: Start difference. First operand has 138 places, 112 transitions, 305 flow. Second operand 9 states and 1061 transitions. [2021-10-29 00:01:13,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 126 transitions, 455 flow [2021-10-29 00:01:13,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 126 transitions, 424 flow, removed 14 selfloop flow, removed 4 redundant places. [2021-10-29 00:01:13,444 INFO L242 Difference]: Finished difference. Result has 143 places, 112 transitions, 317 flow [2021-10-29 00:01:13,445 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=317, PETRI_PLACES=143, PETRI_TRANSITIONS=112} [2021-10-29 00:01:13,445 INFO L334 CegarLoopForPetriNet]: 135 programPoint places, 8 predicate places. [2021-10-29 00:01:13,445 INFO L470 AbstractCegarLoop]: Abstraction has has 143 places, 112 transitions, 317 flow [2021-10-29 00:01:13,446 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 116.33333333333333) internal successors, (698), 6 states have internal predecessors, (698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:01:13,446 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-29 00:01:13,447 INFO L254 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, 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, 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, 1, 1, 1] [2021-10-29 00:01:13,447 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-29 00:01:13,448 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-29 00:01:13,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 00:01:13,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1855546223, now seen corresponding path program 1 times [2021-10-29 00:01:13,449 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-29 00:01:13,449 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181953396] [2021-10-29 00:01:13,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 00:01:13,449 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 00:01:13,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:01:13,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 00:01:13,831 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-29 00:01:13,831 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181953396] [2021-10-29 00:01:13,832 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181953396] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 00:01:13,832 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 00:01:13,832 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-29 00:01:13,832 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630018218] [2021-10-29 00:01:13,833 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-29 00:01:13,833 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-29 00:01:13,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-29 00:01:13,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-10-29 00:01:13,836 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 128 [2021-10-29 00:01:13,838 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 112 transitions, 317 flow. Second operand has 9 states, 9 states have (on average 109.33333333333333) internal successors, (984), 9 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:01:13,838 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-29 00:01:13,838 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 128 [2021-10-29 00:01:13,838 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-29 00:01:14,546 INFO L129 PetriNetUnfolder]: 510/1368 cut-off events. [2021-10-29 00:01:14,547 INFO L130 PetriNetUnfolder]: For 3562/3658 co-relation queries the response was YES. [2021-10-29 00:01:14,565 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3743 conditions, 1368 events. 510/1368 cut-off events. For 3562/3658 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 9958 event pairs, 245 based on Foata normal form. 42/1354 useless extension candidates. Maximal degree in co-relation 3671. Up to 408 conditions per place. [2021-10-29 00:01:14,578 INFO L132 encePairwiseOnDemand]: 117/128 looper letters, 13 selfloop transitions, 8 changer transitions 22/140 dead transitions. [2021-10-29 00:01:14,578 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 140 transitions, 499 flow [2021-10-29 00:01:14,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-29 00:01:14,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-10-29 00:01:14,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1449 transitions. [2021-10-29 00:01:14,585 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8707932692307693 [2021-10-29 00:01:14,586 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1449 transitions. [2021-10-29 00:01:14,586 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1449 transitions. [2021-10-29 00:01:14,587 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-29 00:01:14,588 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1449 transitions. [2021-10-29 00:01:14,594 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 111.46153846153847) internal successors, (1449), 13 states have internal predecessors, (1449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:01:14,600 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 128.0) internal successors, (1792), 14 states have internal predecessors, (1792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:01:14,601 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 128.0) internal successors, (1792), 14 states have internal predecessors, (1792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:01:14,601 INFO L186 Difference]: Start difference. First operand has 143 places, 112 transitions, 317 flow. Second operand 13 states and 1449 transitions. [2021-10-29 00:01:14,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 140 transitions, 499 flow [2021-10-29 00:01:14,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 140 transitions, 462 flow, removed 17 selfloop flow, removed 7 redundant places. [2021-10-29 00:01:14,619 INFO L242 Difference]: Finished difference. Result has 150 places, 116 transitions, 352 flow [2021-10-29 00:01:14,620 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=352, PETRI_PLACES=150, PETRI_TRANSITIONS=116} [2021-10-29 00:01:14,620 INFO L334 CegarLoopForPetriNet]: 135 programPoint places, 15 predicate places. [2021-10-29 00:01:14,621 INFO L470 AbstractCegarLoop]: Abstraction has has 150 places, 116 transitions, 352 flow [2021-10-29 00:01:14,621 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 109.33333333333333) internal successors, (984), 9 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:01:14,622 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-29 00:01:14,622 INFO L254 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, 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, 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, 1, 1, 1, 1] [2021-10-29 00:01:14,622 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-29 00:01:14,622 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-29 00:01:14,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 00:01:14,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1858958029, now seen corresponding path program 1 times [2021-10-29 00:01:14,623 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-29 00:01:14,624 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363580350] [2021-10-29 00:01:14,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 00:01:14,624 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 00:01:14,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:01:14,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 00:01:14,966 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-29 00:01:14,966 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363580350] [2021-10-29 00:01:14,966 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363580350] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 00:01:14,966 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 00:01:14,966 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-29 00:01:14,967 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976634505] [2021-10-29 00:01:14,967 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-29 00:01:14,967 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-29 00:01:14,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-29 00:01:14,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-10-29 00:01:14,970 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 128 [2021-10-29 00:01:14,973 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 116 transitions, 352 flow. Second operand has 10 states, 10 states have (on average 109.3) internal successors, (1093), 10 states have internal predecessors, (1093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:01:14,973 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-29 00:01:14,973 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 128 [2021-10-29 00:01:14,973 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-29 00:01:15,858 INFO L129 PetriNetUnfolder]: 486/1236 cut-off events. [2021-10-29 00:01:15,858 INFO L130 PetriNetUnfolder]: For 4313/4399 co-relation queries the response was YES. [2021-10-29 00:01:15,875 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4268 conditions, 1236 events. 486/1236 cut-off events. For 4313/4399 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 8388 event pairs, 105 based on Foata normal form. 31/1217 useless extension candidates. Maximal degree in co-relation 4190. Up to 412 conditions per place. [2021-10-29 00:01:15,889 INFO L132 encePairwiseOnDemand]: 117/128 looper letters, 19 selfloop transitions, 15 changer transitions 19/150 dead transitions. [2021-10-29 00:01:15,889 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 150 transitions, 668 flow [2021-10-29 00:01:15,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-29 00:01:15,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-10-29 00:01:15,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1456 transitions. [2021-10-29 00:01:15,895 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.875 [2021-10-29 00:01:15,895 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1456 transitions. [2021-10-29 00:01:15,896 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1456 transitions. [2021-10-29 00:01:15,897 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-29 00:01:15,897 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1456 transitions. [2021-10-29 00:01:15,903 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 112.0) internal successors, (1456), 13 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:01:15,910 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 128.0) internal successors, (1792), 14 states have internal predecessors, (1792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:01:15,911 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 128.0) internal successors, (1792), 14 states have internal predecessors, (1792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:01:15,912 INFO L186 Difference]: Start difference. First operand has 150 places, 116 transitions, 352 flow. Second operand 13 states and 1456 transitions. [2021-10-29 00:01:15,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 150 transitions, 668 flow [2021-10-29 00:01:15,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 150 transitions, 642 flow, removed 10 selfloop flow, removed 6 redundant places. [2021-10-29 00:01:15,925 INFO L242 Difference]: Finished difference. Result has 158 places, 124 transitions, 445 flow [2021-10-29 00:01:15,925 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=445, PETRI_PLACES=158, PETRI_TRANSITIONS=124} [2021-10-29 00:01:15,925 INFO L334 CegarLoopForPetriNet]: 135 programPoint places, 23 predicate places. [2021-10-29 00:01:15,926 INFO L470 AbstractCegarLoop]: Abstraction has has 158 places, 124 transitions, 445 flow [2021-10-29 00:01:15,927 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 109.3) internal successors, (1093), 10 states have internal predecessors, (1093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:01:15,927 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-29 00:01:15,927 INFO L254 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, 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, 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, 1, 1, 1, 1] [2021-10-29 00:01:15,927 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-29 00:01:15,927 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-29 00:01:15,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 00:01:15,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1154019027, now seen corresponding path program 2 times [2021-10-29 00:01:15,928 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-29 00:01:15,929 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266798202] [2021-10-29 00:01:15,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 00:01:15,929 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 00:01:15,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:01:16,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 00:01:16,217 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-29 00:01:16,217 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266798202] [2021-10-29 00:01:16,217 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266798202] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 00:01:16,218 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 00:01:16,218 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-29 00:01:16,218 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842055480] [2021-10-29 00:01:16,219 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-29 00:01:16,219 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-29 00:01:16,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-29 00:01:16,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-10-29 00:01:16,222 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 128 [2021-10-29 00:01:16,224 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 124 transitions, 445 flow. Second operand has 9 states, 9 states have (on average 111.33333333333333) internal successors, (1002), 9 states have internal predecessors, (1002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:01:16,224 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-29 00:01:16,224 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 128 [2021-10-29 00:01:16,224 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-29 00:01:16,874 INFO L129 PetriNetUnfolder]: 439/1169 cut-off events. [2021-10-29 00:01:16,875 INFO L130 PetriNetUnfolder]: For 5884/6014 co-relation queries the response was YES. [2021-10-29 00:01:16,894 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4673 conditions, 1169 events. 439/1169 cut-off events. For 5884/6014 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 7944 event pairs, 118 based on Foata normal form. 47/1163 useless extension candidates. Maximal degree in co-relation 4591. Up to 311 conditions per place. [2021-10-29 00:01:16,907 INFO L132 encePairwiseOnDemand]: 119/128 looper letters, 20 selfloop transitions, 12 changer transitions 20/150 dead transitions. [2021-10-29 00:01:16,907 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 150 transitions, 771 flow [2021-10-29 00:01:16,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-29 00:01:16,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-10-29 00:01:16,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1253 transitions. [2021-10-29 00:01:16,914 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8899147727272727 [2021-10-29 00:01:16,914 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1253 transitions. [2021-10-29 00:01:16,914 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1253 transitions. [2021-10-29 00:01:16,915 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-29 00:01:16,916 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1253 transitions. [2021-10-29 00:01:16,920 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 113.9090909090909) internal successors, (1253), 11 states have internal predecessors, (1253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:01:16,925 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 128.0) internal successors, (1536), 12 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:01:16,926 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 128.0) internal successors, (1536), 12 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:01:16,926 INFO L186 Difference]: Start difference. First operand has 158 places, 124 transitions, 445 flow. Second operand 11 states and 1253 transitions. [2021-10-29 00:01:16,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 150 transitions, 771 flow [2021-10-29 00:01:16,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 150 transitions, 716 flow, removed 27 selfloop flow, removed 7 redundant places. [2021-10-29 00:01:16,950 INFO L242 Difference]: Finished difference. Result has 162 places, 125 transitions, 485 flow [2021-10-29 00:01:16,950 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=418, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=485, PETRI_PLACES=162, PETRI_TRANSITIONS=125} [2021-10-29 00:01:16,951 INFO L334 CegarLoopForPetriNet]: 135 programPoint places, 27 predicate places. [2021-10-29 00:01:16,951 INFO L470 AbstractCegarLoop]: Abstraction has has 162 places, 125 transitions, 485 flow [2021-10-29 00:01:16,952 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 111.33333333333333) internal successors, (1002), 9 states have internal predecessors, (1002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:01:16,952 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-29 00:01:16,952 INFO L254 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, 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, 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, 1, 1, 1, 1, 1] [2021-10-29 00:01:16,952 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-29 00:01:16,953 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-29 00:01:16,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 00:01:16,953 INFO L85 PathProgramCache]: Analyzing trace with hash -10665160, now seen corresponding path program 1 times [2021-10-29 00:01:16,954 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-29 00:01:16,954 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805553620] [2021-10-29 00:01:16,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 00:01:16,954 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 00:01:17,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:01:17,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 00:01:17,427 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-29 00:01:17,427 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805553620] [2021-10-29 00:01:17,427 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805553620] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 00:01:17,427 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 00:01:17,428 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-29 00:01:17,428 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272738737] [2021-10-29 00:01:17,428 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-29 00:01:17,429 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-29 00:01:17,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-29 00:01:17,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-10-29 00:01:17,432 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 128 [2021-10-29 00:01:17,435 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 125 transitions, 485 flow. Second operand has 11 states, 11 states have (on average 109.36363636363636) internal successors, (1203), 11 states have internal predecessors, (1203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:01:17,436 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-29 00:01:17,436 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 128 [2021-10-29 00:01:17,436 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-29 00:01:18,310 INFO L129 PetriNetUnfolder]: 326/1094 cut-off events. [2021-10-29 00:01:18,310 INFO L130 PetriNetUnfolder]: For 7296/7430 co-relation queries the response was YES. [2021-10-29 00:01:18,327 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4745 conditions, 1094 events. 326/1094 cut-off events. For 7296/7430 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 7853 event pairs, 55 based on Foata normal form. 31/1078 useless extension candidates. Maximal degree in co-relation 4658. Up to 295 conditions per place. [2021-10-29 00:01:18,342 INFO L132 encePairwiseOnDemand]: 117/128 looper letters, 28 selfloop transitions, 15 changer transitions 10/149 dead transitions. [2021-10-29 00:01:18,342 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 149 transitions, 859 flow [2021-10-29 00:01:18,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-29 00:01:18,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-10-29 00:01:18,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1444 transitions. [2021-10-29 00:01:18,349 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8677884615384616 [2021-10-29 00:01:18,349 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1444 transitions. [2021-10-29 00:01:18,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1444 transitions. [2021-10-29 00:01:18,351 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-29 00:01:18,351 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1444 transitions. [2021-10-29 00:01:18,357 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 111.07692307692308) internal successors, (1444), 13 states have internal predecessors, (1444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:01:18,362 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 128.0) internal successors, (1792), 14 states have internal predecessors, (1792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:01:18,363 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 128.0) internal successors, (1792), 14 states have internal predecessors, (1792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:01:18,363 INFO L186 Difference]: Start difference. First operand has 162 places, 125 transitions, 485 flow. Second operand 13 states and 1444 transitions. [2021-10-29 00:01:18,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 149 transitions, 859 flow [2021-10-29 00:01:18,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 149 transitions, 808 flow, removed 14 selfloop flow, removed 7 redundant places. [2021-10-29 00:01:18,385 INFO L242 Difference]: Finished difference. Result has 169 places, 132 transitions, 604 flow [2021-10-29 00:01:18,386 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=458, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=604, PETRI_PLACES=169, PETRI_TRANSITIONS=132} [2021-10-29 00:01:18,386 INFO L334 CegarLoopForPetriNet]: 135 programPoint places, 34 predicate places. [2021-10-29 00:01:18,387 INFO L470 AbstractCegarLoop]: Abstraction has has 169 places, 132 transitions, 604 flow [2021-10-29 00:01:18,388 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 109.36363636363636) internal successors, (1203), 11 states have internal predecessors, (1203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:01:18,388 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-29 00:01:18,388 INFO L254 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, 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, 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, 1, 1, 1, 1, 1] [2021-10-29 00:01:18,389 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-29 00:01:18,389 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-29 00:01:18,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 00:01:18,390 INFO L85 PathProgramCache]: Analyzing trace with hash -781008804, now seen corresponding path program 2 times [2021-10-29 00:01:18,390 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-29 00:01:18,390 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642397649] [2021-10-29 00:01:18,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 00:01:18,391 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 00:01:18,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:01:18,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 00:01:18,893 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-29 00:01:18,893 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642397649] [2021-10-29 00:01:18,894 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642397649] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 00:01:18,894 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 00:01:18,894 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-10-29 00:01:18,894 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901455261] [2021-10-29 00:01:18,895 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-10-29 00:01:18,895 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-29 00:01:18,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-10-29 00:01:18,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2021-10-29 00:01:18,898 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 128 [2021-10-29 00:01:18,901 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 132 transitions, 604 flow. Second operand has 15 states, 15 states have (on average 105.2) internal successors, (1578), 15 states have internal predecessors, (1578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:01:18,902 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-29 00:01:18,902 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 128 [2021-10-29 00:01:18,902 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-29 00:01:19,767 INFO L129 PetriNetUnfolder]: 354/1073 cut-off events. [2021-10-29 00:01:19,767 INFO L130 PetriNetUnfolder]: For 9293/9556 co-relation queries the response was YES. [2021-10-29 00:01:19,787 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5193 conditions, 1073 events. 354/1073 cut-off events. For 9293/9556 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 7385 event pairs, 126 based on Foata normal form. 30/1057 useless extension candidates. Maximal degree in co-relation 5098. Up to 423 conditions per place. [2021-10-29 00:01:19,805 INFO L132 encePairwiseOnDemand]: 115/128 looper letters, 27 selfloop transitions, 16 changer transitions 10/146 dead transitions. [2021-10-29 00:01:19,805 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 146 transitions, 897 flow [2021-10-29 00:01:19,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-29 00:01:19,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-10-29 00:01:19,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1703 transitions. [2021-10-29 00:01:19,813 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.83154296875 [2021-10-29 00:01:19,813 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1703 transitions. [2021-10-29 00:01:19,813 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1703 transitions. [2021-10-29 00:01:19,815 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-29 00:01:19,816 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1703 transitions. [2021-10-29 00:01:19,822 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 106.4375) internal successors, (1703), 16 states have internal predecessors, (1703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:01:19,829 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 128.0) internal successors, (2176), 17 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:01:19,831 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 128.0) internal successors, (2176), 17 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:01:19,831 INFO L186 Difference]: Start difference. First operand has 169 places, 132 transitions, 604 flow. Second operand 16 states and 1703 transitions. [2021-10-29 00:01:19,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 146 transitions, 897 flow [2021-10-29 00:01:19,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 146 transitions, 834 flow, removed 29 selfloop flow, removed 9 redundant places. [2021-10-29 00:01:19,863 INFO L242 Difference]: Finished difference. Result has 176 places, 133 transitions, 647 flow [2021-10-29 00:01:19,864 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=563, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=647, PETRI_PLACES=176, PETRI_TRANSITIONS=133} [2021-10-29 00:01:19,865 INFO L334 CegarLoopForPetriNet]: 135 programPoint places, 41 predicate places. [2021-10-29 00:01:19,865 INFO L470 AbstractCegarLoop]: Abstraction has has 176 places, 133 transitions, 647 flow [2021-10-29 00:01:19,866 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 105.2) internal successors, (1578), 15 states have internal predecessors, (1578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:01:19,866 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-29 00:01:19,867 INFO L254 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, 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, 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, 1, 1, 1, 1, 1] [2021-10-29 00:01:19,867 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-29 00:01:19,867 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-29 00:01:19,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 00:01:19,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1435044238, now seen corresponding path program 3 times [2021-10-29 00:01:19,868 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-29 00:01:19,869 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724467402] [2021-10-29 00:01:19,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 00:01:19,869 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 00:01:19,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:01:20,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 00:01:20,213 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-29 00:01:20,213 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724467402] [2021-10-29 00:01:20,214 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724467402] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 00:01:20,214 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 00:01:20,214 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-29 00:01:20,214 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312530573] [2021-10-29 00:01:20,215 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-29 00:01:20,215 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-29 00:01:20,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-29 00:01:20,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2021-10-29 00:01:20,218 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 128 [2021-10-29 00:01:20,220 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 133 transitions, 647 flow. Second operand has 12 states, 12 states have (on average 107.33333333333333) internal successors, (1288), 12 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:01:20,220 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-29 00:01:20,221 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 128 [2021-10-29 00:01:20,221 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-29 00:01:20,933 INFO L129 PetriNetUnfolder]: 285/1051 cut-off events. [2021-10-29 00:01:20,934 INFO L130 PetriNetUnfolder]: For 8859/9123 co-relation queries the response was YES. [2021-10-29 00:01:20,953 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4740 conditions, 1051 events. 285/1051 cut-off events. For 8859/9123 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 7686 event pairs, 60 based on Foata normal form. 35/1040 useless extension candidates. Maximal degree in co-relation 4642. Up to 218 conditions per place. [2021-10-29 00:01:20,965 INFO L132 encePairwiseOnDemand]: 118/128 looper letters, 29 selfloop transitions, 14 changer transitions 11/149 dead transitions. [2021-10-29 00:01:20,966 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 149 transitions, 980 flow [2021-10-29 00:01:20,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-29 00:01:20,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-10-29 00:01:20,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1417 transitions. [2021-10-29 00:01:20,971 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8515625 [2021-10-29 00:01:20,972 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1417 transitions. [2021-10-29 00:01:20,972 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1417 transitions. [2021-10-29 00:01:20,973 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-29 00:01:20,973 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1417 transitions. [2021-10-29 00:01:20,977 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 109.0) internal successors, (1417), 13 states have internal predecessors, (1417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:01:20,982 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 128.0) internal successors, (1792), 14 states have internal predecessors, (1792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:01:20,984 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 128.0) internal successors, (1792), 14 states have internal predecessors, (1792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:01:20,984 INFO L186 Difference]: Start difference. First operand has 176 places, 133 transitions, 647 flow. Second operand 13 states and 1417 transitions. [2021-10-29 00:01:20,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 149 transitions, 980 flow [2021-10-29 00:01:21,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 149 transitions, 850 flow, removed 54 selfloop flow, removed 14 redundant places. [2021-10-29 00:01:21,022 INFO L242 Difference]: Finished difference. Result has 175 places, 132 transitions, 608 flow [2021-10-29 00:01:21,022 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=577, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=608, PETRI_PLACES=175, PETRI_TRANSITIONS=132} [2021-10-29 00:01:21,023 INFO L334 CegarLoopForPetriNet]: 135 programPoint places, 40 predicate places. [2021-10-29 00:01:21,023 INFO L470 AbstractCegarLoop]: Abstraction has has 175 places, 132 transitions, 608 flow [2021-10-29 00:01:21,025 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 107.33333333333333) internal successors, (1288), 12 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:01:21,025 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-29 00:01:21,025 INFO L254 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, 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, 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, 1, 1, 1, 1, 1] [2021-10-29 00:01:21,026 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-29 00:01:21,026 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-29 00:01:21,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 00:01:21,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1680135858, now seen corresponding path program 1 times [2021-10-29 00:01:21,027 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-29 00:01:21,027 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296579379] [2021-10-29 00:01:21,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 00:01:21,028 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 00:01:21,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:01:21,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 00:01:21,183 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-29 00:01:21,184 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296579379] [2021-10-29 00:01:21,184 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296579379] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 00:01:21,184 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 00:01:21,184 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-29 00:01:21,185 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443201089] [2021-10-29 00:01:21,185 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-29 00:01:21,185 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-29 00:01:21,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-29 00:01:21,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-29 00:01:21,187 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 128 [2021-10-29 00:01:21,190 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 132 transitions, 608 flow. Second operand has 6 states, 6 states have (on average 114.16666666666667) internal successors, (685), 6 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:01:21,190 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-29 00:01:21,190 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 128 [2021-10-29 00:01:21,190 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-29 00:01:22,907 INFO L129 PetriNetUnfolder]: 2550/5439 cut-off events. [2021-10-29 00:01:22,907 INFO L130 PetriNetUnfolder]: For 12271/12580 co-relation queries the response was YES. [2021-10-29 00:01:23,006 INFO L84 FinitePrefix]: Finished finitePrefix Result has 14511 conditions, 5439 events. 2550/5439 cut-off events. For 12271/12580 co-relation queries the response was YES. Maximal size of possible extension queue 787. Compared 50899 event pairs, 190 based on Foata normal form. 68/4672 useless extension candidates. Maximal degree in co-relation 14421. Up to 1502 conditions per place. [2021-10-29 00:01:23,055 INFO L132 encePairwiseOnDemand]: 117/128 looper letters, 29 selfloop transitions, 20 changer transitions 0/169 dead transitions. [2021-10-29 00:01:23,056 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 169 transitions, 780 flow [2021-10-29 00:01:23,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-29 00:01:23,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-10-29 00:01:23,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1181 transitions. [2021-10-29 00:01:23,059 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.92265625 [2021-10-29 00:01:23,060 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1181 transitions. [2021-10-29 00:01:23,060 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1181 transitions. [2021-10-29 00:01:23,061 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-29 00:01:23,061 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1181 transitions. [2021-10-29 00:01:23,064 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 118.1) internal successors, (1181), 10 states have internal predecessors, (1181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:01:23,067 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 128.0) internal successors, (1408), 11 states have internal predecessors, (1408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:01:23,068 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 128.0) internal successors, (1408), 11 states have internal predecessors, (1408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:01:23,068 INFO L186 Difference]: Start difference. First operand has 175 places, 132 transitions, 608 flow. Second operand 10 states and 1181 transitions. [2021-10-29 00:01:23,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 169 transitions, 780 flow [2021-10-29 00:01:23,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 169 transitions, 723 flow, removed 23 selfloop flow, removed 13 redundant places. [2021-10-29 00:01:23,170 INFO L242 Difference]: Finished difference. Result has 171 places, 150 transitions, 694 flow [2021-10-29 00:01:23,170 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=551, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=694, PETRI_PLACES=171, PETRI_TRANSITIONS=150} [2021-10-29 00:01:23,171 INFO L334 CegarLoopForPetriNet]: 135 programPoint places, 36 predicate places. [2021-10-29 00:01:23,171 INFO L470 AbstractCegarLoop]: Abstraction has has 171 places, 150 transitions, 694 flow [2021-10-29 00:01:23,171 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 114.16666666666667) internal successors, (685), 6 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:01:23,172 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-29 00:01:23,172 INFO L254 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, 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, 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, 1, 1, 1, 1, 1, 1] [2021-10-29 00:01:23,172 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-29 00:01:23,172 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-29 00:01:23,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 00:01:23,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1746923776, now seen corresponding path program 1 times [2021-10-29 00:01:23,173 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-29 00:01:23,174 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652083590] [2021-10-29 00:01:23,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 00:01:23,174 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 00:01:23,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:01:23,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 00:01:23,325 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-29 00:01:23,325 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652083590] [2021-10-29 00:01:23,325 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652083590] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 00:01:23,325 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 00:01:23,325 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-29 00:01:23,326 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731686235] [2021-10-29 00:01:23,326 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-29 00:01:23,326 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-29 00:01:23,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-29 00:01:23,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-10-29 00:01:23,329 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 128 [2021-10-29 00:01:23,330 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 150 transitions, 694 flow. Second operand has 7 states, 7 states have (on average 114.14285714285714) internal successors, (799), 7 states have internal predecessors, (799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:01:23,331 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-29 00:01:23,331 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 128 [2021-10-29 00:01:23,331 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-29 00:01:25,001 INFO L129 PetriNetUnfolder]: 2507/5226 cut-off events. [2021-10-29 00:01:25,001 INFO L130 PetriNetUnfolder]: For 17706/30687 co-relation queries the response was YES. [2021-10-29 00:01:25,108 INFO L84 FinitePrefix]: Finished finitePrefix Result has 20403 conditions, 5226 events. 2507/5226 cut-off events. For 17706/30687 co-relation queries the response was YES. Maximal size of possible extension queue 799. Compared 48082 event pairs, 62 based on Foata normal form. 418/4941 useless extension candidates. Maximal degree in co-relation 20317. Up to 2611 conditions per place. [2021-10-29 00:01:25,153 INFO L132 encePairwiseOnDemand]: 117/128 looper letters, 34 selfloop transitions, 38 changer transitions 0/192 dead transitions. [2021-10-29 00:01:25,153 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 192 transitions, 1118 flow [2021-10-29 00:01:25,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-29 00:01:25,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-10-29 00:01:25,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1537 transitions. [2021-10-29 00:01:25,157 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9236778846153846 [2021-10-29 00:01:25,158 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1537 transitions. [2021-10-29 00:01:25,158 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1537 transitions. [2021-10-29 00:01:25,159 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-29 00:01:25,159 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1537 transitions. [2021-10-29 00:01:25,163 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 118.23076923076923) internal successors, (1537), 13 states have internal predecessors, (1537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:01:25,167 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 128.0) internal successors, (1792), 14 states have internal predecessors, (1792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:01:25,168 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 128.0) internal successors, (1792), 14 states have internal predecessors, (1792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:01:25,168 INFO L186 Difference]: Start difference. First operand has 171 places, 150 transitions, 694 flow. Second operand 13 states and 1537 transitions. [2021-10-29 00:01:25,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 192 transitions, 1118 flow [2021-10-29 00:01:25,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 192 transitions, 1116 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-10-29 00:01:25,235 INFO L242 Difference]: Finished difference. Result has 188 places, 170 transitions, 985 flow [2021-10-29 00:01:25,235 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=692, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=985, PETRI_PLACES=188, PETRI_TRANSITIONS=170} [2021-10-29 00:01:25,236 INFO L334 CegarLoopForPetriNet]: 135 programPoint places, 53 predicate places. [2021-10-29 00:01:25,236 INFO L470 AbstractCegarLoop]: Abstraction has has 188 places, 170 transitions, 985 flow [2021-10-29 00:01:25,236 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 114.14285714285714) internal successors, (799), 7 states have internal predecessors, (799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:01:25,237 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-29 00:01:25,237 INFO L254 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 00:01:25,237 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-29 00:01:25,237 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-29 00:01:25,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 00:01:25,238 INFO L85 PathProgramCache]: Analyzing trace with hash -947196417, now seen corresponding path program 1 times [2021-10-29 00:01:25,238 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-29 00:01:25,238 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196501259] [2021-10-29 00:01:25,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 00:01:25,239 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 00:01:25,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:01:25,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 00:01:25,452 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-29 00:01:25,452 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196501259] [2021-10-29 00:01:25,453 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196501259] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 00:01:25,453 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 00:01:25,453 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-29 00:01:25,453 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433531680] [2021-10-29 00:01:25,454 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-29 00:01:25,454 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-29 00:01:25,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-29 00:01:25,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-29 00:01:25,456 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 128 [2021-10-29 00:01:25,458 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 170 transitions, 985 flow. Second operand has 6 states, 6 states have (on average 116.33333333333333) internal successors, (698), 6 states have internal predecessors, (698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:01:25,458 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-29 00:01:25,458 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 128 [2021-10-29 00:01:25,458 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-29 00:01:26,885 INFO L129 PetriNetUnfolder]: 1434/4817 cut-off events. [2021-10-29 00:01:26,885 INFO L130 PetriNetUnfolder]: For 23428/36724 co-relation queries the response was YES. [2021-10-29 00:01:26,970 INFO L84 FinitePrefix]: Finished finitePrefix Result has 19924 conditions, 4817 events. 1434/4817 cut-off events. For 23428/36724 co-relation queries the response was YES. Maximal size of possible extension queue 574. Compared 53119 event pairs, 176 based on Foata normal form. 172/4418 useless extension candidates. Maximal degree in co-relation 19830. Up to 1705 conditions per place. [2021-10-29 00:01:27,004 INFO L132 encePairwiseOnDemand]: 122/128 looper letters, 14 selfloop transitions, 11 changer transitions 0/184 dead transitions. [2021-10-29 00:01:27,007 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 184 transitions, 1147 flow [2021-10-29 00:01:27,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-29 00:01:27,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-10-29 00:01:27,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1061 transitions. [2021-10-29 00:01:27,021 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9210069444444444 [2021-10-29 00:01:27,022 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1061 transitions. [2021-10-29 00:01:27,023 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1061 transitions. [2021-10-29 00:01:27,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-29 00:01:27,029 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1061 transitions. [2021-10-29 00:01:27,032 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 117.88888888888889) internal successors, (1061), 9 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:01:27,036 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 128.0) internal successors, (1280), 10 states have internal predecessors, (1280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:01:27,037 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 128.0) internal successors, (1280), 10 states have internal predecessors, (1280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:01:27,037 INFO L186 Difference]: Start difference. First operand has 188 places, 170 transitions, 985 flow. Second operand 9 states and 1061 transitions. [2021-10-29 00:01:27,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 184 transitions, 1147 flow [2021-10-29 00:01:27,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 184 transitions, 1044 flow, removed 42 selfloop flow, removed 4 redundant places. [2021-10-29 00:01:27,324 INFO L242 Difference]: Finished difference. Result has 199 places, 178 transitions, 1019 flow [2021-10-29 00:01:27,325 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=888, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1019, PETRI_PLACES=199, PETRI_TRANSITIONS=178} [2021-10-29 00:01:27,325 INFO L334 CegarLoopForPetriNet]: 135 programPoint places, 64 predicate places. [2021-10-29 00:01:27,325 INFO L470 AbstractCegarLoop]: Abstraction has has 199 places, 178 transitions, 1019 flow [2021-10-29 00:01:27,326 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 116.33333333333333) internal successors, (698), 6 states have internal predecessors, (698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:01:27,326 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-29 00:01:27,326 INFO L254 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 00:01:27,327 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-29 00:01:27,327 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-29 00:01:27,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 00:01:27,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1330634717, now seen corresponding path program 1 times [2021-10-29 00:01:27,328 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-29 00:01:27,328 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437142535] [2021-10-29 00:01:27,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 00:01:27,329 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 00:01:27,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:01:27,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 00:01:27,521 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-29 00:01:27,521 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437142535] [2021-10-29 00:01:27,521 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437142535] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 00:01:27,522 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 00:01:27,522 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-29 00:01:27,522 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253080817] [2021-10-29 00:01:27,523 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-29 00:01:27,523 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-29 00:01:27,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-29 00:01:27,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-10-29 00:01:27,526 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 128 [2021-10-29 00:01:27,528 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 178 transitions, 1019 flow. Second operand has 8 states, 8 states have (on average 114.125) internal successors, (913), 8 states have internal predecessors, (913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:01:27,528 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-29 00:01:27,528 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 128 [2021-10-29 00:01:27,529 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-29 00:01:30,266 INFO L129 PetriNetUnfolder]: 3629/7065 cut-off events. [2021-10-29 00:01:30,266 INFO L130 PetriNetUnfolder]: For 61109/83558 co-relation queries the response was YES. [2021-10-29 00:01:30,368 INFO L84 FinitePrefix]: Finished finitePrefix Result has 36234 conditions, 7065 events. 3629/7065 cut-off events. For 61109/83558 co-relation queries the response was YES. Maximal size of possible extension queue 1126. Compared 66053 event pairs, 9 based on Foata normal form. 704/6718 useless extension candidates. Maximal degree in co-relation 36134. Up to 3136 conditions per place. [2021-10-29 00:01:30,404 INFO L132 encePairwiseOnDemand]: 117/128 looper letters, 28 selfloop transitions, 58 changer transitions 22/223 dead transitions. [2021-10-29 00:01:30,404 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 223 transitions, 1684 flow [2021-10-29 00:01:30,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-29 00:01:30,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-10-29 00:01:30,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1893 transitions. [2021-10-29 00:01:30,410 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.92431640625 [2021-10-29 00:01:30,410 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1893 transitions. [2021-10-29 00:01:30,410 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1893 transitions. [2021-10-29 00:01:30,412 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-29 00:01:30,412 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1893 transitions. [2021-10-29 00:01:30,417 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 118.3125) internal successors, (1893), 16 states have internal predecessors, (1893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:01:30,422 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 128.0) internal successors, (2176), 17 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:01:30,423 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 128.0) internal successors, (2176), 17 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:01:30,423 INFO L186 Difference]: Start difference. First operand has 199 places, 178 transitions, 1019 flow. Second operand 16 states and 1893 transitions. [2021-10-29 00:01:30,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 223 transitions, 1684 flow [2021-10-29 00:01:31,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 223 transitions, 1636 flow, removed 19 selfloop flow, removed 3 redundant places. [2021-10-29 00:01:31,012 INFO L242 Difference]: Finished difference. Result has 215 places, 191 transitions, 1315 flow [2021-10-29 00:01:31,013 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=942, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1315, PETRI_PLACES=215, PETRI_TRANSITIONS=191} [2021-10-29 00:01:31,014 INFO L334 CegarLoopForPetriNet]: 135 programPoint places, 80 predicate places. [2021-10-29 00:01:31,014 INFO L470 AbstractCegarLoop]: Abstraction has has 215 places, 191 transitions, 1315 flow [2021-10-29 00:01:31,014 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 114.125) internal successors, (913), 8 states have internal predecessors, (913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:01:31,015 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-29 00:01:31,015 INFO L254 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 00:01:31,015 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-29 00:01:31,015 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-29 00:01:31,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 00:01:31,016 INFO L85 PathProgramCache]: Analyzing trace with hash 2004810304, now seen corresponding path program 1 times [2021-10-29 00:01:31,016 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-29 00:01:31,017 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365713964] [2021-10-29 00:01:31,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 00:01:31,017 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 00:01:31,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:01:31,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 00:01:31,202 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-29 00:01:31,203 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365713964] [2021-10-29 00:01:31,207 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365713964] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 00:01:31,207 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 00:01:31,207 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-29 00:01:31,207 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901384620] [2021-10-29 00:01:31,209 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-29 00:01:31,209 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-29 00:01:31,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-29 00:01:31,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-10-29 00:01:31,212 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 128 [2021-10-29 00:01:31,214 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 191 transitions, 1315 flow. Second operand has 9 states, 9 states have (on average 114.11111111111111) internal successors, (1027), 9 states have internal predecessors, (1027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:01:31,214 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-29 00:01:31,214 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 128 [2021-10-29 00:01:31,215 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-29 00:01:33,203 INFO L129 PetriNetUnfolder]: 3140/6401 cut-off events. [2021-10-29 00:01:33,203 INFO L130 PetriNetUnfolder]: For 75495/116058 co-relation queries the response was YES. [2021-10-29 00:01:33,301 INFO L84 FinitePrefix]: Finished finitePrefix Result has 37000 conditions, 6401 events. 3140/6401 cut-off events. For 75495/116058 co-relation queries the response was YES. Maximal size of possible extension queue 1114. Compared 62227 event pairs, 0 based on Foata normal form. 762/6112 useless extension candidates. Maximal degree in co-relation 36949. Up to 2669 conditions per place. [2021-10-29 00:01:33,343 INFO L132 encePairwiseOnDemand]: 117/128 looper letters, 22 selfloop transitions, 63 changer transitions 27/223 dead transitions. [2021-10-29 00:01:33,344 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 223 transitions, 1817 flow [2021-10-29 00:01:33,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-10-29 00:01:33,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2021-10-29 00:01:33,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2229 transitions. [2021-10-29 00:01:33,351 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9165296052631579 [2021-10-29 00:01:33,351 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 2229 transitions. [2021-10-29 00:01:33,352 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 2229 transitions. [2021-10-29 00:01:33,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-29 00:01:33,486 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 2229 transitions. [2021-10-29 00:01:33,492 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 117.3157894736842) internal successors, (2229), 19 states have internal predecessors, (2229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:01:33,499 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 128.0) internal successors, (2560), 20 states have internal predecessors, (2560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:01:33,501 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 128.0) internal successors, (2560), 20 states have internal predecessors, (2560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:01:33,502 INFO L186 Difference]: Start difference. First operand has 215 places, 191 transitions, 1315 flow. Second operand 19 states and 2229 transitions. [2021-10-29 00:01:33,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 223 transitions, 1817 flow [2021-10-29 00:01:36,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 223 transitions, 1335 flow, removed 183 selfloop flow, removed 32 redundant places. [2021-10-29 00:01:36,282 INFO L242 Difference]: Finished difference. Result has 202 places, 186 transitions, 1041 flow [2021-10-29 00:01:36,283 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=874, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1041, PETRI_PLACES=202, PETRI_TRANSITIONS=186} [2021-10-29 00:01:36,283 INFO L334 CegarLoopForPetriNet]: 135 programPoint places, 67 predicate places. [2021-10-29 00:01:36,283 INFO L470 AbstractCegarLoop]: Abstraction has has 202 places, 186 transitions, 1041 flow [2021-10-29 00:01:36,284 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 114.11111111111111) internal successors, (1027), 9 states have internal predecessors, (1027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:01:36,284 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-29 00:01:36,284 INFO L254 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 00:01:36,285 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-29 00:01:36,285 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-29 00:01:36,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 00:01:36,286 INFO L85 PathProgramCache]: Analyzing trace with hash -140488518, now seen corresponding path program 1 times [2021-10-29 00:01:36,286 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-29 00:01:36,286 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830620182] [2021-10-29 00:01:36,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 00:01:36,287 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 00:01:36,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:01:36,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 00:01:36,469 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-29 00:01:36,469 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830620182] [2021-10-29 00:01:36,470 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830620182] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 00:01:36,470 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 00:01:36,470 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-29 00:01:36,470 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012069518] [2021-10-29 00:01:36,471 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-29 00:01:36,472 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-29 00:01:36,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-29 00:01:36,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-29 00:01:36,475 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 128 [2021-10-29 00:01:36,476 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 186 transitions, 1041 flow. Second operand has 7 states, 7 states have (on average 115.42857142857143) internal successors, (808), 7 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:01:36,477 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-29 00:01:36,477 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 128 [2021-10-29 00:01:36,477 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-29 00:01:38,291 INFO L129 PetriNetUnfolder]: 3587/9517 cut-off events. [2021-10-29 00:01:38,291 INFO L130 PetriNetUnfolder]: For 27781/31005 co-relation queries the response was YES. [2021-10-29 00:01:38,433 INFO L84 FinitePrefix]: Finished finitePrefix Result has 32405 conditions, 9517 events. 3587/9517 cut-off events. For 27781/31005 co-relation queries the response was YES. Maximal size of possible extension queue 1508. Compared 116204 event pairs, 0 based on Foata normal form. 2/8331 useless extension candidates. Maximal degree in co-relation 32315. Up to 1204 conditions per place. [2021-10-29 00:01:38,442 INFO L132 encePairwiseOnDemand]: 122/128 looper letters, 9 selfloop transitions, 1 changer transitions 20/191 dead transitions. [2021-10-29 00:01:38,442 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 191 transitions, 1087 flow [2021-10-29 00:01:38,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-29 00:01:38,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-10-29 00:01:38,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 814 transitions. [2021-10-29 00:01:38,446 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9084821428571429 [2021-10-29 00:01:38,446 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 814 transitions. [2021-10-29 00:01:38,446 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 814 transitions. [2021-10-29 00:01:38,447 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-29 00:01:38,447 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 814 transitions. [2021-10-29 00:01:38,450 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 116.28571428571429) internal successors, (814), 7 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:01:38,453 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 128.0) internal successors, (1024), 8 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:01:38,453 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 128.0) internal successors, (1024), 8 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:01:38,454 INFO L186 Difference]: Start difference. First operand has 202 places, 186 transitions, 1041 flow. Second operand 7 states and 814 transitions. [2021-10-29 00:01:38,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 191 transitions, 1087 flow [2021-10-29 00:01:40,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 191 transitions, 954 flow, removed 9 selfloop flow, removed 17 redundant places. [2021-10-29 00:01:40,994 INFO L242 Difference]: Finished difference. Result has 193 places, 171 transitions, 832 flow [2021-10-29 00:01:40,995 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=910, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=832, PETRI_PLACES=193, PETRI_TRANSITIONS=171} [2021-10-29 00:01:40,995 INFO L334 CegarLoopForPetriNet]: 135 programPoint places, 58 predicate places. [2021-10-29 00:01:40,995 INFO L470 AbstractCegarLoop]: Abstraction has has 193 places, 171 transitions, 832 flow [2021-10-29 00:01:40,996 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 115.42857142857143) internal successors, (808), 7 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:01:40,996 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-29 00:01:40,996 INFO L254 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 00:01:40,997 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-29 00:01:40,997 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-29 00:01:40,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 00:01:40,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1366417620, now seen corresponding path program 2 times [2021-10-29 00:01:40,998 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-29 00:01:40,998 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866488705] [2021-10-29 00:01:40,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 00:01:40,999 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 00:01:41,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-29 00:01:41,055 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-29 00:01:41,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-29 00:01:41,209 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-29 00:01:41,209 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-10-29 00:01:41,211 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 00:01:41,213 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 00:01:41,214 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION [2021-10-29 00:01:41,214 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION [2021-10-29 00:01:41,214 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION [2021-10-29 00:01:41,214 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATION [2021-10-29 00:01:41,214 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 00:01:41,215 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-29 00:01:41,222 INFO L731 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 00:01:41,229 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-10-29 00:01:41,229 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-29 00:01:41,494 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.10 12:01:41 BasicIcfg [2021-10-29 00:01:41,495 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-29 00:01:41,496 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-29 00:01:41,496 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-29 00:01:41,496 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-29 00:01:41,497 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 12:01:09" (3/4) ... [2021-10-29 00:01:41,501 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-29 00:01:41,762 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c679fc7-e413-49c4-92be-c9cee6359f7e/bin/uautomizer-GMMbpWq8iD/witness.graphml [2021-10-29 00:01:41,763 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-29 00:01:41,765 INFO L168 Benchmark]: Toolchain (without parser) took 35680.90 ms. Allocated memory was 90.2 MB in the beginning and 6.8 GB in the end (delta: 6.7 GB). Free memory was 67.6 MB in the beginning and 6.1 GB in the end (delta: -6.1 GB). Peak memory consumption was 612.1 MB. Max. memory is 16.1 GB. [2021-10-29 00:01:41,765 INFO L168 Benchmark]: CDTParser took 0.34 ms. Allocated memory is still 90.2 MB. Free memory was 64.8 MB in the beginning and 64.8 MB in the end (delta: 41.9 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-29 00:01:41,769 INFO L168 Benchmark]: CACSL2BoogieTranslator took 804.26 ms. Allocated memory is still 90.2 MB. Free memory was 67.4 MB in the beginning and 50.5 MB in the end (delta: 16.9 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. [2021-10-29 00:01:41,770 INFO L168 Benchmark]: Boogie Procedure Inliner took 91.27 ms. Allocated memory is still 90.2 MB. Free memory was 50.5 MB in the beginning and 47.4 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-29 00:01:41,770 INFO L168 Benchmark]: Boogie Preprocessor took 72.34 ms. Allocated memory is still 90.2 MB. Free memory was 47.4 MB in the beginning and 45.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-29 00:01:41,771 INFO L168 Benchmark]: RCFGBuilder took 2550.53 ms. Allocated memory was 90.2 MB in the beginning and 109.1 MB in the end (delta: 18.9 MB). Free memory was 45.1 MB in the beginning and 38.7 MB in the end (delta: 6.4 MB). Peak memory consumption was 30.5 MB. Max. memory is 16.1 GB. [2021-10-29 00:01:41,771 INFO L168 Benchmark]: TraceAbstraction took 31882.38 ms. Allocated memory was 109.1 MB in the beginning and 6.8 GB in the end (delta: 6.7 GB). Free memory was 38.0 MB in the beginning and 6.2 GB in the end (delta: -6.1 GB). Peak memory consumption was 523.2 MB. Max. memory is 16.1 GB. [2021-10-29 00:01:41,772 INFO L168 Benchmark]: Witness Printer took 267.11 ms. Allocated memory is still 6.8 GB. Free memory was 6.2 GB in the beginning and 6.1 GB in the end (delta: 42.1 MB). Peak memory consumption was 41.9 MB. Max. memory is 16.1 GB. [2021-10-29 00:01:41,775 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.34 ms. Allocated memory is still 90.2 MB. Free memory was 64.8 MB in the beginning and 64.8 MB in the end (delta: 41.9 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 804.26 ms. Allocated memory is still 90.2 MB. Free memory was 67.4 MB in the beginning and 50.5 MB in the end (delta: 16.9 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 91.27 ms. Allocated memory is still 90.2 MB. Free memory was 50.5 MB in the beginning and 47.4 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 72.34 ms. Allocated memory is still 90.2 MB. Free memory was 47.4 MB in the beginning and 45.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2550.53 ms. Allocated memory was 90.2 MB in the beginning and 109.1 MB in the end (delta: 18.9 MB). Free memory was 45.1 MB in the beginning and 38.7 MB in the end (delta: 6.4 MB). Peak memory consumption was 30.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 31882.38 ms. Allocated memory was 109.1 MB in the beginning and 6.8 GB in the end (delta: 6.7 GB). Free memory was 38.0 MB in the beginning and 6.2 GB in the end (delta: -6.1 GB). Peak memory consumption was 523.2 MB. Max. memory is 16.1 GB. * Witness Printer took 267.11 ms. Allocated memory is still 6.8 GB. Free memory was 6.2 GB in the beginning and 6.1 GB in the end (delta: 42.1 MB). Peak memory consumption was 41.9 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0] [L714] 0 int __unbuffered_p3_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0] [L716] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0] [L718] 0 int b = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0] [L719] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0] [L720] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0] [L722] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L724] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L726] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L727] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L728] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L729] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L730] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L731] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L732] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0] [L733] 0 _Bool z$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0] [L734] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0] [L735] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L736] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L737] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L738] 0 _Bool z$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0] [L739] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0] [L740] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L741] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L742] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L743] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L744] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L745] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L746] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L844] 0 pthread_t t1253; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L845] FCALL, FORK 0 pthread_create(&t1253, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] 0 pthread_t t1254; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] FCALL, FORK 0 pthread_create(&t1254, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L848] 0 pthread_t t1255; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L849] FCALL, FORK 0 pthread_create(&t1255, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L850] 0 pthread_t t1256; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L851] FCALL, FORK 0 pthread_create(&t1256, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L800] 4 z$w_buff1 = z$w_buff0 [L801] 4 z$w_buff0 = 2 [L802] 4 z$w_buff1_used = z$w_buff0_used [L803] 4 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 4 !(!expression) [L805] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L806] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L807] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L808] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L809] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L810] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L813] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L816] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L819] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L750] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L765] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L783] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L786] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L786] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L786] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L786] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L787] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L787] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L788] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L788] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L789] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L789] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L790] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L790] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L822] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L822] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L823] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L823] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L824] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L824] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L825] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L825] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L826] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L826] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L773] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L793] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L829] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L853] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L857] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L857] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L857] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L857] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L858] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L858] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L859] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L859] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L860] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L860] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L861] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L861] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L864] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L865] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L866] 0 z$flush_delayed = weak$$choice2 [L867] 0 z$mem_tmp = z [L868] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L868] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L869] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L869] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L870] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L870] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L871] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L871] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L872] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L872] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L873] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L873] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L874] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L874] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L876] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L876] 0 z = z$flush_delayed ? z$mem_tmp : z [L877] 0 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=53, weak$$choice2=255, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=53, weak$$choice2=255, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] 0 reach_error() VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=53, weak$$choice2=255, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 845]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 164 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 31.3s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 25.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 154 SDtfs, 539 SDslu, 623 SDs, 0 SdLazy, 1079 SolverSat, 303 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 243 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1315occurred in iteration=15, InterpolantAutomatonStates: 192, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 1584 NumberOfCodeBlocks, 1584 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1468 ConstructedInterpolants, 0 QuantifiedInterpolants, 6659 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-10-29 00:01:41,848 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c679fc7-e413-49c4-92be-c9cee6359f7e/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...