./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_abd2a63e-76a3-4686-bcee-3c95ef7c3996/bin/ukojak/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_abd2a63e-76a3-4686-bcee-3c95ef7c3996/bin/ukojak/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_abd2a63e-76a3-4686-bcee-3c95ef7c3996/bin/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_abd2a63e-76a3-4686-bcee-3c95ef7c3996/bin/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c -s /tmp/vcloud-vcloud-master/worker/run_dir_abd2a63e-76a3-4686-bcee-3c95ef7c3996/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_abd2a63e-76a3-4686-bcee-3c95ef7c3996/bin/ukojak --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 74a6f73169a446cb9e35d303e1738e0ce002d80f .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.0-a4ecdab [2020-11-30 01:00:48,757 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-30 01:00:48,761 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-30 01:00:48,837 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-30 01:00:48,855 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-30 01:00:48,861 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-30 01:00:48,864 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-30 01:00:48,869 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-30 01:00:48,872 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-30 01:00:48,879 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-30 01:00:48,881 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-30 01:00:48,883 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-30 01:00:48,884 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-30 01:00:48,888 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-30 01:00:48,890 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-30 01:00:48,893 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-30 01:00:48,895 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-30 01:00:48,899 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-30 01:00:48,903 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-30 01:00:48,913 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-30 01:00:48,915 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-30 01:00:48,917 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-30 01:00:48,920 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-30 01:00:48,921 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-30 01:00:48,932 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-30 01:00:48,933 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-30 01:00:48,933 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-30 01:00:48,936 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-30 01:00:48,937 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-30 01:00:48,938 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-30 01:00:48,939 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-30 01:00:48,940 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-30 01:00:48,943 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-30 01:00:48,944 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-30 01:00:48,946 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-30 01:00:48,946 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-30 01:00:48,947 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-30 01:00:48,948 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-30 01:00:48,948 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-30 01:00:48,949 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-30 01:00:48,950 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-30 01:00:48,953 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_abd2a63e-76a3-4686-bcee-3c95ef7c3996/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2020-11-30 01:00:49,003 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-30 01:00:49,003 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-30 01:00:49,005 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-11-30 01:00:49,006 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2020-11-30 01:00:49,006 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-30 01:00:49,007 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-30 01:00:49,007 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-30 01:00:49,007 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-30 01:00:49,008 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-30 01:00:49,008 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-30 01:00:49,009 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-30 01:00:49,010 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-30 01:00:49,010 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-30 01:00:49,010 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-30 01:00:49,010 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-30 01:00:49,011 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-30 01:00:49,011 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-30 01:00:49,011 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-30 01:00:49,012 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2020-11-30 01:00:49,012 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2020-11-30 01:00:49,012 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-30 01:00:49,013 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-30 01:00:49,013 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2020-11-30 01:00:49,013 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-30 01:00:49,013 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-30 01:00:49,014 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-30 01:00:49,014 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2020-11-30 01:00:49,014 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-30 01:00:49,015 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-30 01:00:49,015 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-vcloud-master/worker/run_dir_abd2a63e-76a3-4686-bcee-3c95ef7c3996/bin/ukojak/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-vcloud-master/worker/run_dir_abd2a63e-76a3-4686-bcee-3c95ef7c3996/bin/ukojak 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 -> 74a6f73169a446cb9e35d303e1738e0ce002d80f [2020-11-30 01:00:49,328 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-30 01:00:49,367 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-30 01:00:49,372 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-30 01:00:49,374 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-30 01:00:49,375 INFO L275 PluginConnector]: CDTParser initialized [2020-11-30 01:00:49,377 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_abd2a63e-76a3-4686-bcee-3c95ef7c3996/bin/ukojak/../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c [2020-11-30 01:00:49,473 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_abd2a63e-76a3-4686-bcee-3c95ef7c3996/bin/ukojak/data/5219336ea/c6374ce7d3904bbbb541d4e850494c77/FLAGc87e96c49 [2020-11-30 01:00:50,082 INFO L306 CDTParser]: Found 1 translation units. [2020-11-30 01:00:50,083 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_abd2a63e-76a3-4686-bcee-3c95ef7c3996/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c [2020-11-30 01:00:50,096 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_abd2a63e-76a3-4686-bcee-3c95ef7c3996/bin/ukojak/data/5219336ea/c6374ce7d3904bbbb541d4e850494c77/FLAGc87e96c49 [2020-11-30 01:00:50,386 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_abd2a63e-76a3-4686-bcee-3c95ef7c3996/bin/ukojak/data/5219336ea/c6374ce7d3904bbbb541d4e850494c77 [2020-11-30 01:00:50,388 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-30 01:00:50,390 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-30 01:00:50,391 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-30 01:00:50,392 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-30 01:00:50,396 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-30 01:00:50,397 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 01:00:50" (1/1) ... [2020-11-30 01:00:50,400 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a8b2f73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:00:50, skipping insertion in model container [2020-11-30 01:00:50,400 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 01:00:50" (1/1) ... [2020-11-30 01:00:50,409 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-30 01:00:50,465 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-30 01:00:50,809 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 01:00:50,827 INFO L203 MainTranslator]: Completed pre-run [2020-11-30 01:00:50,910 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 01:00:50,938 INFO L208 MainTranslator]: Completed translation [2020-11-30 01:00:50,941 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:00:50 WrapperNode [2020-11-30 01:00:50,942 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-30 01:00:50,943 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-30 01:00:50,943 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-30 01:00:50,944 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-30 01:00:50,953 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:00:50" (1/1) ... [2020-11-30 01:00:50,975 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:00:50" (1/1) ... [2020-11-30 01:00:51,033 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-30 01:00:51,034 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-30 01:00:51,034 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-30 01:00:51,034 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-30 01:00:51,049 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:00:50" (1/1) ... [2020-11-30 01:00:51,050 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:00:50" (1/1) ... [2020-11-30 01:00:51,055 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:00:50" (1/1) ... [2020-11-30 01:00:51,056 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:00:50" (1/1) ... [2020-11-30 01:00:51,067 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:00:50" (1/1) ... [2020-11-30 01:00:51,083 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:00:50" (1/1) ... [2020-11-30 01:00:51,098 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:00:50" (1/1) ... [2020-11-30 01:00:51,103 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-30 01:00:51,105 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-30 01:00:51,105 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-30 01:00:51,105 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-30 01:00:51,106 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:00:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_abd2a63e-76a3-4686-bcee-3c95ef7c3996/bin/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2020-11-30 01:00:51,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-30 01:00:51,176 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-30 01:00:51,176 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-30 01:00:51,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-30 01:00:55,617 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-30 01:00:55,618 INFO L298 CfgBuilder]: Removed 21 assume(true) statements. [2020-11-30 01:00:55,621 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 01:00:55 BoogieIcfgContainer [2020-11-30 01:00:55,621 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-30 01:00:55,623 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2020-11-30 01:00:55,623 INFO L271 PluginConnector]: Initializing CodeCheck... [2020-11-30 01:00:55,635 INFO L275 PluginConnector]: CodeCheck initialized [2020-11-30 01:00:55,636 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 01:00:55" (1/1) ... [2020-11-30 01:00:55,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:00:55,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-30 01:00:55,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 19 states and 30 transitions. [2020-11-30 01:00:55,690 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 30 transitions. [2020-11-30 01:00:55,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-11-30 01:00:55,693 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-30 01:00:56,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:00:56,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:00:56,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-30 01:00:56,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 21 states and 34 transitions. [2020-11-30 01:00:56,468 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 34 transitions. [2020-11-30 01:00:56,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-11-30 01:00:56,469 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-30 01:00:56,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:00:56,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:00:57,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-30 01:00:57,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 24 states and 41 transitions. [2020-11-30 01:00:57,244 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 41 transitions. [2020-11-30 01:00:57,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-11-30 01:00:57,245 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-30 01:00:57,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:00:57,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:00:58,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-30 01:00:58,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 28 states and 50 transitions. [2020-11-30 01:00:58,190 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 50 transitions. [2020-11-30 01:00:58,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-30 01:00:58,193 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-30 01:00:58,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:00:58,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:00:59,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-30 01:00:59,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 33 states and 61 transitions. [2020-11-30 01:00:59,442 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 61 transitions. [2020-11-30 01:00:59,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-30 01:00:59,443 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-30 01:00:59,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:00:59,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:01:01,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-30 01:01:01,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 40 states and 75 transitions. [2020-11-30 01:01:01,419 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 75 transitions. [2020-11-30 01:01:01,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-30 01:01:01,420 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-30 01:01:01,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:01:01,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:01:03,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-30 01:01:03,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 46 states and 87 transitions. [2020-11-30 01:01:03,232 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 87 transitions. [2020-11-30 01:01:03,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-30 01:01:03,232 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-30 01:01:03,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:01:03,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:01:03,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-30 01:01:03,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 47 states and 88 transitions. [2020-11-30 01:01:03,679 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 88 transitions. [2020-11-30 01:01:03,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-30 01:01:03,680 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-30 01:01:03,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:01:03,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:01:03,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-30 01:01:03,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 48 states and 89 transitions. [2020-11-30 01:01:03,815 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 89 transitions. [2020-11-30 01:01:03,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-30 01:01:03,815 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-30 01:01:03,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:01:04,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:01:04,595 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2020-11-30 01:01:06,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-30 01:01:06,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 58 states and 107 transitions. [2020-11-30 01:01:06,714 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 107 transitions. [2020-11-30 01:01:06,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-30 01:01:06,715 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-30 01:01:06,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:01:06,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:01:07,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-30 01:01:07,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 61 states and 112 transitions. [2020-11-30 01:01:07,351 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 112 transitions. [2020-11-30 01:01:07,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-30 01:01:07,358 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-30 01:01:07,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:01:08,348 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:01:08,516 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 35 [2020-11-30 01:01:13,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-30 01:01:13,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 77 states and 151 transitions. [2020-11-30 01:01:13,278 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 151 transitions. [2020-11-30 01:01:13,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-30 01:01:13,280 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-30 01:01:13,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:01:13,894 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:01:16,307 WARN L193 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2020-11-30 01:01:16,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-30 01:01:16,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 82 states and 159 transitions. [2020-11-30 01:01:16,868 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 159 transitions. [2020-11-30 01:01:16,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-30 01:01:16,870 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-30 01:01:16,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:01:17,032 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:01:17,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-30 01:01:17,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 83 states and 160 transitions. [2020-11-30 01:01:17,561 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 160 transitions. [2020-11-30 01:01:17,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-30 01:01:17,563 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-30 01:01:17,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:01:18,617 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:01:19,126 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 30 [2020-11-30 01:01:21,874 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 30 [2020-11-30 01:01:24,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-30 01:01:24,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 96 states and 182 transitions. [2020-11-30 01:01:24,070 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 182 transitions. [2020-11-30 01:01:24,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-30 01:01:24,072 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-30 01:01:24,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:01:24,233 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:01:25,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-30 01:01:25,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 98 states and 190 transitions. [2020-11-30 01:01:25,970 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 190 transitions. [2020-11-30 01:01:25,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-30 01:01:25,971 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-30 01:01:26,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:01:26,499 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:01:28,250 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 29 [2020-11-30 01:01:31,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-30 01:01:31,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 106 states and 208 transitions. [2020-11-30 01:01:31,716 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 208 transitions. [2020-11-30 01:01:31,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-30 01:01:31,717 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-30 01:01:31,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:01:32,047 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:01:35,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-30 01:01:35,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 110 states and 219 transitions. [2020-11-30 01:01:35,591 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 219 transitions. [2020-11-30 01:01:35,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-30 01:01:35,593 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-30 01:01:35,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:01:35,889 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:01:36,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-30 01:01:36,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 111 states and 221 transitions. [2020-11-30 01:01:36,896 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 221 transitions. [2020-11-30 01:01:36,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-30 01:01:36,897 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-30 01:01:37,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:01:38,264 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:01:38,433 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2020-11-30 01:01:38,968 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2020-11-30 01:01:41,722 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 37 [2020-11-30 01:01:42,904 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2020-11-30 01:01:43,954 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2020-11-30 01:01:44,201 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2020-11-30 01:01:45,259 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 37 [2020-11-30 01:01:45,520 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 39 [2020-11-30 01:01:46,705 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2020-11-30 01:01:46,984 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2020-11-30 01:01:52,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-30 01:01:52,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 131 states and 261 transitions. [2020-11-30 01:01:52,749 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 261 transitions. [2020-11-30 01:01:52,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-11-30 01:01:52,750 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-30 01:01:52,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:01:54,195 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:01:58,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-30 01:01:58,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 136 states and 271 transitions. [2020-11-30 01:01:58,092 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 271 transitions. [2020-11-30 01:01:58,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-11-30 01:01:58,093 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-30 01:01:58,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:02:00,070 WARN L193 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 23 [2020-11-30 01:02:00,559 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:02:01,193 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 36 [2020-11-30 01:02:01,824 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2020-11-30 01:02:03,415 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2020-11-30 01:02:04,158 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 39 [2020-11-30 01:02:04,509 WARN L193 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2020-11-30 01:02:05,966 WARN L193 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 40 [2020-11-30 01:02:06,326 WARN L193 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2020-11-30 01:02:08,286 WARN L193 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2020-11-30 01:02:11,184 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 26 [2020-11-30 01:02:12,001 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 26 [2020-11-30 01:02:13,371 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 25 [2020-11-30 01:02:14,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-30 01:02:14,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 155 states and 302 transitions. [2020-11-30 01:02:14,268 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 302 transitions. [2020-11-30 01:02:14,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-11-30 01:02:14,269 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-30 01:02:14,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:02:18,118 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:02:19,935 WARN L193 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 42 [2020-11-30 01:02:21,820 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2020-11-30 01:02:22,209 WARN L193 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 45 [2020-11-30 01:02:22,871 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2020-11-30 01:02:23,611 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2020-11-30 01:02:23,991 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2020-11-30 01:02:24,419 WARN L193 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2020-11-30 01:02:26,600 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 30 [2020-11-30 01:02:28,047 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 28 [2020-11-30 01:02:28,362 WARN L193 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 31 [2020-11-30 01:02:29,763 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 31 [2020-11-30 01:02:30,593 WARN L193 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 36 [2020-11-30 01:02:31,541 WARN L193 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2020-11-30 01:02:33,059 WARN L193 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2020-11-30 01:02:34,003 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2020-11-30 01:02:35,262 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2020-11-30 01:02:35,593 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 26 [2020-11-30 01:02:37,311 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 28 [2020-11-30 01:02:39,064 WARN L193 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2020-11-30 01:02:40,906 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2020-11-30 01:02:42,827 WARN L193 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 30 [2020-11-30 01:02:43,265 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2020-11-30 01:02:44,720 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2020-11-30 01:02:45,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-30 01:02:45,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 183 states and 366 transitions. [2020-11-30 01:02:45,696 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 366 transitions. [2020-11-30 01:02:45,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-11-30 01:02:45,697 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-30 01:02:45,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:02:45,929 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:02:46,424 WARN L193 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 35 [2020-11-30 01:02:46,764 WARN L193 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 36 [2020-11-30 01:02:48,672 WARN L193 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 36 [2020-11-30 01:02:49,027 WARN L193 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 37 [2020-11-30 01:02:50,399 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2020-11-30 01:02:50,988 WARN L193 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 37 [2020-11-30 01:02:51,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-30 01:02:51,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 188 states and 375 transitions. [2020-11-30 01:02:51,791 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 375 transitions. [2020-11-30 01:02:51,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-11-30 01:02:51,793 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-30 01:02:51,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:02:54,169 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:02:56,817 WARN L193 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 29 [2020-11-30 01:02:58,653 WARN L193 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 31 [2020-11-30 01:03:00,575 WARN L193 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 32 [2020-11-30 01:03:02,558 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 28 [2020-11-30 01:03:04,448 WARN L193 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 33 [2020-11-30 01:03:06,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-30 01:03:06,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 193 states and 383 transitions. [2020-11-30 01:03:06,202 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 383 transitions. [2020-11-30 01:03:06,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-11-30 01:03:06,203 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-30 01:03:06,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:03:09,444 WARN L193 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 18 [2020-11-30 01:03:10,293 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 22 [2020-11-30 01:03:11,358 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 18 [2020-11-30 01:03:12,362 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 16 [2020-11-30 01:03:13,726 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:03:17,572 WARN L193 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 36 [2020-11-30 01:03:18,868 WARN L193 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 37 [2020-11-30 01:03:19,976 WARN L193 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 37 [2020-11-30 01:03:21,579 WARN L193 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 33 [2020-11-30 01:03:22,760 WARN L193 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 35 [2020-11-30 01:03:24,481 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2020-11-30 01:03:27,842 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2020-11-30 01:03:30,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-30 01:03:30,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 203 states and 401 transitions. [2020-11-30 01:03:30,494 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 401 transitions. [2020-11-30 01:03:30,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-11-30 01:03:30,494 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-30 01:03:30,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:03:30,947 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:03:31,278 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 28 [2020-11-30 01:03:32,194 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2020-11-30 01:03:33,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-30 01:03:33,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 206 states and 412 transitions. [2020-11-30 01:03:33,665 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 412 transitions. [2020-11-30 01:03:33,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-11-30 01:03:33,665 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-30 01:03:33,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:03:35,816 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:03:37,256 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 32 [2020-11-30 01:03:37,599 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2020-11-30 01:03:39,141 WARN L193 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 34 [2020-11-30 01:03:39,483 WARN L193 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 35 [2020-11-30 01:03:41,035 WARN L193 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 35 [2020-11-30 01:03:41,389 WARN L193 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 36 [2020-11-30 01:03:42,945 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 31 [2020-11-30 01:03:43,273 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 32 [2020-11-30 01:03:44,766 WARN L193 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 36 [2020-11-30 01:03:45,110 WARN L193 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 37 [2020-11-30 01:03:54,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-30 01:03:54,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 215 states and 435 transitions. [2020-11-30 01:03:54,540 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 435 transitions. [2020-11-30 01:03:54,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-11-30 01:03:54,541 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-30 01:03:54,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:03:54,831 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:03:55,245 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 22 [2020-11-30 01:04:00,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-30 01:04:00,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 218 states and 444 transitions. [2020-11-30 01:04:00,942 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 444 transitions. [2020-11-30 01:04:00,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-11-30 01:04:00,943 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-30 01:04:00,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:04:01,226 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:04:01,642 WARN L193 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 21 [2020-11-30 01:04:03,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-30 01:04:03,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 219 states and 446 transitions. [2020-11-30 01:04:03,200 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 446 transitions. [2020-11-30 01:04:03,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-11-30 01:04:03,201 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-30 01:04:03,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:04:03,492 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:04:04,011 WARN L193 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 32 [2020-11-30 01:04:04,459 WARN L193 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2020-11-30 01:04:06,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-30 01:04:06,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 220 states and 453 transitions. [2020-11-30 01:04:06,142 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 453 transitions. [2020-11-30 01:04:06,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-11-30 01:04:06,143 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-30 01:04:06,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:04:10,784 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:04:13,053 WARN L193 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 37 [2020-11-30 01:04:14,209 WARN L193 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 37 [2020-11-30 01:04:17,205 WARN L193 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 40 [2020-11-30 01:04:19,992 WARN L193 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 39 [2020-11-30 01:04:21,608 WARN L193 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2020-11-30 01:04:22,009 WARN L193 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2020-11-30 01:04:23,983 WARN L193 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2020-11-30 01:04:24,399 WARN L193 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 40 [2020-11-30 01:04:26,385 WARN L193 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 39 [2020-11-30 01:04:26,820 WARN L193 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2020-11-30 01:04:27,614 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2020-11-30 01:04:28,452 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2020-11-30 01:04:28,895 WARN L193 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2020-11-30 01:04:29,310 WARN L193 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 37 [2020-11-30 01:04:31,459 WARN L193 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 28 [2020-11-30 01:04:31,969 WARN L193 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2020-11-30 01:04:34,787 WARN L193 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 25 [2020-11-30 01:04:37,376 WARN L193 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 28 [2020-11-30 01:04:44,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-30 01:04:44,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 238 states and 493 transitions. [2020-11-30 01:04:44,102 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 493 transitions. [2020-11-30 01:04:44,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-11-30 01:04:44,102 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-30 01:04:44,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:04:44,547 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:04:44,895 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 29 [2020-11-30 01:04:45,158 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 29 [2020-11-30 01:04:47,652 WARN L193 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 22 [2020-11-30 01:04:50,001 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2020-11-30 01:04:55,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-30 01:04:55,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 247 states and 511 transitions. [2020-11-30 01:04:55,880 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 511 transitions. [2020-11-30 01:04:55,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-11-30 01:04:55,881 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-30 01:04:55,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:04:58,876 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:05:02,479 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 30 [2020-11-30 01:05:04,539 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 32 [2020-11-30 01:05:06,364 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 27 [2020-11-30 01:05:07,775 WARN L193 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 31 [2020-11-30 01:05:18,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-30 01:05:18,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 253 states and 529 transitions. [2020-11-30 01:05:18,085 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 529 transitions. [2020-11-30 01:05:18,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-11-30 01:05:18,085 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-30 01:05:18,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:05:18,166 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:05:26,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-30 01:05:26,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 257 states and 539 transitions. [2020-11-30 01:05:26,844 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 539 transitions. [2020-11-30 01:05:26,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-11-30 01:05:26,844 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-30 01:05:26,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:05:26,930 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:05:27,459 WARN L193 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 32 [2020-11-30 01:05:27,863 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-11-30 01:05:29,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-30 01:05:29,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 258 states and 545 transitions. [2020-11-30 01:05:29,884 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 545 transitions. [2020-11-30 01:05:29,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-11-30 01:05:29,884 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-30 01:05:29,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:05:36,963 WARN L193 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 16 [2020-11-30 01:05:38,230 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:05:42,862 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2020-11-30 01:05:44,612 WARN L193 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 41 [2020-11-30 01:05:45,587 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2020-11-30 01:05:46,668 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2020-11-30 01:05:47,053 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2020-11-30 01:05:47,603 WARN L193 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 44 [2020-11-30 01:05:48,726 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2020-11-30 01:05:49,825 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2020-11-30 01:05:50,221 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2020-11-30 01:05:50,767 WARN L193 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 45 [2020-11-30 01:05:51,860 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2020-11-30 01:05:52,967 WARN L193 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2020-11-30 01:05:53,540 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2020-11-30 01:05:54,156 WARN L193 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 35 [2020-11-30 01:05:55,326 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2020-11-30 01:05:57,170 WARN L193 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 32 [2020-11-30 01:05:59,312 WARN L193 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 33 [2020-11-30 01:06:00,688 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2020-11-30 01:06:02,057 WARN L193 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2020-11-30 01:06:03,581 WARN L193 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 34 [2020-11-30 01:06:05,022 WARN L193 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2020-11-30 01:06:05,816 WARN L193 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 30 [2020-11-30 01:06:06,615 WARN L193 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 32 [2020-11-30 01:06:08,980 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2020-11-30 01:06:09,623 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 23 [2020-11-30 01:06:10,314 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 23 [2020-11-30 01:06:15,052 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 22 [2020-11-30 01:06:23,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-30 01:06:23,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 269 states and 578 transitions. [2020-11-30 01:06:23,367 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 578 transitions. [2020-11-30 01:06:23,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-11-30 01:06:23,368 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-30 01:06:23,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:06:23,561 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:06:24,255 WARN L193 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2020-11-30 01:06:25,205 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2020-11-30 01:06:25,899 WARN L193 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 24 [2020-11-30 01:06:26,524 WARN L193 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 24 [2020-11-30 01:06:28,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-30 01:06:28,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 271 states and 581 transitions. [2020-11-30 01:06:28,907 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 581 transitions. [2020-11-30 01:06:28,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-11-30 01:06:28,908 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-30 01:06:28,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:06:29,099 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:06:29,706 WARN L193 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 29 [2020-11-30 01:06:30,390 WARN L193 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 30 [2020-11-30 01:06:34,340 WARN L193 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 31 [2020-11-30 01:06:36,373 WARN L193 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 27 [2020-11-30 01:06:37,141 WARN L193 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 29 [2020-11-30 01:06:39,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-30 01:06:39,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 275 states and 592 transitions. [2020-11-30 01:06:39,768 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 592 transitions. [2020-11-30 01:06:39,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-11-30 01:06:39,769 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-30 01:06:39,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:06:39,838 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-11-30 01:06:41,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-30 01:06:41,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 275 states and 591 transitions. [2020-11-30 01:06:41,353 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 591 transitions. [2020-11-30 01:06:41,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-11-30 01:06:41,354 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-30 01:06:42,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:06:42,237 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:06:43,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:06:43,460 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:06:44,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:06:44,186 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:06:44,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:06:44,811 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:06:45,030 WARN L483 CodeCheckObserver]: This program is UNSAFE, Check terminated with 40 iterations. [2020-11-30 01:06:45,334 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 30.11 01:06:45 ImpRootNode [2020-11-30 01:06:45,335 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2020-11-30 01:06:45,336 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-30 01:06:45,336 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-30 01:06:45,336 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-30 01:06:45,337 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 01:00:55" (3/4) ... [2020-11-30 01:06:45,339 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-30 01:06:45,560 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_abd2a63e-76a3-4686-bcee-3c95ef7c3996/bin/ukojak/witness.graphml [2020-11-30 01:06:45,560 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-30 01:06:45,561 INFO L168 Benchmark]: Toolchain (without parser) took 355171.21 ms. Allocated memory was 100.7 MB in the beginning and 599.8 MB in the end (delta: 499.1 MB). Free memory was 72.8 MB in the beginning and 282.0 MB in the end (delta: -209.3 MB). Peak memory consumption was 289.9 MB. Max. memory is 16.1 GB. [2020-11-30 01:06:45,561 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 100.7 MB. Free memory is still 60.4 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 01:06:45,562 INFO L168 Benchmark]: CACSL2BoogieTranslator took 550.74 ms. Allocated memory is still 100.7 MB. Free memory was 72.6 MB in the beginning and 70.3 MB in the end (delta: 2.3 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-11-30 01:06:45,562 INFO L168 Benchmark]: Boogie Procedure Inliner took 89.94 ms. Allocated memory is still 100.7 MB. Free memory was 70.3 MB in the beginning and 67.3 MB in the end (delta: 3.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-30 01:06:45,563 INFO L168 Benchmark]: Boogie Preprocessor took 70.11 ms. Allocated memory is still 100.7 MB. Free memory was 67.3 MB in the beginning and 64.9 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-30 01:06:45,563 INFO L168 Benchmark]: RCFGBuilder took 4516.75 ms. Allocated memory was 100.7 MB in the beginning and 153.1 MB in the end (delta: 52.4 MB). Free memory was 64.6 MB in the beginning and 111.4 MB in the end (delta: -46.8 MB). Peak memory consumption was 77.2 MB. Max. memory is 16.1 GB. [2020-11-30 01:06:45,563 INFO L168 Benchmark]: CodeCheck took 349713.10 ms. Allocated memory was 153.1 MB in the beginning and 599.8 MB in the end (delta: 446.7 MB). Free memory was 111.4 MB in the beginning and 305.1 MB in the end (delta: -193.7 MB). Peak memory consumption was 254.1 MB. Max. memory is 16.1 GB. [2020-11-30 01:06:45,564 INFO L168 Benchmark]: Witness Printer took 223.91 ms. Allocated memory is still 599.8 MB. Free memory was 305.1 MB in the beginning and 282.0 MB in the end (delta: 23.1 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.1 GB. [2020-11-30 01:06:45,576 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, 19 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 349.3s, OverallIterations: 40, TraceHistogramMax: 0, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: -1516057232 SDtfs, 425878062 SDslu, 1785403720 SDs, 0 SdLazy, -2013061954 SolverSat, -1624570432 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 131.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10338 GetRequests, 8990 SyntacticMatches, 548 SemanticMatches, 800 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 377954 ImplicationChecksByTransitivity, 327.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.2s SsaConstructionTime, 4.2s SatisfiabilityAnalysisTime, 42.5s InterpolantComputationTime, 1101 NumberOfCodeBlocks, 1101 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 1014 ConstructedInterpolants, 0 QuantifiedInterpolants, 366117 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 39 InterpolantComputations, 11 PerfectInterpolantSequences, 143/623 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: 3]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L27] msg_t nomsg = (msg_t )-1; [L28] port_t p12 ; [L29] char p12_old ; [L30] char p12_new ; [L31] _Bool ep12 ; [L32] port_t p13 ; [L33] char p13_old ; [L34] char p13_new ; [L35] _Bool ep13 ; [L36] port_t p21 ; [L37] char p21_old ; [L38] char p21_new ; [L39] _Bool ep21 ; [L40] port_t p23 ; [L41] char p23_old ; [L42] char p23_new ; [L43] _Bool ep23 ; [L44] port_t p31 ; [L45] char p31_old ; [L46] char p31_new ; [L47] _Bool ep31 ; [L48] port_t p32 ; [L49] char p32_old ; [L50] char p32_new ; [L51] _Bool ep32 ; [L52] char id1 ; [L53] char r1 ; [L54] char st1 ; [L55] char nl1 ; [L56] char m1 ; [L57] char max1 ; [L58] _Bool mode1 ; [L59] _Bool newmax1 ; [L60] char id2 ; [L61] char r2 ; [L62] char st2 ; [L63] char nl2 ; [L64] char m2 ; [L65] char max2 ; [L66] _Bool mode2 ; [L67] _Bool newmax2 ; [L68] char id3 ; [L69] char r3 ; [L70] char st3 ; [L71] char nl3 ; [L72] char m3 ; [L73] char max3 ; [L74] _Bool mode3 ; [L75] _Bool newmax3 ; [L518] int c1 ; [L519] int i2 ; [L522] c1 = 0 [L523] ep12 = __VERIFIER_nondet_bool() [L524] ep13 = __VERIFIER_nondet_bool() [L525] ep21 = __VERIFIER_nondet_bool() [L526] ep23 = __VERIFIER_nondet_bool() [L527] ep31 = __VERIFIER_nondet_bool() [L528] ep32 = __VERIFIER_nondet_bool() [L529] id1 = __VERIFIER_nondet_char() [L530] r1 = __VERIFIER_nondet_char() [L531] st1 = __VERIFIER_nondet_char() [L532] nl1 = __VERIFIER_nondet_char() [L533] m1 = __VERIFIER_nondet_char() [L534] max1 = __VERIFIER_nondet_char() [L535] mode1 = __VERIFIER_nondet_bool() [L536] newmax1 = __VERIFIER_nondet_bool() [L537] id2 = __VERIFIER_nondet_char() [L538] r2 = __VERIFIER_nondet_char() [L539] st2 = __VERIFIER_nondet_char() [L540] nl2 = __VERIFIER_nondet_char() [L541] m2 = __VERIFIER_nondet_char() [L542] max2 = __VERIFIER_nondet_char() [L543] mode2 = __VERIFIER_nondet_bool() [L544] newmax2 = __VERIFIER_nondet_bool() [L545] id3 = __VERIFIER_nondet_char() [L546] r3 = __VERIFIER_nondet_char() [L547] st3 = __VERIFIER_nondet_char() [L548] nl3 = __VERIFIER_nondet_char() [L549] m3 = __VERIFIER_nondet_char() [L550] max3 = __VERIFIER_nondet_char() [L551] mode3 = __VERIFIER_nondet_bool() [L552] newmax3 = __VERIFIER_nondet_bool() [L231] _Bool r121 ; [L232] _Bool r131 ; [L233] _Bool r211 ; [L234] _Bool r231 ; [L235] _Bool r311 ; [L236] _Bool r321 ; [L237] _Bool r122 ; [L238] int tmp ; [L239] _Bool r132 ; [L240] int tmp___0 ; [L241] _Bool r212 ; [L242] int tmp___1 ; [L243] _Bool r232 ; [L244] int tmp___2 ; [L245] _Bool r312 ; [L246] int tmp___3 ; [L247] _Bool r322 ; [L248] int tmp___4 ; [L249] int tmp___5 ; [L252] r121 = ep12 [L253] r131 = ep13 [L254] r211 = ep21 [L255] r231 = ep23 [L256] r311 = ep31 [L257] r321 = ep32 [L258] COND TRUE \read(r121) [L259] tmp = 1 [L270] r122 = (_Bool )tmp [L271] COND TRUE \read(r131) [L272] tmp___0 = 1 [L283] r132 = (_Bool )tmp___0 [L284] COND TRUE \read(r211) [L285] tmp___1 = 1 [L296] r212 = (_Bool )tmp___1 [L297] COND TRUE \read(r231) [L298] tmp___2 = 1 [L309] r232 = (_Bool )tmp___2 [L310] COND TRUE \read(r311) [L311] tmp___3 = 1 [L322] r312 = (_Bool )tmp___3 [L323] COND FALSE !(\read(r321)) [L326] COND TRUE \read(r311) [L327] COND TRUE \read(ep12) [L328] tmp___4 = 1 [L335] r322 = (_Bool )tmp___4 [L336] COND TRUE (int )id1 != (int )id2 [L337] COND TRUE (int )id1 != (int )id3 [L338] COND TRUE (int )id2 != (int )id3 [L339] COND TRUE (int )id1 >= 0 [L340] COND TRUE (int )id2 >= 0 [L341] COND TRUE (int )id3 >= 0 [L342] COND TRUE (int )r1 == 0 [L343] COND TRUE (int )r2 == 0 [L344] COND TRUE (int )r3 == 0 [L345] COND TRUE \read(r122) [L346] COND TRUE \read(r132) [L347] COND TRUE \read(r212) [L348] COND TRUE \read(r232) [L349] COND TRUE \read(r312) [L350] COND TRUE \read(r322) [L351] COND TRUE (int )max1 == (int )id1 [L352] COND TRUE (int )max2 == (int )id2 [L353] COND TRUE (int )max3 == (int )id3 [L354] COND TRUE (int )st1 == 0 [L355] COND TRUE (int )st2 == 0 [L356] COND TRUE (int )st3 == 0 [L357] COND TRUE (int )nl1 == 0 [L358] COND TRUE (int )nl2 == 0 [L359] COND TRUE (int )nl3 == 0 [L360] COND TRUE (int )mode1 == 0 [L361] COND TRUE (int )mode2 == 0 [L362] COND TRUE (int )mode3 == 0 [L363] COND TRUE \read(newmax1) [L364] COND TRUE \read(newmax2) [L365] COND TRUE \read(newmax3) [L366] tmp___5 = 1 [L457] return (tmp___5); [L553] i2 = init() [L21] COND FALSE !(!cond) [L555] p12_old = nomsg [L556] p12_new = nomsg [L557] p13_old = nomsg [L558] p13_new = nomsg [L559] p21_old = nomsg [L560] p21_new = nomsg [L561] p23_old = nomsg [L562] p23_new = nomsg [L563] p31_old = nomsg [L564] p31_new = nomsg [L565] p32_old = nomsg [L566] p32_new = nomsg [L567] i2 = 0 VAL [ep12=255, ep13=1, ep21=255, ep23=1, ep31=255, ep32=0, id1=1, id2=125, id3=126, m1=124, m2=124, m3=127, max1=1, max2=125, max3=126, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=255, 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] [L568] COND TRUE i2 < 6 [L78] _Bool newmax ; [L81] newmax = (_Bool)0 [L82] COND FALSE !(\read(mode1)) [L110] COND TRUE (int )r1 < 1 [L111] COND TRUE \read(ep12) [L112] COND TRUE \read(newmax1) [L113] EXPR max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L113] p12_new = max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L116] COND TRUE \read(ep13) [L117] COND TRUE \read(newmax1) [L118] EXPR max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L118] p13_new = max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L122] mode1 = (_Bool)1 [L129] _Bool newmax ; [L132] newmax = (_Bool)0 [L133] COND FALSE !(\read(mode2)) [L161] COND TRUE (int )r2 < 2 [L162] COND TRUE \read(ep21) [L163] COND TRUE \read(newmax2) [L164] EXPR max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L164] p21_new = max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L167] COND TRUE \read(ep23) [L168] COND TRUE \read(newmax2) [L169] EXPR max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L169] p23_new = max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L173] mode2 = (_Bool)1 [L180] _Bool newmax ; [L183] newmax = (_Bool)0 [L184] COND FALSE !(\read(mode3)) [L212] COND TRUE (int )r3 < 2 [L213] COND TRUE \read(ep31) [L214] COND TRUE \read(newmax3) [L215] EXPR max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L215] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L218] COND FALSE !(\read(ep32)) [L224] mode3 = (_Bool)1 [L573] p12_old = p12_new [L574] p12_new = nomsg [L575] p13_old = p13_new [L576] p13_new = nomsg [L577] p21_old = p21_new [L578] p21_new = nomsg [L579] p23_old = p23_new [L580] p23_new = nomsg [L581] p31_old = p31_new [L582] p31_new = nomsg [L583] p32_old = p32_new [L584] p32_new = nomsg [L462] int tmp ; VAL [ep12=255, ep13=1, ep21=255, ep23=1, ep31=255, ep32=0, id1=1, id2=125, id3=126, m1=124, m2=124, m3=127, max1=1, max2=125, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=255, 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=125, p23=0, p23_new=-1, p23_old=125, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L465] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=255, ep13=1, ep21=255, ep23=1, ep31=255, ep32=0, id1=1, id2=125, id3=126, m1=124, m2=124, m3=127, max1=1, max2=125, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=255, 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=125, p23=0, p23_new=-1, p23_old=125, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L466] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=255, ep13=1, ep21=255, ep23=1, ep31=255, ep32=0, id1=1, id2=125, id3=126, m1=124, m2=124, m3=127, max1=1, max2=125, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=255, 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=125, p23=0, p23_new=-1, p23_old=125, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L467] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=255, ep13=1, ep21=255, ep23=1, ep31=255, ep32=0, id1=1, id2=125, id3=126, m1=124, m2=124, m3=127, max1=1, max2=125, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=255, 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=125, p23=0, p23_new=-1, p23_old=125, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L468] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=255, ep13=1, ep21=255, ep23=1, ep31=255, ep32=0, id1=1, id2=125, id3=126, m1=124, m2=124, m3=127, max1=1, max2=125, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=255, 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=125, p23=0, p23_new=-1, p23_old=125, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L469] COND FALSE !((int )r1 >= 2) VAL [ep12=255, ep13=1, ep21=255, ep23=1, ep31=255, ep32=0, id1=1, id2=125, id3=126, m1=124, m2=124, m3=127, max1=1, max2=125, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=255, 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=125, p23=0, p23_new=-1, p23_old=125, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L472] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=255, ep13=1, ep21=255, ep23=1, ep31=255, ep32=0, id1=1, id2=125, id3=126, m1=124, m2=124, m3=127, max1=1, max2=125, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=255, 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=125, p23=0, p23_new=-1, p23_old=125, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L474] COND TRUE (int )r1 < 2 VAL [ep12=255, ep13=1, ep21=255, ep23=1, ep31=255, ep32=0, id1=1, id2=125, id3=126, m1=124, m2=124, m3=127, max1=1, max2=125, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=255, 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=125, p23=0, p23_new=-1, p23_old=125, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L479] COND FALSE !((int )r1 >= 2) VAL [ep12=255, ep13=1, ep21=255, ep23=1, ep31=255, ep32=0, id1=1, id2=125, id3=126, m1=124, m2=124, m3=127, max1=1, max2=125, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=255, 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=125, p23=0, p23_new=-1, p23_old=125, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L482] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=255, ep13=1, ep21=255, ep23=1, ep31=255, ep32=0, id1=1, id2=125, id3=126, m1=124, m2=124, m3=127, max1=1, max2=125, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=255, 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=125, p23=0, p23_new=-1, p23_old=125, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L484] COND TRUE (int )r1 < 2 [L485] tmp = 1 VAL [ep12=255, ep13=1, ep21=255, ep23=1, ep31=255, ep32=0, id1=1, id2=125, id3=126, m1=124, m2=124, m3=127, max1=1, max2=125, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=255, 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=125, p23=0, p23_new=-1, p23_old=125, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L513] return (tmp); [L585] c1 = check() [L598] COND FALSE !(! arg) VAL [ep12=255, ep13=1, ep21=255, ep23=1, ep31=255, ep32=0, id1=1, id2=125, id3=126, m1=124, m2=124, m3=127, max1=1, max2=125, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=255, 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=125, p23=0, p23_new=-1, p23_old=125, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L587] i2 ++ VAL [ep12=255, ep13=1, ep21=255, ep23=1, ep31=255, ep32=0, id1=1, id2=125, id3=126, m1=124, m2=124, m3=127, max1=1, max2=125, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=255, 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=125, p23=0, p23_new=-1, p23_old=125, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L568] COND TRUE i2 < 6 [L78] _Bool newmax ; [L81] newmax = (_Bool)0 [L82] COND TRUE \read(mode1) [L83] r1 = (char )((int )r1 + 1) [L84] COND TRUE \read(ep21) [L85] m1 = p21_old [L86] p21_old = nomsg [L87] COND TRUE (int )m1 > (int )max1 [L88] max1 = m1 [L89] newmax = (_Bool)1 [L92] COND TRUE \read(ep31) [L93] m1 = p31_old [L94] p31_old = nomsg [L95] COND TRUE (int )m1 > (int )max1 [L96] max1 = m1 [L97] newmax = (_Bool)1 [L100] newmax1 = newmax [L101] COND FALSE !((int )r1 == 2) [L108] mode1 = (_Bool)0 [L129] _Bool newmax ; [L132] newmax = (_Bool)0 [L133] COND TRUE \read(mode2) [L134] r2 = (char )((int )r2 + 1) [L135] COND TRUE \read(ep12) [L136] m2 = p12_old [L137] p12_old = nomsg [L138] COND FALSE !((int )m2 > (int )max2) [L143] COND FALSE !(\read(ep32)) [L151] newmax2 = newmax [L152] COND FALSE !((int )r2 == 2) [L159] mode2 = (_Bool)0 [L180] _Bool newmax ; [L183] newmax = (_Bool)0 [L184] COND TRUE \read(mode3) [L185] r3 = (char )((int )r3 + 1) [L186] COND TRUE \read(ep13) [L187] m3 = p13_old [L188] p13_old = nomsg [L189] COND FALSE !((int )m3 > (int )max3) [L194] COND TRUE \read(ep23) [L195] m3 = p23_old [L196] p23_old = nomsg [L197] COND FALSE !((int )m3 > (int )max3) [L202] newmax3 = newmax [L203] COND FALSE !((int )r3 == 2) [L210] mode3 = (_Bool)0 [L573] p12_old = p12_new [L574] p12_new = nomsg [L575] p13_old = p13_new [L576] p13_new = nomsg [L577] p21_old = p21_new [L578] p21_new = nomsg [L579] p23_old = p23_new [L580] p23_new = nomsg [L581] p31_old = p31_new [L582] p31_new = nomsg [L583] p32_old = p32_new [L584] p32_new = nomsg [L462] int tmp ; VAL [ep12=255, ep13=1, ep21=255, ep23=1, ep31=255, ep32=0, id1=1, id2=125, id3=126, m1=126, m2=1, m3=125, max1=126, max2=125, max3=126, 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] [L465] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=255, ep13=1, ep21=255, ep23=1, ep31=255, ep32=0, id1=1, id2=125, id3=126, m1=126, m2=1, m3=125, max1=126, max2=125, max3=126, 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] [L466] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=255, ep13=1, ep21=255, ep23=1, ep31=255, ep32=0, id1=1, id2=125, id3=126, m1=126, m2=1, m3=125, max1=126, max2=125, max3=126, 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] [L467] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=255, ep13=1, ep21=255, ep23=1, ep31=255, ep32=0, id1=1, id2=125, id3=126, m1=126, m2=1, m3=125, max1=126, max2=125, max3=126, 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] [L468] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=255, ep13=1, ep21=255, ep23=1, ep31=255, ep32=0, id1=1, id2=125, id3=126, m1=126, m2=1, m3=125, max1=126, max2=125, max3=126, 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] [L469] COND FALSE !((int )r1 >= 2) VAL [ep12=255, ep13=1, ep21=255, ep23=1, ep31=255, ep32=0, id1=1, id2=125, id3=126, m1=126, m2=1, m3=125, max1=126, max2=125, max3=126, 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] [L472] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=255, ep13=1, ep21=255, ep23=1, ep31=255, ep32=0, id1=1, id2=125, id3=126, m1=126, m2=1, m3=125, max1=126, max2=125, max3=126, 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] [L474] COND TRUE (int )r1 < 2 VAL [ep12=255, ep13=1, ep21=255, ep23=1, ep31=255, ep32=0, id1=1, id2=125, id3=126, m1=126, m2=1, m3=125, max1=126, max2=125, max3=126, 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=255, ep13=1, ep21=255, ep23=1, ep31=255, ep32=0, id1=1, id2=125, id3=126, m1=126, m2=1, m3=125, max1=126, max2=125, max3=126, 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 )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=255, ep13=1, ep21=255, ep23=1, ep31=255, ep32=0, id1=1, id2=125, id3=126, m1=126, m2=1, m3=125, max1=126, max2=125, max3=126, 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 [L485] tmp = 1 VAL [ep12=255, ep13=1, ep21=255, ep23=1, ep31=255, ep32=0, id1=1, id2=125, id3=126, m1=126, m2=1, m3=125, max1=126, max2=125, max3=126, 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] [L513] return (tmp); [L585] c1 = check() [L598] COND FALSE !(! arg) VAL [ep12=255, ep13=1, ep21=255, ep23=1, ep31=255, ep32=0, id1=1, id2=125, id3=126, m1=126, m2=1, m3=125, max1=126, max2=125, max3=126, 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] [L587] i2 ++ VAL [ep12=255, ep13=1, ep21=255, ep23=1, ep31=255, ep32=0, id1=1, id2=125, id3=126, m1=126, m2=1, m3=125, max1=126, max2=125, max3=126, 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] [L568] COND TRUE i2 < 6 [L78] _Bool newmax ; [L81] newmax = (_Bool)0 [L82] COND FALSE !(\read(mode1)) [L110] COND FALSE !((int )r1 < 1) [L122] mode1 = (_Bool)1 [L129] _Bool newmax ; [L132] newmax = (_Bool)0 [L133] COND FALSE !(\read(mode2)) [L161] COND TRUE (int )r2 < 2 [L162] COND TRUE \read(ep21) [L163] COND FALSE !(\read(newmax2)) [L167] COND TRUE \read(ep23) [L168] COND FALSE !(\read(newmax2)) [L173] mode2 = (_Bool)1 [L180] _Bool newmax ; [L183] newmax = (_Bool)0 [L184] COND FALSE !(\read(mode3)) [L212] COND TRUE (int )r3 < 2 [L213] COND TRUE \read(ep31) [L214] COND FALSE !(\read(newmax3)) [L218] COND FALSE !(\read(ep32)) [L224] mode3 = (_Bool)1 [L573] p12_old = p12_new [L574] p12_new = nomsg [L575] p13_old = p13_new [L576] p13_new = nomsg [L577] p21_old = p21_new [L578] p21_new = nomsg [L579] p23_old = p23_new [L580] p23_new = nomsg [L581] p31_old = p31_new [L582] p31_new = nomsg [L583] p32_old = p32_new [L584] p32_new = nomsg [L462] int tmp ; VAL [ep12=255, ep13=1, ep21=255, ep23=1, ep31=255, ep32=0, id1=1, id2=125, id3=126, m1=126, m2=1, m3=125, max1=126, max2=125, max3=126, 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] [L465] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=255, ep13=1, ep21=255, ep23=1, ep31=255, ep32=0, id1=1, id2=125, id3=126, m1=126, m2=1, m3=125, max1=126, max2=125, max3=126, 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] [L466] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=255, ep13=1, ep21=255, ep23=1, ep31=255, ep32=0, id1=1, id2=125, id3=126, m1=126, m2=1, m3=125, max1=126, max2=125, max3=126, 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] [L467] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=255, ep13=1, ep21=255, ep23=1, ep31=255, ep32=0, id1=1, id2=125, id3=126, m1=126, m2=1, m3=125, max1=126, max2=125, max3=126, 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] [L468] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=255, ep13=1, ep21=255, ep23=1, ep31=255, ep32=0, id1=1, id2=125, id3=126, m1=126, m2=1, m3=125, max1=126, max2=125, max3=126, 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] [L469] COND FALSE !((int )r1 >= 2) VAL [ep12=255, ep13=1, ep21=255, ep23=1, ep31=255, ep32=0, id1=1, id2=125, id3=126, m1=126, m2=1, m3=125, max1=126, max2=125, max3=126, 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] [L472] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=255, ep13=1, ep21=255, ep23=1, ep31=255, ep32=0, id1=1, id2=125, id3=126, m1=126, m2=1, m3=125, max1=126, max2=125, max3=126, 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] [L474] COND TRUE (int )r1 < 2 VAL [ep12=255, ep13=1, ep21=255, ep23=1, ep31=255, ep32=0, id1=1, id2=125, id3=126, m1=126, m2=1, m3=125, max1=126, max2=125, max3=126, 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=255, ep13=1, ep21=255, ep23=1, ep31=255, ep32=0, id1=1, id2=125, id3=126, m1=126, m2=1, m3=125, max1=126, max2=125, max3=126, 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 )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=255, ep13=1, ep21=255, ep23=1, ep31=255, ep32=0, id1=1, id2=125, id3=126, m1=126, m2=1, m3=125, max1=126, max2=125, max3=126, 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 [L485] tmp = 1 VAL [ep12=255, ep13=1, ep21=255, ep23=1, ep31=255, ep32=0, id1=1, id2=125, id3=126, m1=126, m2=1, m3=125, max1=126, max2=125, max3=126, 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] [L513] return (tmp); [L585] c1 = check() [L598] COND FALSE !(! arg) VAL [ep12=255, ep13=1, ep21=255, ep23=1, ep31=255, ep32=0, id1=1, id2=125, id3=126, m1=126, m2=1, m3=125, max1=126, max2=125, max3=126, 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] [L587] i2 ++ VAL [ep12=255, ep13=1, ep21=255, ep23=1, ep31=255, ep32=0, id1=1, id2=125, id3=126, m1=126, m2=1, m3=125, max1=126, max2=125, max3=126, 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] [L568] COND TRUE i2 < 6 [L78] _Bool newmax ; [L81] newmax = (_Bool)0 [L82] COND TRUE \read(mode1) [L83] r1 = (char )((int )r1 + 1) [L84] COND TRUE \read(ep21) [L85] m1 = p21_old [L86] p21_old = nomsg [L87] COND FALSE !((int )m1 > (int )max1) [L92] COND TRUE \read(ep31) [L93] m1 = p31_old [L94] p31_old = nomsg [L95] COND FALSE !((int )m1 > (int )max1) [L100] newmax1 = newmax [L101] COND TRUE (int )r1 == 2 [L102] COND FALSE !((int )max1 == (int )id1) [L105] nl1 = (char)1 [L108] mode1 = (_Bool)0 [L129] _Bool newmax ; [L132] newmax = (_Bool)0 [L133] COND TRUE \read(mode2) [L134] r2 = (char )((int )r2 + 1) [L135] COND TRUE \read(ep12) [L136] m2 = p12_old [L137] p12_old = nomsg [L138] COND FALSE !((int )m2 > (int )max2) [L143] COND FALSE !(\read(ep32)) [L151] newmax2 = newmax [L152] COND TRUE (int )r2 == 2 [L153] COND TRUE (int )max2 == (int )id2 [L154] st2 = (char)1 [L159] mode2 = (_Bool)0 [L180] _Bool newmax ; [L183] newmax = (_Bool)0 [L184] COND TRUE \read(mode3) [L185] r3 = (char )((int )r3 + 1) [L186] COND TRUE \read(ep13) [L187] m3 = p13_old [L188] p13_old = nomsg [L189] COND FALSE !((int )m3 > (int )max3) [L194] COND TRUE \read(ep23) [L195] m3 = p23_old [L196] p23_old = nomsg [L197] COND FALSE !((int )m3 > (int )max3) [L202] newmax3 = newmax [L203] COND TRUE (int )r3 == 2 [L204] COND TRUE (int )max3 == (int )id3 [L205] st3 = (char)1 [L210] mode3 = (_Bool)0 [L573] p12_old = p12_new [L574] p12_new = nomsg [L575] p13_old = p13_new [L576] p13_new = nomsg [L577] p21_old = p21_new [L578] p21_new = nomsg [L579] p23_old = p23_new [L580] p23_new = nomsg [L581] p31_old = p31_new [L582] p31_new = nomsg [L583] p32_old = p32_new [L584] p32_new = nomsg [L462] int tmp ; VAL [ep12=255, ep13=1, ep21=255, ep23=1, ep31=255, ep32=0, id1=1, id2=125, id3=126, m1=-1, m2=-1, m3=-1, max1=126, max2=125, max3=126, 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] [L465] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L511] tmp = 0 VAL [ep12=255, ep13=1, ep21=255, ep23=1, ep31=255, ep32=0, id1=1, id2=125, id3=126, m1=-1, m2=-1, m3=-1, max1=126, max2=125, max3=126, 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] [L513] return (tmp); [L585] c1 = check() [L598] COND TRUE ! arg VAL [ep12=255, ep13=1, ep21=255, ep23=1, ep31=255, ep32=0, id1=1, id2=125, id3=126, m1=-1, m2=-1, m3=-1, max1=126, max2=125, max3=126, 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] [L3] __assert_fail("0", "pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c", 3, "reach_error") VAL [ep12=255, ep13=1, ep21=255, ep23=1, ep31=255, ep32=0, id1=1, id2=125, id3=126, m1=-1, m2=-1, m3=-1, max1=126, max2=125, max3=126, 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.29 ms. Allocated memory is still 100.7 MB. Free memory is still 60.4 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 550.74 ms. Allocated memory is still 100.7 MB. Free memory was 72.6 MB in the beginning and 70.3 MB in the end (delta: 2.3 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 89.94 ms. Allocated memory is still 100.7 MB. Free memory was 70.3 MB in the beginning and 67.3 MB in the end (delta: 3.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 70.11 ms. Allocated memory is still 100.7 MB. Free memory was 67.3 MB in the beginning and 64.9 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 4516.75 ms. Allocated memory was 100.7 MB in the beginning and 153.1 MB in the end (delta: 52.4 MB). Free memory was 64.6 MB in the beginning and 111.4 MB in the end (delta: -46.8 MB). Peak memory consumption was 77.2 MB. Max. memory is 16.1 GB. * CodeCheck took 349713.10 ms. Allocated memory was 153.1 MB in the beginning and 599.8 MB in the end (delta: 446.7 MB). Free memory was 111.4 MB in the beginning and 305.1 MB in the end (delta: -193.7 MB). Peak memory consumption was 254.1 MB. Max. memory is 16.1 GB. * Witness Printer took 223.91 ms. Allocated memory is still 599.8 MB. Free memory was 305.1 MB in the beginning and 282.0 MB in the end (delta: 23.1 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.1 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...