./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c --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_8f8bbcb0-8bc5-497e-a1ef-8602b3236d8c/bin/ukojak-Rh5K9KB4LI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f8bbcb0-8bc5-497e-a1ef-8602b3236d8c/bin/ukojak-Rh5K9KB4LI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f8bbcb0-8bc5-497e-a1ef-8602b3236d8c/bin/ukojak-Rh5K9KB4LI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f8bbcb0-8bc5-497e-a1ef-8602b3236d8c/bin/ukojak-Rh5K9KB4LI/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f8bbcb0-8bc5-497e-a1ef-8602b3236d8c/bin/ukojak-Rh5K9KB4LI/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f8bbcb0-8bc5-497e-a1ef-8602b3236d8c/bin/ukojak-Rh5K9KB4LI --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 Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 205f0e0aff0d53187144e7eaaf7c9176a7ca6bc04dd0065235effeefd306421c .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 03:50:41,509 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-29 03:50:41,512 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-29 03:50:41,569 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-29 03:50:41,570 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-29 03:50:41,575 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-29 03:50:41,577 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-29 03:50:41,581 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-29 03:50:41,583 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-29 03:50:41,590 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-29 03:50:41,591 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-29 03:50:41,593 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-29 03:50:41,594 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-29 03:50:41,596 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-29 03:50:41,599 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-29 03:50:41,605 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-29 03:50:41,607 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-29 03:50:41,609 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-29 03:50:41,611 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-29 03:50:41,620 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-29 03:50:41,622 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-29 03:50:41,623 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-29 03:50:41,627 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-29 03:50:41,628 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-29 03:50:41,638 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-29 03:50:41,639 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-29 03:50:41,639 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-29 03:50:41,641 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-29 03:50:41,642 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-29 03:50:41,644 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-29 03:50:41,644 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-29 03:50:41,645 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-29 03:50:41,648 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-29 03:50:41,649 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-29 03:50:41,651 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-29 03:50:41,651 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-29 03:50:41,652 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-29 03:50:41,653 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-29 03:50:41,653 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-29 03:50:41,654 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-29 03:50:41,655 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-29 03:50:41,656 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f8bbcb0-8bc5-497e-a1ef-8602b3236d8c/bin/ukojak-Rh5K9KB4LI/config/svcomp-Reach-32bit-Kojak_Default.epf [2021-10-29 03:50:41,708 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-29 03:50:41,708 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-29 03:50:41,710 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-29 03:50:41,711 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2021-10-29 03:50:41,712 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-29 03:50:41,712 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-29 03:50:41,712 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-29 03:50:41,712 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-29 03:50:41,713 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-29 03:50:41,713 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-29 03:50:41,714 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-29 03:50:41,715 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-29 03:50:41,715 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-29 03:50:41,715 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-29 03:50:41,715 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-29 03:50:41,715 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-29 03:50:41,716 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-29 03:50:41,716 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-29 03:50:41,716 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2021-10-29 03:50:41,716 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2021-10-29 03:50:41,717 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-29 03:50:41,717 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2021-10-29 03:50:41,717 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-29 03:50:41,717 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-29 03:50:41,718 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-29 03:50:41,718 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2021-10-29 03:50:41,718 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-29 03:50:41,718 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-29 03:50:41,719 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_8f8bbcb0-8bc5-497e-a1ef-8602b3236d8c/bin/ukojak-Rh5K9KB4LI/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_8f8bbcb0-8bc5-497e-a1ef-8602b3236d8c/bin/ukojak-Rh5K9KB4LI 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 -> Kojak 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 -> 205f0e0aff0d53187144e7eaaf7c9176a7ca6bc04dd0065235effeefd306421c [2021-10-29 03:50:42,000 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-29 03:50:42,025 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-29 03:50:42,028 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-29 03:50:42,029 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-29 03:50:42,030 INFO L275 PluginConnector]: CDTParser initialized [2021-10-29 03:50:42,032 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f8bbcb0-8bc5-497e-a1ef-8602b3236d8c/bin/ukojak-Rh5K9KB4LI/../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c [2021-10-29 03:50:42,116 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f8bbcb0-8bc5-497e-a1ef-8602b3236d8c/bin/ukojak-Rh5K9KB4LI/data/fd538a5ee/293207eaab704a35b85cfa1ddd3e0523/FLAGccae88b61 [2021-10-29 03:50:42,627 INFO L306 CDTParser]: Found 1 translation units. [2021-10-29 03:50:42,627 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f8bbcb0-8bc5-497e-a1ef-8602b3236d8c/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c [2021-10-29 03:50:42,647 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f8bbcb0-8bc5-497e-a1ef-8602b3236d8c/bin/ukojak-Rh5K9KB4LI/data/fd538a5ee/293207eaab704a35b85cfa1ddd3e0523/FLAGccae88b61 [2021-10-29 03:50:42,960 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f8bbcb0-8bc5-497e-a1ef-8602b3236d8c/bin/ukojak-Rh5K9KB4LI/data/fd538a5ee/293207eaab704a35b85cfa1ddd3e0523 [2021-10-29 03:50:42,962 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-29 03:50:42,964 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-29 03:50:42,965 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-29 03:50:42,966 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-29 03:50:42,969 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-29 03:50:42,970 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 03:50:42" (1/1) ... [2021-10-29 03:50:42,971 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4dbafae8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:50:42, skipping insertion in model container [2021-10-29 03:50:42,971 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 03:50:42" (1/1) ... [2021-10-29 03:50:42,978 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-29 03:50:43,017 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-29 03:50:43,279 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_8f8bbcb0-8bc5-497e-a1ef-8602b3236d8c/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c[14511,14524] [2021-10-29 03:50:43,283 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-29 03:50:43,297 INFO L203 MainTranslator]: Completed pre-run [2021-10-29 03:50:43,373 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_8f8bbcb0-8bc5-497e-a1ef-8602b3236d8c/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c[14511,14524] [2021-10-29 03:50:43,373 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-29 03:50:43,392 INFO L208 MainTranslator]: Completed translation [2021-10-29 03:50:43,392 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:50:43 WrapperNode [2021-10-29 03:50:43,392 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-29 03:50:43,393 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-29 03:50:43,393 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-29 03:50:43,393 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-29 03:50:43,401 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:50:43" (1/1) ... [2021-10-29 03:50:43,421 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:50:43" (1/1) ... [2021-10-29 03:50:43,471 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-29 03:50:43,472 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-29 03:50:43,472 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-29 03:50:43,472 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-29 03:50:43,481 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:50:43" (1/1) ... [2021-10-29 03:50:43,482 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:50:43" (1/1) ... [2021-10-29 03:50:43,487 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:50:43" (1/1) ... [2021-10-29 03:50:43,487 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:50:43" (1/1) ... [2021-10-29 03:50:43,499 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:50:43" (1/1) ... [2021-10-29 03:50:43,508 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:50:43" (1/1) ... [2021-10-29 03:50:43,512 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:50:43" (1/1) ... [2021-10-29 03:50:43,521 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-29 03:50:43,522 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-29 03:50:43,522 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-29 03:50:43,522 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-29 03:50:43,523 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:50:43" (1/1) ... [2021-10-29 03:50:43,531 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2021-10-29 03:50:43,549 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f8bbcb0-8bc5-497e-a1ef-8602b3236d8c/bin/ukojak-Rh5K9KB4LI/z3 [2021-10-29 03:50:43,560 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f8bbcb0-8bc5-497e-a1ef-8602b3236d8c/bin/ukojak-Rh5K9KB4LI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2021-10-29 03:50:43,562 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f8bbcb0-8bc5-497e-a1ef-8602b3236d8c/bin/ukojak-Rh5K9KB4LI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2021-10-29 03:50:43,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-29 03:50:43,599 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-29 03:50:43,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-29 03:50:43,599 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-29 03:50:46,547 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-29 03:50:46,547 INFO L299 CfgBuilder]: Removed 19 assume(true) statements. [2021-10-29 03:50:46,549 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 03:50:46 BoogieIcfgContainer [2021-10-29 03:50:46,550 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-29 03:50:46,551 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2021-10-29 03:50:46,551 INFO L271 PluginConnector]: Initializing CodeCheck... [2021-10-29 03:50:46,561 INFO L275 PluginConnector]: CodeCheck initialized [2021-10-29 03:50:46,561 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 03:50:46" (1/1) ... [2021-10-29 03:50:46,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 03:50:46,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:50:46,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 18 states and 29 transitions. [2021-10-29 03:50:46,607 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 29 transitions. [2021-10-29 03:50:46,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-10-29 03:50:46,610 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:50:46,611 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:50:47,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:50:47,445 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 03:50:47,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:50:47,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 19 states and 31 transitions. [2021-10-29 03:50:47,544 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 31 transitions. [2021-10-29 03:50:47,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-10-29 03:50:47,545 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:50:47,545 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:50:47,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:50:47,902 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 03:50:48,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:50:48,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 22 states and 37 transitions. [2021-10-29 03:50:48,193 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 37 transitions. [2021-10-29 03:50:48,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-10-29 03:50:48,197 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:50:48,198 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:50:48,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:50:48,592 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 03:50:49,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:50:49,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 26 states and 45 transitions. [2021-10-29 03:50:49,049 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 45 transitions. [2021-10-29 03:50:49,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-29 03:50:49,050 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:50:49,050 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:50:49,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:50:49,354 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 03:50:50,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:50:50,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 31 states and 55 transitions. [2021-10-29 03:50:50,020 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 55 transitions. [2021-10-29 03:50:50,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-10-29 03:50:50,021 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:50:50,021 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:50:50,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:50:50,300 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 03:50:51,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:50:51,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 38 states and 67 transitions. [2021-10-29 03:50:51,191 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 67 transitions. [2021-10-29 03:50:51,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-10-29 03:50:51,191 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:50:51,192 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:50:51,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:50:51,506 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 03:50:52,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:50:52,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 44 states and 78 transitions. [2021-10-29 03:50:52,576 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 78 transitions. [2021-10-29 03:50:52,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-10-29 03:50:52,576 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:50:52,577 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:50:52,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:50:52,677 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 03:50:52,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:50:52,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 45 states and 78 transitions. [2021-10-29 03:50:52,885 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 78 transitions. [2021-10-29 03:50:52,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-10-29 03:50:52,885 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:50:52,886 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:50:52,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:50:52,980 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 03:50:52,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:50:52,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 46 states and 79 transitions. [2021-10-29 03:50:52,998 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 79 transitions. [2021-10-29 03:50:52,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-10-29 03:50:52,999 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:50:53,000 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:50:53,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:50:53,338 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 03:50:55,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:50:55,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 56 states and 95 transitions. [2021-10-29 03:50:55,009 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 95 transitions. [2021-10-29 03:50:55,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-10-29 03:50:55,010 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:50:55,010 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:50:55,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:50:55,191 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 03:50:55,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:50:55,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 59 states and 107 transitions. [2021-10-29 03:50:55,425 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 107 transitions. [2021-10-29 03:50:55,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-29 03:50:55,428 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:50:55,428 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:50:55,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:50:56,331 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:51:00,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:51:00,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 74 states and 137 transitions. [2021-10-29 03:51:00,203 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 137 transitions. [2021-10-29 03:51:00,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-10-29 03:51:00,205 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:51:00,205 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:51:00,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:51:00,923 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:51:04,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:51:04,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 87 states and 162 transitions. [2021-10-29 03:51:04,501 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 162 transitions. [2021-10-29 03:51:04,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-10-29 03:51:04,503 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:51:04,503 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:51:04,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:51:05,006 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:51:05,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:51:05,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 88 states and 165 transitions. [2021-10-29 03:51:05,467 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 165 transitions. [2021-10-29 03:51:05,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-29 03:51:05,469 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:51:05,469 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:51:05,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:51:06,530 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:51:11,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:51:11,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 105 states and 198 transitions. [2021-10-29 03:51:11,770 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 198 transitions. [2021-10-29 03:51:11,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-29 03:51:11,772 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:51:11,772 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:51:12,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:51:12,225 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:51:12,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:51:12,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 106 states and 202 transitions. [2021-10-29 03:51:12,635 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 202 transitions. [2021-10-29 03:51:12,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-29 03:51:12,637 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:51:12,637 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:51:12,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:51:13,023 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:51:13,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:51:13,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 107 states and 203 transitions. [2021-10-29 03:51:13,442 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 203 transitions. [2021-10-29 03:51:13,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-29 03:51:13,450 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:51:13,451 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:51:13,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:51:14,202 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:51:19,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:51:19,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 125 states and 238 transitions. [2021-10-29 03:51:19,733 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 238 transitions. [2021-10-29 03:51:19,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-29 03:51:19,734 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:51:19,736 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:51:20,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:51:20,128 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:51:21,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:51:21,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 127 states and 246 transitions. [2021-10-29 03:51:21,183 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 246 transitions. [2021-10-29 03:51:21,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-29 03:51:21,184 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:51:21,184 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:51:21,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:51:21,476 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:51:21,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:51:21,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 128 states and 250 transitions. [2021-10-29 03:51:21,982 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 250 transitions. [2021-10-29 03:51:21,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-29 03:51:21,983 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:51:21,983 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:51:22,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:51:22,286 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:51:23,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:51:23,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 130 states and 252 transitions. [2021-10-29 03:51:23,066 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 252 transitions. [2021-10-29 03:51:23,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-29 03:51:23,067 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:51:23,067 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:51:23,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:51:24,489 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:51:32,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:51:32,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 149 states and 282 transitions. [2021-10-29 03:51:32,039 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 282 transitions. [2021-10-29 03:51:32,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-29 03:51:32,040 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:51:32,040 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:51:32,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:51:32,616 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:51:34,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:51:34,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 152 states and 294 transitions. [2021-10-29 03:51:34,831 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 294 transitions. [2021-10-29 03:51:34,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-29 03:51:34,833 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:51:34,833 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:51:35,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:51:35,466 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:51:36,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:51:36,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 153 states and 295 transitions. [2021-10-29 03:51:36,169 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 295 transitions. [2021-10-29 03:51:36,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-29 03:51:36,169 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:51:36,170 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:51:36,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:51:36,791 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:51:37,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:51:37,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 154 states and 296 transitions. [2021-10-29 03:51:37,494 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 296 transitions. [2021-10-29 03:51:37,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-29 03:51:37,495 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:51:37,495 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:51:37,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:51:37,868 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:51:39,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:51:39,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 159 states and 305 transitions. [2021-10-29 03:51:39,965 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 305 transitions. [2021-10-29 03:51:39,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-29 03:51:39,965 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:51:39,966 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:51:40,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:51:40,369 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:51:42,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:51:42,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 163 states and 313 transitions. [2021-10-29 03:51:42,625 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 313 transitions. [2021-10-29 03:51:42,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-29 03:51:42,625 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:51:42,626 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:51:42,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:51:43,012 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:51:43,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:51:43,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 164 states and 314 transitions. [2021-10-29 03:51:43,533 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 314 transitions. [2021-10-29 03:51:43,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-10-29 03:51:43,534 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:51:43,534 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:51:43,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:51:44,589 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:51:50,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:51:50,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 180 states and 343 transitions. [2021-10-29 03:51:50,741 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 343 transitions. [2021-10-29 03:51:50,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-10-29 03:51:50,742 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:51:50,742 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:51:51,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:51:51,251 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:51:52,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:51:52,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 183 states and 355 transitions. [2021-10-29 03:51:52,733 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 355 transitions. [2021-10-29 03:51:52,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-10-29 03:51:52,734 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:51:52,734 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:51:53,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:51:53,255 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:51:53,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:51:53,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 184 states and 356 transitions. [2021-10-29 03:51:53,865 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 356 transitions. [2021-10-29 03:51:53,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-10-29 03:51:53,866 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:51:53,866 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:51:54,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:51:54,463 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:51:55,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:51:55,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 185 states and 357 transitions. [2021-10-29 03:51:55,126 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 357 transitions. [2021-10-29 03:51:55,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-10-29 03:51:55,126 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:51:55,127 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:51:55,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:51:56,408 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:52:03,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:52:03,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 197 states and 391 transitions. [2021-10-29 03:52:03,223 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 391 transitions. [2021-10-29 03:52:03,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-10-29 03:52:03,224 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:52:03,224 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:52:03,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:52:03,726 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:52:05,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:52:05,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 200 states and 404 transitions. [2021-10-29 03:52:05,188 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 404 transitions. [2021-10-29 03:52:05,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-10-29 03:52:05,189 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:52:05,189 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:52:05,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:52:05,752 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:52:07,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:52:07,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 202 states and 407 transitions. [2021-10-29 03:52:07,134 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 407 transitions. [2021-10-29 03:52:07,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-10-29 03:52:07,135 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:52:07,135 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:52:07,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:52:07,574 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:52:09,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:52:09,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 204 states and 409 transitions. [2021-10-29 03:52:09,158 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 409 transitions. [2021-10-29 03:52:09,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-10-29 03:52:09,159 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:52:09,159 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:52:09,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:52:09,633 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:52:10,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:52:10,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 205 states and 410 transitions. [2021-10-29 03:52:10,563 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 410 transitions. [2021-10-29 03:52:10,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-10-29 03:52:10,565 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:52:10,566 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:52:10,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:52:11,972 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:52:18,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:52:18,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 215 states and 432 transitions. [2021-10-29 03:52:18,272 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 432 transitions. [2021-10-29 03:52:18,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-10-29 03:52:18,273 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:52:18,273 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:52:18,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:52:18,714 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:52:20,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:52:20,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 217 states and 435 transitions. [2021-10-29 03:52:20,549 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 435 transitions. [2021-10-29 03:52:20,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-10-29 03:52:20,550 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:52:20,550 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:52:20,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:52:20,811 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:52:21,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:52:21,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 215 states and 431 transitions. [2021-10-29 03:52:21,559 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 431 transitions. [2021-10-29 03:52:21,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-10-29 03:52:21,559 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:52:21,560 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:52:21,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:52:21,946 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:52:23,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:52:23,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 208 states and 422 transitions. [2021-10-29 03:52:23,026 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 422 transitions. [2021-10-29 03:52:23,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-10-29 03:52:23,027 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:52:23,027 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:52:23,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:52:24,225 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:52:30,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:52:30,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 218 states and 442 transitions. [2021-10-29 03:52:30,630 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 442 transitions. [2021-10-29 03:52:30,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-10-29 03:52:30,631 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:52:30,631 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:52:30,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:52:31,015 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:52:33,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:52:33,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 219 states and 448 transitions. [2021-10-29 03:52:33,476 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 448 transitions. [2021-10-29 03:52:33,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-10-29 03:52:33,477 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:52:33,478 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:52:33,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:52:33,896 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:52:34,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:52:34,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 213 states and 441 transitions. [2021-10-29 03:52:34,550 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 441 transitions. [2021-10-29 03:52:34,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-10-29 03:52:34,551 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:52:34,551 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:52:34,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:52:36,200 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:52:42,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:52:42,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 222 states and 461 transitions. [2021-10-29 03:52:42,529 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 461 transitions. [2021-10-29 03:52:42,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-10-29 03:52:42,530 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:52:42,530 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:52:42,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:52:42,929 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:52:43,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:52:43,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 223 states and 466 transitions. [2021-10-29 03:52:43,741 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 466 transitions. [2021-10-29 03:52:43,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-10-29 03:52:43,742 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:52:43,742 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:52:44,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:52:44,112 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:52:44,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:52:44,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 224 states and 469 transitions. [2021-10-29 03:52:44,857 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 469 transitions. [2021-10-29 03:52:44,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-10-29 03:52:44,858 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:52:44,858 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:52:45,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:52:45,197 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:52:46,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:52:46,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 219 states and 463 transitions. [2021-10-29 03:52:46,137 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 463 transitions. [2021-10-29 03:52:46,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-29 03:52:46,233 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:52:46,233 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:52:46,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:52:46,792 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:52:51,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:52:51,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 224 states and 480 transitions. [2021-10-29 03:52:51,608 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 480 transitions. [2021-10-29 03:52:51,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-29 03:52:51,609 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:52:51,609 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:52:51,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:52:52,036 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:52:53,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:52:53,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 227 states and 490 transitions. [2021-10-29 03:52:53,949 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 490 transitions. [2021-10-29 03:52:53,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-29 03:52:53,950 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:52:53,950 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:52:54,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:52:54,281 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:52:55,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:52:55,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 228 states and 492 transitions. [2021-10-29 03:52:55,029 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 492 transitions. [2021-10-29 03:52:55,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-29 03:52:55,030 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:52:55,030 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:52:55,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:52:55,627 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:52:58,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:52:58,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 231 states and 499 transitions. [2021-10-29 03:52:58,334 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 499 transitions. [2021-10-29 03:52:58,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-29 03:52:58,335 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:52:58,335 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:52:58,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:52:58,797 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:52:59,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:52:59,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 232 states and 503 transitions. [2021-10-29 03:52:59,910 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 503 transitions. [2021-10-29 03:52:59,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-29 03:52:59,910 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:52:59,910 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:53:00,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:53:00,277 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:53:01,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:53:01,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 235 states and 509 transitions. [2021-10-29 03:53:01,978 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 509 transitions. [2021-10-29 03:53:01,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-29 03:53:01,978 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:53:01,979 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:53:02,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:53:02,468 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:53:04,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:53:04,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 238 states and 516 transitions. [2021-10-29 03:53:04,064 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 516 transitions. [2021-10-29 03:53:04,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-29 03:53:04,064 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:53:04,065 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:53:04,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:53:04,869 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:53:07,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:53:07,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 239 states and 521 transitions. [2021-10-29 03:53:07,766 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 521 transitions. [2021-10-29 03:53:07,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-29 03:53:07,766 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:53:07,767 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:53:08,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:53:08,178 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:53:08,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:53:08,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 240 states and 523 transitions. [2021-10-29 03:53:08,777 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 523 transitions. [2021-10-29 03:53:08,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-29 03:53:08,777 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:53:08,777 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:53:09,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:53:09,156 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:53:11,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:53:11,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 243 states and 532 transitions. [2021-10-29 03:53:11,134 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 532 transitions. [2021-10-29 03:53:11,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-29 03:53:11,135 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:53:11,135 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:53:11,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:53:11,527 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:53:13,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:53:13,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 246 states and 542 transitions. [2021-10-29 03:53:13,430 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 542 transitions. [2021-10-29 03:53:13,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-29 03:53:13,431 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:53:13,431 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:53:13,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:53:13,789 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:53:14,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:53:14,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 247 states and 543 transitions. [2021-10-29 03:53:14,373 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 543 transitions. [2021-10-29 03:53:14,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-10-29 03:53:14,374 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:53:14,374 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:53:15,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-29 03:53:15,566 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-29 03:53:16,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-29 03:53:16,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-29 03:53:16,932 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-29 03:53:17,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-29 03:53:17,762 WARN L480 CodeCheckObserver]: This program is UNSAFE, Check terminated with 60 iterations. [2021-10-29 03:53:18,049 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 29.10 03:53:18 ImpRootNode [2021-10-29 03:53:18,050 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2021-10-29 03:53:18,050 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-29 03:53:18,051 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-29 03:53:18,051 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-29 03:53:18,052 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 03:50:46" (3/4) ... [2021-10-29 03:53:18,054 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-29 03:53:18,313 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f8bbcb0-8bc5-497e-a1ef-8602b3236d8c/bin/ukojak-Rh5K9KB4LI/witness.graphml [2021-10-29 03:53:18,313 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-29 03:53:18,315 INFO L168 Benchmark]: Toolchain (without parser) took 155350.26 ms. Allocated memory was 88.1 MB in the beginning and 1.4 GB in the end (delta: 1.3 GB). Free memory was 53.0 MB in the beginning and 864.9 MB in the end (delta: -811.9 MB). Peak memory consumption was 508.7 MB. Max. memory is 16.1 GB. [2021-10-29 03:53:18,316 INFO L168 Benchmark]: CDTParser took 0.33 ms. Allocated memory is still 88.1 MB. Free memory was 60.3 MB in the beginning and 60.3 MB in the end (delta: 23.9 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-29 03:53:18,317 INFO L168 Benchmark]: CACSL2BoogieTranslator took 427.38 ms. Allocated memory was 88.1 MB in the beginning and 111.1 MB in the end (delta: 23.1 MB). Free memory was 52.7 MB in the beginning and 80.2 MB in the end (delta: -27.5 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-29 03:53:18,319 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.81 ms. Allocated memory is still 111.1 MB. Free memory was 80.2 MB in the beginning and 77.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-29 03:53:18,320 INFO L168 Benchmark]: Boogie Preprocessor took 49.34 ms. Allocated memory is still 111.1 MB. Free memory was 77.5 MB in the beginning and 74.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-29 03:53:18,320 INFO L168 Benchmark]: RCFGBuilder took 3028.05 ms. Allocated memory was 111.1 MB in the beginning and 140.5 MB in the end (delta: 29.4 MB). Free memory was 74.9 MB in the beginning and 101.8 MB in the end (delta: -26.8 MB). Peak memory consumption was 50.7 MB. Max. memory is 16.1 GB. [2021-10-29 03:53:18,321 INFO L168 Benchmark]: CodeCheck took 151499.18 ms. Allocated memory was 140.5 MB in the beginning and 1.4 GB in the end (delta: 1.3 GB). Free memory was 101.8 MB in the beginning and 886.9 MB in the end (delta: -785.1 MB). Peak memory consumption was 483.6 MB. Max. memory is 16.1 GB. [2021-10-29 03:53:18,321 INFO L168 Benchmark]: Witness Printer took 262.94 ms. Allocated memory is still 1.4 GB. Free memory was 886.9 MB in the beginning and 864.9 MB in the end (delta: 22.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. [2021-10-29 03:53:18,324 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 18 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 151.1s, OverallIterations: 60, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 SDtfs, -88028696 SDslu, 0 SDs, 0 SdLazy, -935675528 SolverSat, -1064440020 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 184.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 17744 GetRequests, 16056 SyntacticMatches, 802 SemanticMatches, 886 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 445017 ImplicationChecksByTransitivity, 116.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.3s SsaConstructionTime, 17.6s SatisfiabilityAnalysisTime, 14.4s InterpolantComputationTime, 1640 NumberOfCodeBlocks, 1640 NumberOfCodeBlocksAsserted, 60 NumberOfCheckSat, 1536 ConstructedInterpolants, 0 QuantifiedInterpolants, 15755 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 59 InterpolantComputations, 10 PerfectInterpolantSequences, 193/953 InterpolantCoveringCapability, 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: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 609]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L28] msg_t nomsg = (msg_t )-1; [L29] port_t p12 ; [L30] char p12_old ; [L31] char p12_new ; [L32] _Bool ep12 ; [L33] port_t p13 ; [L34] char p13_old ; [L35] char p13_new ; [L36] _Bool ep13 ; [L37] port_t p21 ; [L38] char p21_old ; [L39] char p21_new ; [L40] _Bool ep21 ; [L41] port_t p23 ; [L42] char p23_old ; [L43] char p23_new ; [L44] _Bool ep23 ; [L45] port_t p31 ; [L46] char p31_old ; [L47] char p31_new ; [L48] _Bool ep31 ; [L49] port_t p32 ; [L50] char p32_old ; [L51] char p32_new ; [L52] _Bool ep32 ; [L53] char id1 ; [L54] unsigned char r1 ; [L55] char st1 ; [L56] char nl1 ; [L57] char m1 ; [L58] char max1 ; [L59] _Bool mode1 ; [L60] _Bool newmax1 ; [L61] char id2 ; [L62] unsigned char r2 ; [L63] char st2 ; [L64] char nl2 ; [L65] char m2 ; [L66] char max2 ; [L67] _Bool mode2 ; [L68] _Bool newmax2 ; [L69] char id3 ; [L70] unsigned char r3 ; [L71] char st3 ; [L72] char nl3 ; [L73] char m3 ; [L74] char max3 ; [L75] _Bool mode3 ; [L76] _Bool newmax3 ; [L528] int c1 ; [L529] int i2 ; [L532] c1 = 0 [L533] ep12 = __VERIFIER_nondet_bool() [L534] ep13 = __VERIFIER_nondet_bool() [L535] ep21 = __VERIFIER_nondet_bool() [L536] ep23 = __VERIFIER_nondet_bool() [L537] ep31 = __VERIFIER_nondet_bool() [L538] ep32 = __VERIFIER_nondet_bool() [L539] id1 = __VERIFIER_nondet_char() [L540] r1 = __VERIFIER_nondet_uchar() [L541] st1 = __VERIFIER_nondet_char() [L542] nl1 = __VERIFIER_nondet_char() [L543] m1 = __VERIFIER_nondet_char() [L544] max1 = __VERIFIER_nondet_char() [L545] mode1 = __VERIFIER_nondet_bool() [L546] newmax1 = __VERIFIER_nondet_bool() [L547] id2 = __VERIFIER_nondet_char() [L548] r2 = __VERIFIER_nondet_uchar() [L549] st2 = __VERIFIER_nondet_char() [L550] nl2 = __VERIFIER_nondet_char() [L551] m2 = __VERIFIER_nondet_char() [L552] max2 = __VERIFIER_nondet_char() [L553] mode2 = __VERIFIER_nondet_bool() [L554] newmax2 = __VERIFIER_nondet_bool() [L555] id3 = __VERIFIER_nondet_char() [L556] r3 = __VERIFIER_nondet_uchar() [L557] st3 = __VERIFIER_nondet_char() [L558] nl3 = __VERIFIER_nondet_char() [L559] m3 = __VERIFIER_nondet_char() [L560] max3 = __VERIFIER_nondet_char() [L561] mode3 = __VERIFIER_nondet_bool() [L562] newmax3 = __VERIFIER_nondet_bool() [L241] _Bool r121 ; [L242] _Bool r131 ; [L243] _Bool r211 ; [L244] _Bool r231 ; [L245] _Bool r311 ; [L246] _Bool r321 ; [L247] _Bool r122 ; [L248] int tmp ; [L249] _Bool r132 ; [L250] int tmp___0 ; [L251] _Bool r212 ; [L252] int tmp___1 ; [L253] _Bool r232 ; [L254] int tmp___2 ; [L255] _Bool r312 ; [L256] int tmp___3 ; [L257] _Bool r322 ; [L258] int tmp___4 ; [L259] int tmp___5 ; [L262] r121 = ep12 [L263] r131 = ep13 [L264] r211 = ep21 [L265] r231 = ep23 [L266] r311 = ep31 [L267] r321 = ep32 [L268] COND FALSE !(\read(r121)) [L271] COND TRUE \read(r131) [L272] COND TRUE \read(ep32) [L273] tmp = 1 [L280] r122 = (_Bool )tmp [L281] COND TRUE \read(r131) [L282] tmp___0 = 1 [L293] r132 = (_Bool )tmp___0 [L294] COND TRUE \read(r211) [L295] tmp___1 = 1 [L306] r212 = (_Bool )tmp___1 [L307] COND FALSE !(\read(r231)) [L310] COND TRUE \read(r211) [L311] COND TRUE \read(ep13) [L312] tmp___2 = 1 [L319] r232 = (_Bool )tmp___2 [L320] COND FALSE !(\read(r311)) [L323] COND TRUE \read(r321) [L324] COND TRUE \read(ep21) [L325] tmp___3 = 1 [L332] r312 = (_Bool )tmp___3 [L333] COND TRUE \read(r321) [L334] tmp___4 = 1 [L345] r322 = (_Bool )tmp___4 [L346] COND TRUE (int )id1 != (int )id2 [L347] COND TRUE (int )id1 != (int )id3 [L348] COND TRUE (int )id2 != (int )id3 [L349] COND TRUE (int )id1 >= 0 [L350] COND TRUE (int )id2 >= 0 [L351] COND TRUE (int )id3 >= 0 [L352] COND TRUE (int )r1 == 0 [L353] COND TRUE (int )r2 == 0 [L354] COND TRUE (int )r3 == 0 [L355] COND TRUE \read(r122) [L356] COND TRUE \read(r132) [L357] COND TRUE \read(r212) [L358] COND TRUE \read(r232) [L359] COND TRUE \read(r312) [L360] COND TRUE \read(r322) [L361] COND TRUE (int )max1 == (int )id1 [L362] COND TRUE (int )max2 == (int )id2 [L363] COND TRUE (int )max3 == (int )id3 [L364] COND TRUE (int )st1 == 0 [L365] COND TRUE (int )st2 == 0 [L366] COND TRUE (int )st3 == 0 [L367] COND TRUE (int )nl1 == 0 [L368] COND TRUE (int )nl2 == 0 [L369] COND TRUE (int )nl3 == 0 [L370] COND TRUE (int )mode1 == 0 [L371] COND TRUE (int )mode2 == 0 [L372] COND TRUE (int )mode3 == 0 [L373] COND TRUE \read(newmax1) [L374] COND TRUE \read(newmax2) [L375] COND TRUE \read(newmax3) [L376] tmp___5 = 1 [L467] return (tmp___5); [L563] i2 = init() [L22] COND FALSE !(!cond) [L565] p12_old = nomsg [L566] p12_new = nomsg [L567] p13_old = nomsg [L568] p13_new = nomsg [L569] p21_old = nomsg [L570] p21_new = nomsg [L571] p23_old = nomsg [L572] p23_new = nomsg [L573] p31_old = nomsg [L574] p31_new = nomsg [L575] p32_old = nomsg [L576] p32_new = nomsg [L577] i2 = 0 VAL [ep12=0, ep13=255, ep21=255, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=-2, m2=3, m3=0, max1=1, max2=3, max3=2, mode1=0, mode2=0, mode3=0, newmax1=255, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L578] COND TRUE 1 [L79] _Bool newmax ; [L82] newmax = (_Bool)0 [L83] COND FALSE !(\read(mode1)) [L114] COND TRUE (int )r1 < 1 [L115] COND FALSE !(\read(ep12)) [L120] COND TRUE \read(ep13) [L121] COND TRUE \read(newmax1) [L122] EXPR max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L122] p13_new = max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L126] mode1 = (_Bool)1 [L133] _Bool newmax ; [L136] newmax = (_Bool)0 [L137] COND FALSE !(\read(mode2)) [L168] COND TRUE (int )r2 < 2 [L169] COND TRUE \read(ep21) [L170] COND TRUE \read(newmax2) [L171] EXPR max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L171] p21_new = max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L174] COND FALSE !(\read(ep23)) [L180] mode2 = (_Bool)1 [L187] _Bool newmax ; [L190] newmax = (_Bool)0 [L191] COND FALSE !(\read(mode3)) [L222] COND TRUE (int )r3 < 2 [L223] COND FALSE !(\read(ep31)) [L228] COND TRUE \read(ep32) [L229] COND TRUE \read(newmax3) [L230] EXPR max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L230] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L234] mode3 = (_Bool)1 [L583] p12_old = p12_new [L584] p12_new = nomsg [L585] p13_old = p13_new [L586] p13_new = nomsg [L587] p21_old = p21_new [L588] p21_new = nomsg [L589] p23_old = p23_new [L590] p23_new = nomsg [L591] p31_old = p31_new [L592] p31_new = nomsg [L593] p32_old = p32_new [L594] p32_new = nomsg [L472] int tmp ; VAL [ep12=0, ep13=255, ep21=255, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=-2, m2=3, m3=0, max1=1, max2=3, max3=2, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L475] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=255, ep21=255, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=-2, m2=3, m3=0, max1=1, max2=3, max3=2, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L476] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=255, ep21=255, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=-2, m2=3, m3=0, max1=1, max2=3, max3=2, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L477] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=255, ep21=255, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=-2, m2=3, m3=0, max1=1, max2=3, max3=2, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L478] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=255, ep21=255, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=-2, m2=3, m3=0, max1=1, max2=3, max3=2, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L479] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=255, ep21=255, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=-2, m2=3, m3=0, max1=1, max2=3, max3=2, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L482] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=255, ep21=255, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=-2, m2=3, m3=0, max1=1, max2=3, max3=2, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L484] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=255, ep21=255, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=-2, m2=3, m3=0, max1=1, max2=3, max3=2, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L489] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=255, ep21=255, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=-2, m2=3, m3=0, max1=1, max2=3, max3=2, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L492] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=255, ep21=255, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=-2, m2=3, m3=0, max1=1, max2=3, max3=2, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L494] COND TRUE (int )r1 < 2 [L495] tmp = 1 VAL [ep12=0, ep13=255, ep21=255, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=-2, m2=3, m3=0, max1=1, max2=3, max3=2, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L523] return (tmp); [L595] c1 = check() [L607] COND FALSE !(! arg) VAL [ep12=0, ep13=255, ep21=255, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=-2, m2=3, m3=0, max1=1, max2=3, max3=2, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L578] COND TRUE 1 [L79] _Bool newmax ; [L82] newmax = (_Bool)0 [L83] COND TRUE \read(mode1) [L84] COND FALSE !(r1 == 255) [L87] r1 = r1 + 1 [L88] COND TRUE \read(ep21) [L89] m1 = p21_old [L90] p21_old = nomsg [L91] COND TRUE (int )m1 > (int )max1 [L92] max1 = m1 [L93] newmax = (_Bool)1 [L96] COND FALSE !(\read(ep31)) [L104] newmax1 = newmax [L105] COND FALSE !((int )r1 == 2) [L112] mode1 = (_Bool)0 [L133] _Bool newmax ; [L136] newmax = (_Bool)0 [L137] COND TRUE \read(mode2) [L138] COND FALSE !(r2 == 255) [L141] r2 = r2 + 1 [L142] COND FALSE !(\read(ep12)) [L150] COND TRUE \read(ep32) [L151] m2 = p32_old [L152] p32_old = nomsg [L153] COND FALSE !((int )m2 > (int )max2) [L158] newmax2 = newmax [L159] COND FALSE !((int )r2 == 2) [L166] mode2 = (_Bool)0 [L187] _Bool newmax ; [L190] newmax = (_Bool)0 [L191] COND TRUE \read(mode3) [L192] COND FALSE !(r3 == 255) [L195] r3 = r3 + 1 [L196] COND TRUE \read(ep13) [L197] m3 = p13_old [L198] p13_old = nomsg [L199] COND FALSE !((int )m3 > (int )max3) [L204] COND FALSE !(\read(ep23)) [L212] newmax3 = newmax [L213] COND FALSE !((int )r3 == 2) [L220] mode3 = (_Bool)0 [L583] p12_old = p12_new [L584] p12_new = nomsg [L585] p13_old = p13_new [L586] p13_new = nomsg [L587] p21_old = p21_new [L588] p21_new = nomsg [L589] p23_old = p23_new [L590] p23_new = nomsg [L591] p31_old = p31_new [L592] p31_new = nomsg [L593] p32_old = p32_new [L594] p32_new = nomsg [L472] int tmp ; VAL [ep12=0, ep13=255, ep21=255, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=3, m2=2, m3=1, max1=3, max2=3, max3=2, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L475] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=255, ep21=255, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=3, m2=2, m3=1, max1=3, max2=3, max3=2, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L476] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=255, ep21=255, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=3, m2=2, m3=1, max1=3, max2=3, max3=2, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L477] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=255, ep21=255, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=3, m2=2, m3=1, max1=3, max2=3, max3=2, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L478] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=255, ep21=255, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=3, m2=2, m3=1, max1=3, max2=3, max3=2, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L479] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=255, ep21=255, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=3, m2=2, m3=1, max1=3, max2=3, max3=2, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L482] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=255, ep21=255, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=3, m2=2, m3=1, max1=3, max2=3, max3=2, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L484] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=255, ep21=255, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=3, m2=2, m3=1, max1=3, max2=3, max3=2, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L489] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=255, ep21=255, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=3, m2=2, m3=1, max1=3, max2=3, max3=2, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L492] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=255, ep21=255, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=3, m2=2, m3=1, max1=3, max2=3, max3=2, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L494] COND TRUE (int )r1 < 2 [L495] tmp = 1 VAL [ep12=0, ep13=255, ep21=255, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=3, m2=2, m3=1, max1=3, max2=3, max3=2, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L523] return (tmp); [L595] c1 = check() [L607] COND FALSE !(! arg) VAL [ep12=0, ep13=255, ep21=255, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=3, m2=2, m3=1, max1=3, max2=3, max3=2, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L578] COND TRUE 1 [L79] _Bool newmax ; [L82] newmax = (_Bool)0 [L83] COND FALSE !(\read(mode1)) [L114] COND FALSE !((int )r1 < 1) [L126] mode1 = (_Bool)1 [L133] _Bool newmax ; [L136] newmax = (_Bool)0 [L137] COND FALSE !(\read(mode2)) [L168] COND TRUE (int )r2 < 2 [L169] COND TRUE \read(ep21) [L170] COND FALSE !(\read(newmax2)) [L174] COND FALSE !(\read(ep23)) [L180] mode2 = (_Bool)1 [L187] _Bool newmax ; [L190] newmax = (_Bool)0 [L191] COND FALSE !(\read(mode3)) [L222] COND TRUE (int )r3 < 2 [L223] COND FALSE !(\read(ep31)) [L228] COND TRUE \read(ep32) [L229] COND FALSE !(\read(newmax3)) [L234] mode3 = (_Bool)1 [L583] p12_old = p12_new [L584] p12_new = nomsg [L585] p13_old = p13_new [L586] p13_new = nomsg [L587] p21_old = p21_new [L588] p21_new = nomsg [L589] p23_old = p23_new [L590] p23_new = nomsg [L591] p31_old = p31_new [L592] p31_new = nomsg [L593] p32_old = p32_new [L594] p32_new = nomsg [L472] int tmp ; VAL [ep12=0, ep13=255, ep21=255, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=3, m2=2, m3=1, max1=3, max2=3, max3=2, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L475] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=255, ep21=255, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=3, m2=2, m3=1, max1=3, max2=3, max3=2, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L476] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=255, ep21=255, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=3, m2=2, m3=1, max1=3, max2=3, max3=2, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L477] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=255, ep21=255, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=3, m2=2, m3=1, max1=3, max2=3, max3=2, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L478] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=255, ep21=255, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=3, m2=2, m3=1, max1=3, max2=3, max3=2, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L479] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=255, ep21=255, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=3, m2=2, m3=1, max1=3, max2=3, max3=2, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L482] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=255, ep21=255, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=3, m2=2, m3=1, max1=3, max2=3, max3=2, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L484] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=255, ep21=255, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=3, m2=2, m3=1, max1=3, max2=3, max3=2, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L489] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=255, ep21=255, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=3, m2=2, m3=1, max1=3, max2=3, max3=2, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L492] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=255, ep21=255, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=3, m2=2, m3=1, max1=3, max2=3, max3=2, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L494] COND TRUE (int )r1 < 2 [L495] tmp = 1 VAL [ep12=0, ep13=255, ep21=255, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=3, m2=2, m3=1, max1=3, max2=3, max3=2, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L523] return (tmp); [L595] c1 = check() [L607] COND FALSE !(! arg) VAL [ep12=0, ep13=255, ep21=255, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=3, m2=2, m3=1, max1=3, max2=3, max3=2, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L578] COND TRUE 1 [L79] _Bool newmax ; [L82] newmax = (_Bool)0 [L83] COND TRUE \read(mode1) [L84] COND FALSE !(r1 == 255) [L87] r1 = r1 + 1 [L88] COND TRUE \read(ep21) [L89] m1 = p21_old [L90] p21_old = nomsg [L91] COND FALSE !((int )m1 > (int )max1) [L96] COND FALSE !(\read(ep31)) [L104] newmax1 = newmax [L105] COND TRUE (int )r1 == 2 [L106] COND FALSE !((int )max1 == (int )id1) [L109] nl1 = (char)1 [L112] mode1 = (_Bool)0 [L133] _Bool newmax ; [L136] newmax = (_Bool)0 [L137] COND TRUE \read(mode2) [L138] COND FALSE !(r2 == 255) [L141] r2 = r2 + 1 [L142] COND FALSE !(\read(ep12)) [L150] COND TRUE \read(ep32) [L151] m2 = p32_old [L152] p32_old = nomsg [L153] COND FALSE !((int )m2 > (int )max2) [L158] newmax2 = newmax [L159] COND TRUE (int )r2 == 2 [L160] COND TRUE (int )max2 == (int )id2 [L161] st2 = (char)1 [L166] mode2 = (_Bool)0 [L187] _Bool newmax ; [L190] newmax = (_Bool)0 [L191] COND TRUE \read(mode3) [L192] COND FALSE !(r3 == 255) [L195] r3 = r3 + 1 [L196] COND TRUE \read(ep13) [L197] m3 = p13_old [L198] p13_old = nomsg [L199] COND FALSE !((int )m3 > (int )max3) [L204] COND FALSE !(\read(ep23)) [L212] newmax3 = newmax [L213] COND TRUE (int )r3 == 2 [L214] COND TRUE (int )max3 == (int )id3 [L215] st3 = (char)1 [L220] mode3 = (_Bool)0 [L583] p12_old = p12_new [L584] p12_new = nomsg [L585] p13_old = p13_new [L586] p13_new = nomsg [L587] p21_old = p21_new [L588] p21_new = nomsg [L589] p23_old = p23_new [L590] p23_new = nomsg [L591] p31_old = p31_new [L592] p31_new = nomsg [L593] p32_old = p32_new [L594] p32_new = nomsg [L472] int tmp ; VAL [ep12=0, ep13=255, ep21=255, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=-1, m2=-1, m3=-1, max1=3, max2=3, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L475] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L521] tmp = 0 VAL [ep12=0, ep13=255, ep21=255, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=-1, m2=-1, m3=-1, max1=3, max2=3, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L523] return (tmp); [L595] c1 = check() [L607] COND TRUE ! arg VAL [ep12=0, ep13=255, ep21=255, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=-1, m2=-1, m3=-1, max1=3, max2=3, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L609] reach_error() VAL [ep12=0, ep13=255, ep21=255, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=-1, m2=-1, m3=-1, max1=3, max2=3, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33 ms. Allocated memory is still 88.1 MB. Free memory was 60.3 MB in the beginning and 60.3 MB in the end (delta: 23.9 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 427.38 ms. Allocated memory was 88.1 MB in the beginning and 111.1 MB in the end (delta: 23.1 MB). Free memory was 52.7 MB in the beginning and 80.2 MB in the end (delta: -27.5 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 77.81 ms. Allocated memory is still 111.1 MB. Free memory was 80.2 MB in the beginning and 77.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 49.34 ms. Allocated memory is still 111.1 MB. Free memory was 77.5 MB in the beginning and 74.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 3028.05 ms. Allocated memory was 111.1 MB in the beginning and 140.5 MB in the end (delta: 29.4 MB). Free memory was 74.9 MB in the beginning and 101.8 MB in the end (delta: -26.8 MB). Peak memory consumption was 50.7 MB. Max. memory is 16.1 GB. * CodeCheck took 151499.18 ms. Allocated memory was 140.5 MB in the beginning and 1.4 GB in the end (delta: 1.3 GB). Free memory was 101.8 MB in the beginning and 886.9 MB in the end (delta: -785.1 MB). Peak memory consumption was 483.6 MB. Max. memory is 16.1 GB. * Witness Printer took 262.94 ms. Allocated memory is still 1.4 GB. Free memory was 886.9 MB in the beginning and 864.9 MB in the end (delta: 22.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. RESULT: Ultimate proved your program to be incorrect! [2021-10-29 03:53:18,363 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f8bbcb0-8bc5-497e-a1ef-8602b3236d8c/bin/ukojak-Rh5K9KB4LI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...