./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_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_dd6aa69b-8d17-436b-9a45-c1138dcd6604/bin/ukojak/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_dd6aa69b-8d17-436b-9a45-c1138dcd6604/bin/ukojak/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_dd6aa69b-8d17-436b-9a45-c1138dcd6604/bin/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_dd6aa69b-8d17-436b-9a45-c1138dcd6604/bin/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.4.ufo.BOUNDED-6.pals.c -s /tmp/vcloud-vcloud-master/worker/run_dir_dd6aa69b-8d17-436b-9a45-c1138dcd6604/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_dd6aa69b-8d17-436b-9a45-c1138dcd6604/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 3b6bb83e9069fd445b2fecdf306b1585c7d1cde8 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-29 18:40:06,648 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-29 18:40:06,651 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-29 18:40:06,778 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-29 18:40:06,780 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-29 18:40:06,785 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-29 18:40:06,789 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-29 18:40:06,794 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-29 18:40:06,797 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-29 18:40:06,805 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-29 18:40:06,806 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-29 18:40:06,809 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-29 18:40:06,809 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-29 18:40:06,814 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-29 18:40:06,815 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-29 18:40:06,818 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-29 18:40:06,820 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-29 18:40:06,824 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-29 18:40:06,828 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-29 18:40:06,837 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-29 18:40:06,840 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-29 18:40:06,842 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-29 18:40:06,844 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-29 18:40:06,846 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-29 18:40:06,857 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-29 18:40:06,858 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-29 18:40:06,859 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-29 18:40:06,862 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-29 18:40:06,863 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-29 18:40:06,864 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-29 18:40:06,865 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-29 18:40:06,867 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-29 18:40:06,869 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-29 18:40:06,871 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-29 18:40:06,872 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-29 18:40:06,873 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-29 18:40:06,874 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-29 18:40:06,875 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-29 18:40:06,875 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-29 18:40:06,876 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-29 18:40:06,879 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-29 18:40:06,882 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_dd6aa69b-8d17-436b-9a45-c1138dcd6604/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2020-11-29 18:40:06,930 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-29 18:40:06,930 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-29 18:40:06,932 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-11-29 18:40:06,933 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2020-11-29 18:40:06,934 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-29 18:40:06,934 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-29 18:40:06,934 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-29 18:40:06,935 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-29 18:40:06,935 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-29 18:40:06,935 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-29 18:40:06,936 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-29 18:40:06,937 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-29 18:40:06,937 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-29 18:40:06,937 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-29 18:40:06,938 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-29 18:40:06,938 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-29 18:40:06,938 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-29 18:40:06,939 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-29 18:40:06,939 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2020-11-29 18:40:06,939 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2020-11-29 18:40:06,939 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-29 18:40:06,940 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-29 18:40:06,940 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2020-11-29 18:40:06,940 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-29 18:40:06,941 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-29 18:40:06,941 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-29 18:40:06,941 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2020-11-29 18:40:06,942 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-29 18:40:06,942 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-29 18:40:06,944 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_dd6aa69b-8d17-436b-9a45-c1138dcd6604/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_dd6aa69b-8d17-436b-9a45-c1138dcd6604/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 -> 3b6bb83e9069fd445b2fecdf306b1585c7d1cde8 [2020-11-29 18:40:07,277 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-29 18:40:07,301 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-29 18:40:07,305 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-29 18:40:07,306 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-29 18:40:07,307 INFO L275 PluginConnector]: CDTParser initialized [2020-11-29 18:40:07,308 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_dd6aa69b-8d17-436b-9a45-c1138dcd6604/bin/ukojak/../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.4.ufo.BOUNDED-6.pals.c [2020-11-29 18:40:07,408 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_dd6aa69b-8d17-436b-9a45-c1138dcd6604/bin/ukojak/data/110b0724d/3a6107293d9a4ed89f5d8aa4852d3a88/FLAGa67e233a6 [2020-11-29 18:40:08,043 INFO L306 CDTParser]: Found 1 translation units. [2020-11-29 18:40:08,044 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_dd6aa69b-8d17-436b-9a45-c1138dcd6604/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.4.ufo.BOUNDED-6.pals.c [2020-11-29 18:40:08,058 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_dd6aa69b-8d17-436b-9a45-c1138dcd6604/bin/ukojak/data/110b0724d/3a6107293d9a4ed89f5d8aa4852d3a88/FLAGa67e233a6 [2020-11-29 18:40:08,353 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_dd6aa69b-8d17-436b-9a45-c1138dcd6604/bin/ukojak/data/110b0724d/3a6107293d9a4ed89f5d8aa4852d3a88 [2020-11-29 18:40:08,356 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-29 18:40:08,358 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-29 18:40:08,364 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-29 18:40:08,364 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-29 18:40:08,369 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-29 18:40:08,371 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:40:08" (1/1) ... [2020-11-29 18:40:08,373 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ca76dd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:40:08, skipping insertion in model container [2020-11-29 18:40:08,374 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:40:08" (1/1) ... [2020-11-29 18:40:08,384 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-29 18:40:08,461 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-29 18:40:08,766 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 18:40:08,779 INFO L203 MainTranslator]: Completed pre-run [2020-11-29 18:40:08,906 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 18:40:08,925 INFO L208 MainTranslator]: Completed translation [2020-11-29 18:40:08,926 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:40:08 WrapperNode [2020-11-29 18:40:08,926 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-29 18:40:08,928 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-29 18:40:08,928 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-29 18:40:08,928 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-29 18:40:08,942 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:40:08" (1/1) ... [2020-11-29 18:40:08,967 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:40:08" (1/1) ... [2020-11-29 18:40:09,042 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-29 18:40:09,043 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-29 18:40:09,044 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-29 18:40:09,044 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-29 18:40:09,055 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:40:08" (1/1) ... [2020-11-29 18:40:09,055 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:40:08" (1/1) ... [2020-11-29 18:40:09,060 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:40:08" (1/1) ... [2020-11-29 18:40:09,061 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:40:08" (1/1) ... [2020-11-29 18:40:09,073 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:40:08" (1/1) ... [2020-11-29 18:40:09,084 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:40:08" (1/1) ... [2020-11-29 18:40:09,089 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:40:08" (1/1) ... [2020-11-29 18:40:09,095 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-29 18:40:09,097 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-29 18:40:09,097 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-29 18:40:09,097 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-29 18:40:09,098 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:40:08" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_dd6aa69b-8d17-436b-9a45-c1138dcd6604/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-29 18:40:09,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-29 18:40:09,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-29 18:40:09,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-29 18:40:09,197 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-29 18:40:12,982 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-29 18:40:12,983 INFO L298 CfgBuilder]: Removed 19 assume(true) statements. [2020-11-29 18:40:12,987 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:40:12 BoogieIcfgContainer [2020-11-29 18:40:12,987 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-29 18:40:12,990 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2020-11-29 18:40:12,992 INFO L271 PluginConnector]: Initializing CodeCheck... [2020-11-29 18:40:13,005 INFO L275 PluginConnector]: CodeCheck initialized [2020-11-29 18:40:13,005 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:40:12" (1/1) ... [2020-11-29 18:40:13,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:40:13,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:40:13,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 19 states and 30 transitions. [2020-11-29 18:40:13,070 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 30 transitions. [2020-11-29 18:40:13,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-11-29 18:40:13,074 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:40:13,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:40:13,852 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-29 18:40:14,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:40:14,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 21 states and 34 transitions. [2020-11-29 18:40:14,006 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 34 transitions. [2020-11-29 18:40:14,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-11-29 18:40:14,007 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:40:14,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:40:14,236 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-29 18:40:14,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:40:14,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 24 states and 41 transitions. [2020-11-29 18:40:14,708 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 41 transitions. [2020-11-29 18:40:14,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-11-29 18:40:14,711 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:40:14,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:40:14,969 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-29 18:40:15,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:40:15,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 28 states and 50 transitions. [2020-11-29 18:40:15,753 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 50 transitions. [2020-11-29 18:40:15,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-29 18:40:15,754 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:40:15,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:40:16,011 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-29 18:40:16,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:40:16,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 33 states and 60 transitions. [2020-11-29 18:40:16,965 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 60 transitions. [2020-11-29 18:40:16,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-29 18:40:16,966 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:40:17,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:40:17,113 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-29 18:40:17,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:40:17,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 37 states and 68 transitions. [2020-11-29 18:40:17,571 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 68 transitions. [2020-11-29 18:40:17,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-29 18:40:17,572 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:40:17,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:40:17,809 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-29 18:40:19,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:40:19,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 43 states and 80 transitions. [2020-11-29 18:40:19,075 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 80 transitions. [2020-11-29 18:40:19,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-29 18:40:19,076 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:40:19,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:40:19,192 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-29 18:40:19,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:40:19,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 44 states and 81 transitions. [2020-11-29 18:40:19,443 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 81 transitions. [2020-11-29 18:40:19,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-29 18:40:19,444 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:40:19,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:40:19,761 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-29 18:40:20,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:40:20,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 51 states and 92 transitions. [2020-11-29 18:40:20,669 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 92 transitions. [2020-11-29 18:40:20,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-29 18:40:20,672 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:40:20,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:40:20,785 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-29 18:40:20,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:40:20,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 52 states and 93 transitions. [2020-11-29 18:40:20,924 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 93 transitions. [2020-11-29 18:40:20,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-29 18:40:20,925 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:40:20,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:40:21,154 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-29 18:40:21,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:40:21,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 55 states and 99 transitions. [2020-11-29 18:40:21,333 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 99 transitions. [2020-11-29 18:40:21,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-29 18:40:21,334 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:40:21,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:40:22,242 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 16 [2020-11-29 18:40:22,380 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-29 18:40:25,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:40:25,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 71 states and 130 transitions. [2020-11-29 18:40:25,435 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 130 transitions. [2020-11-29 18:40:25,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-29 18:40:25,436 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:40:25,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:40:25,819 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-29 18:40:27,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:40:27,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 78 states and 150 transitions. [2020-11-29 18:40:27,682 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 150 transitions. [2020-11-29 18:40:27,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-29 18:40:27,683 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:40:27,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:40:27,906 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-29 18:40:28,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:40:28,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 79 states and 152 transitions. [2020-11-29 18:40:28,421 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 152 transitions. [2020-11-29 18:40:28,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-29 18:40:28,423 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:40:28,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:40:28,722 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-29 18:40:31,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:40:31,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 87 states and 174 transitions. [2020-11-29 18:40:31,446 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 174 transitions. [2020-11-29 18:40:31,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-29 18:40:31,447 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:40:31,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:40:31,564 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-29 18:40:32,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:40:32,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 88 states and 176 transitions. [2020-11-29 18:40:32,088 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 176 transitions. [2020-11-29 18:40:32,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-29 18:40:32,090 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:40:32,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:40:32,564 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-29 18:40:33,882 WARN L193 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2020-11-29 18:40:35,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:40:35,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 95 states and 199 transitions. [2020-11-29 18:40:35,821 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 199 transitions. [2020-11-29 18:40:35,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-29 18:40:35,822 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:40:35,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:40:35,973 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-29 18:40:37,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:40:37,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 97 states and 203 transitions. [2020-11-29 18:40:37,304 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 203 transitions. [2020-11-29 18:40:37,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-29 18:40:37,305 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:40:37,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:40:37,450 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-29 18:40:38,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:40:38,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 98 states and 205 transitions. [2020-11-29 18:40:38,101 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 205 transitions. [2020-11-29 18:40:38,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-29 18:40:38,102 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:40:38,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:40:38,253 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-29 18:40:38,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:40:38,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 99 states and 208 transitions. [2020-11-29 18:40:38,964 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 208 transitions. [2020-11-29 18:40:38,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-29 18:40:38,968 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:40:39,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:40:40,002 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-29 18:40:44,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:40:44,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 118 states and 240 transitions. [2020-11-29 18:40:44,067 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 240 transitions. [2020-11-29 18:40:44,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-11-29 18:40:44,068 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:40:44,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:40:44,227 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-29 18:40:45,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:40:45,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 123 states and 252 transitions. [2020-11-29 18:40:45,725 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 252 transitions. [2020-11-29 18:40:45,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-11-29 18:40:45,726 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:40:45,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:40:46,897 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-29 18:40:47,692 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 20 [2020-11-29 18:40:48,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:40:48,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 126 states and 254 transitions. [2020-11-29 18:40:48,543 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 254 transitions. [2020-11-29 18:40:48,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-11-29 18:40:48,544 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:40:48,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:40:49,684 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-29 18:40:58,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:40:58,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 155 states and 315 transitions. [2020-11-29 18:40:58,147 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 315 transitions. [2020-11-29 18:40:58,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-11-29 18:40:58,148 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:40:58,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:40:58,325 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-29 18:40:59,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:40:59,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 160 states and 322 transitions. [2020-11-29 18:40:59,253 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 322 transitions. [2020-11-29 18:40:59,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-11-29 18:40:59,254 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:40:59,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:41:00,434 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-29 18:41:10,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:41:10,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 190 states and 377 transitions. [2020-11-29 18:41:10,335 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 377 transitions. [2020-11-29 18:41:10,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-11-29 18:41:10,336 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:41:10,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:41:10,457 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-29 18:41:12,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:41:12,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 196 states and 384 transitions. [2020-11-29 18:41:12,442 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 384 transitions. [2020-11-29 18:41:12,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-11-29 18:41:12,443 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:41:12,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:41:12,545 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-29 18:41:13,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:41:13,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 197 states and 386 transitions. [2020-11-29 18:41:13,632 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 386 transitions. [2020-11-29 18:41:13,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-11-29 18:41:13,633 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:41:13,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:41:14,975 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:41:23,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:41:23,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 208 states and 412 transitions. [2020-11-29 18:41:23,223 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 412 transitions. [2020-11-29 18:41:23,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-11-29 18:41:23,224 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:41:23,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:41:23,333 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:41:24,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:41:24,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 209 states and 414 transitions. [2020-11-29 18:41:24,648 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 414 transitions. [2020-11-29 18:41:24,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-11-29 18:41:24,649 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:41:24,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:41:24,757 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:41:26,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:41:26,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 211 states and 423 transitions. [2020-11-29 18:41:26,812 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 423 transitions. [2020-11-29 18:41:26,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-11-29 18:41:26,813 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:41:26,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:41:26,935 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:41:28,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:41:28,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 213 states and 430 transitions. [2020-11-29 18:41:28,947 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 430 transitions. [2020-11-29 18:41:28,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-11-29 18:41:28,948 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:41:29,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:41:29,053 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:41:31,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:41:31,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 215 states and 438 transitions. [2020-11-29 18:41:31,222 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 438 transitions. [2020-11-29 18:41:31,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-11-29 18:41:31,223 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:41:31,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:41:33,134 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:41:44,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:41:44,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 227 states and 471 transitions. [2020-11-29 18:41:44,633 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 471 transitions. [2020-11-29 18:41:44,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-11-29 18:41:44,634 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:41:44,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:41:44,728 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:41:49,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:41:49,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 231 states and 487 transitions. [2020-11-29 18:41:49,845 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 487 transitions. [2020-11-29 18:41:49,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-11-29 18:41:49,846 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:41:49,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:41:49,940 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:41:52,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:41:52,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 233 states and 497 transitions. [2020-11-29 18:41:52,464 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 497 transitions. [2020-11-29 18:41:52,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-11-29 18:41:52,465 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:41:52,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:41:52,574 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:41:54,100 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2020-11-29 18:41:55,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:41:55,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 235 states and 501 transitions. [2020-11-29 18:41:55,453 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 501 transitions. [2020-11-29 18:41:55,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-11-29 18:41:55,454 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:41:55,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:41:55,548 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:41:58,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:41:58,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 237 states and 507 transitions. [2020-11-29 18:41:58,224 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 507 transitions. [2020-11-29 18:41:58,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-11-29 18:41:58,225 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:41:58,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:41:58,320 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:41:59,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:41:59,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 238 states and 509 transitions. [2020-11-29 18:41:59,724 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 509 transitions. [2020-11-29 18:41:59,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-11-29 18:41:59,724 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:41:59,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:41:59,815 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:42:01,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:42:01,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 239 states and 511 transitions. [2020-11-29 18:42:01,275 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 511 transitions. [2020-11-29 18:42:01,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-11-29 18:42:01,276 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:42:01,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:42:01,368 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:42:01,658 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 28 [2020-11-29 18:42:03,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:42:03,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 241 states and 519 transitions. [2020-11-29 18:42:03,934 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 519 transitions. [2020-11-29 18:42:03,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-11-29 18:42:03,935 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:42:04,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:42:06,902 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:42:08,835 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 32 [2020-11-29 18:42:16,636 WARN L193 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 32 [2020-11-29 18:42:16,919 WARN L193 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 33 [2020-11-29 18:42:18,326 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2020-11-29 18:42:18,639 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2020-11-29 18:42:23,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:42:23,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 253 states and 550 transitions. [2020-11-29 18:42:23,455 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 550 transitions. [2020-11-29 18:42:23,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-11-29 18:42:23,456 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:42:23,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:42:23,972 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:42:26,408 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 24 [2020-11-29 18:42:27,663 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 27 [2020-11-29 18:42:29,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:42:29,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 256 states and 561 transitions. [2020-11-29 18:42:29,228 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 561 transitions. [2020-11-29 18:42:29,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-11-29 18:42:29,229 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:42:29,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:42:29,582 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:42:30,014 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2020-11-29 18:42:32,525 WARN L193 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2020-11-29 18:42:37,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:42:37,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 260 states and 576 transitions. [2020-11-29 18:42:37,371 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 576 transitions. [2020-11-29 18:42:37,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-11-29 18:42:37,372 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:42:37,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:42:37,750 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:42:38,151 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 29 [2020-11-29 18:42:38,368 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 31 [2020-11-29 18:42:39,761 WARN L193 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 33 [2020-11-29 18:42:40,042 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 29 [2020-11-29 18:42:45,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:42:45,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 264 states and 584 transitions. [2020-11-29 18:42:45,388 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 584 transitions. [2020-11-29 18:42:45,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-11-29 18:42:45,389 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:42:45,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:42:45,731 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:42:46,407 WARN L193 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2020-11-29 18:42:46,862 WARN L193 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2020-11-29 18:42:47,661 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2020-11-29 18:42:48,361 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2020-11-29 18:42:48,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:42:48,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 265 states and 586 transitions. [2020-11-29 18:42:48,413 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 586 transitions. [2020-11-29 18:42:48,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-11-29 18:42:48,414 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:42:48,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:42:48,760 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:42:49,409 WARN L193 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2020-11-29 18:42:49,842 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2020-11-29 18:42:50,698 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2020-11-29 18:42:51,590 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2020-11-29 18:42:53,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:42:53,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 267 states and 589 transitions. [2020-11-29 18:42:53,861 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 589 transitions. [2020-11-29 18:42:53,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-11-29 18:42:53,862 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:42:54,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:42:54,200 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:42:54,776 WARN L193 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2020-11-29 18:42:55,191 WARN L193 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 39 [2020-11-29 18:42:55,931 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2020-11-29 18:42:56,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:42:56,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 268 states and 590 transitions. [2020-11-29 18:42:56,689 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 590 transitions. [2020-11-29 18:42:56,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-11-29 18:42:56,690 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:42:56,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:42:57,011 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:42:57,528 WARN L193 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 34 [2020-11-29 18:42:57,869 WARN L193 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 35 [2020-11-29 18:42:59,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:42:59,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 269 states and 591 transitions. [2020-11-29 18:42:59,310 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 591 transitions. [2020-11-29 18:42:59,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-11-29 18:42:59,311 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:42:59,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:42:59,746 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:43:01,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:43:01,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 270 states and 591 transitions. [2020-11-29 18:43:01,192 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 591 transitions. [2020-11-29 18:43:01,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-11-29 18:43:01,193 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:43:01,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:43:02,869 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:43:10,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:43:10,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 274 states and 603 transitions. [2020-11-29 18:43:10,960 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 603 transitions. [2020-11-29 18:43:10,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-11-29 18:43:10,961 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:43:11,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:43:11,062 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:43:11,402 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 28 [2020-11-29 18:43:18,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:43:18,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 279 states and 618 transitions. [2020-11-29 18:43:18,006 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 618 transitions. [2020-11-29 18:43:18,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-11-29 18:43:18,007 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:43:18,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:43:18,101 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:43:19,013 WARN L193 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 30 [2020-11-29 18:43:20,940 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 25 [2020-11-29 18:43:23,691 WARN L193 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 34 [2020-11-29 18:43:24,033 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2020-11-29 18:43:25,764 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2020-11-29 18:43:26,321 WARN L193 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 32 [2020-11-29 18:43:26,704 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-11-29 18:43:28,455 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2020-11-29 18:43:29,022 WARN L193 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 26 [2020-11-29 18:43:31,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:43:31,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 284 states and 635 transitions. [2020-11-29 18:43:31,326 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 635 transitions. [2020-11-29 18:43:31,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-11-29 18:43:31,327 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:43:31,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:43:31,412 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:43:32,154 WARN L193 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 35 [2020-11-29 18:43:32,601 WARN L193 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2020-11-29 18:43:33,476 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-11-29 18:43:34,452 WARN L193 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2020-11-29 18:43:34,940 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 24 [2020-11-29 18:43:35,282 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2020-11-29 18:43:39,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:43:39,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 287 states and 640 transitions. [2020-11-29 18:43:39,079 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 640 transitions. [2020-11-29 18:43:39,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-11-29 18:43:39,079 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:43:39,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:43:39,176 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:43:39,744 WARN L193 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 32 [2020-11-29 18:43:42,274 WARN L193 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 29 [2020-11-29 18:43:44,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:43:44,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 289 states and 645 transitions. [2020-11-29 18:43:44,438 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 645 transitions. [2020-11-29 18:43:44,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-11-29 18:43:44,439 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:43:44,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:43:44,535 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:43:45,062 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 18 [2020-11-29 18:43:46,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:43:46,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 290 states and 645 transitions. [2020-11-29 18:43:46,973 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 645 transitions. [2020-11-29 18:43:46,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-11-29 18:43:46,974 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:43:47,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:43:47,066 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:43:49,648 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2020-11-29 18:43:50,510 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-11-29 18:43:50,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:43:50,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 292 states and 651 transitions. [2020-11-29 18:43:50,544 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 651 transitions. [2020-11-29 18:43:50,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-11-29 18:43:50,545 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:43:50,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:43:50,618 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:43:50,989 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 27 [2020-11-29 18:43:54,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:43:54,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 294 states and 659 transitions. [2020-11-29 18:43:54,949 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 659 transitions. [2020-11-29 18:43:54,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-11-29 18:43:54,950 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:43:54,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:43:55,047 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:43:55,568 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 22 [2020-11-29 18:43:55,926 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2020-11-29 18:43:57,515 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2020-11-29 18:43:58,126 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 20 [2020-11-29 18:43:58,623 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2020-11-29 18:44:00,411 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2020-11-29 18:44:00,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:44:00,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 296 states and 662 transitions. [2020-11-29 18:44:00,461 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 662 transitions. [2020-11-29 18:44:00,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-11-29 18:44:00,461 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:44:00,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:44:00,551 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:44:01,182 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 29 [2020-11-29 18:44:05,497 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 27 [2020-11-29 18:44:07,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:44:07,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 299 states and 671 transitions. [2020-11-29 18:44:07,779 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 671 transitions. [2020-11-29 18:44:07,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-11-29 18:44:07,780 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:44:07,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:44:07,868 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:44:10,950 WARN L193 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 24 [2020-11-29 18:44:11,452 WARN L193 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2020-11-29 18:44:13,342 WARN L193 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2020-11-29 18:44:13,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:44:13,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 301 states and 678 transitions. [2020-11-29 18:44:13,402 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 678 transitions. [2020-11-29 18:44:13,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-11-29 18:44:13,403 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:44:13,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:44:13,487 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:44:14,160 WARN L193 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 31 [2020-11-29 18:44:14,589 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2020-11-29 18:44:16,732 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2020-11-29 18:44:16,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:44:16,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 302 states and 678 transitions. [2020-11-29 18:44:16,774 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 678 transitions. [2020-11-29 18:44:16,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-11-29 18:44:16,775 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:44:16,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:44:16,826 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-11-29 18:44:18,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:44:18,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 302 states and 677 transitions. [2020-11-29 18:44:18,067 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 677 transitions. [2020-11-29 18:44:18,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-11-29 18:44:18,068 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:44:18,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:44:26,332 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-29 18:44:30,858 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2020-11-29 18:44:32,392 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 33 [2020-11-29 18:44:34,844 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2020-11-29 18:44:35,365 WARN L193 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 35 [2020-11-29 18:44:37,854 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2020-11-29 18:44:38,398 WARN L193 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2020-11-29 18:44:41,282 WARN L193 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 32 [2020-11-29 18:44:43,494 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 25 [2020-11-29 18:44:45,014 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 26 [2020-11-29 18:44:47,675 WARN L193 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 35 [2020-11-29 18:44:48,236 WARN L193 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 36 [2020-11-29 18:44:49,388 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-11-29 18:44:50,507 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-11-29 18:44:51,576 WARN L193 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 35 [2020-11-29 18:44:52,757 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2020-11-29 18:44:53,206 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 20 [2020-11-29 18:45:05,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:45:05,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 315 states and 717 transitions. [2020-11-29 18:45:05,123 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 717 transitions. [2020-11-29 18:45:05,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-11-29 18:45:05,124 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:45:05,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:45:05,188 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-11-29 18:45:06,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:45:06,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 316 states and 718 transitions. [2020-11-29 18:45:06,823 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 718 transitions. [2020-11-29 18:45:06,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-11-29 18:45:06,823 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:45:07,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:45:07,282 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-29 18:45:07,883 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 20 [2020-11-29 18:45:11,002 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 23 [2020-11-29 18:45:11,579 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 22 [2020-11-29 18:45:13,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:45:13,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 318 states and 720 transitions. [2020-11-29 18:45:13,832 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 720 transitions. [2020-11-29 18:45:13,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-11-29 18:45:13,832 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:45:14,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:45:14,107 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-29 18:45:14,958 WARN L193 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 28 [2020-11-29 18:45:15,567 WARN L193 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 37 [2020-11-29 18:45:17,897 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2020-11-29 18:45:19,371 WARN L193 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2020-11-29 18:45:20,680 WARN L193 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2020-11-29 18:45:21,407 WARN L193 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 32 [2020-11-29 18:45:22,225 WARN L193 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 33 [2020-11-29 18:45:23,437 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2020-11-29 18:45:24,776 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2020-11-29 18:45:24,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:45:24,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 321 states and 724 transitions. [2020-11-29 18:45:24,871 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 724 transitions. [2020-11-29 18:45:24,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-11-29 18:45:24,872 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:45:25,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:45:25,135 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-29 18:45:25,767 WARN L193 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 23 [2020-11-29 18:45:26,350 WARN L193 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 24 [2020-11-29 18:45:28,790 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 23 [2020-11-29 18:45:29,294 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 24 [2020-11-29 18:45:31,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:45:31,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 324 states and 726 transitions. [2020-11-29 18:45:31,507 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 726 transitions. [2020-11-29 18:45:31,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-11-29 18:45:31,507 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:45:31,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:45:31,900 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-29 18:45:32,574 WARN L193 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2020-11-29 18:45:33,085 WARN L193 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 35 [2020-11-29 18:45:35,882 WARN L193 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 27 [2020-11-29 18:45:36,414 WARN L193 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 30 [2020-11-29 18:45:38,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:45:38,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 326 states and 730 transitions. [2020-11-29 18:45:38,797 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 730 transitions. [2020-11-29 18:45:38,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-11-29 18:45:38,798 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:45:38,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:45:38,861 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-29 18:45:38,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:45:38,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 326 states and 729 transitions. [2020-11-29 18:45:38,935 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 729 transitions. [2020-11-29 18:45:38,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-11-29 18:45:38,936 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:45:40,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 18:45:40,104 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 18:45:40,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 18:45:40,879 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 18:45:41,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 18:45:41,500 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 18:45:42,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 18:45:42,005 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 18:45:42,191 WARN L483 CodeCheckObserver]: This program is UNSAFE, Check terminated with 70 iterations. [2020-11-29 18:45:42,518 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 29.11 06:45:42 ImpRootNode [2020-11-29 18:45:42,518 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2020-11-29 18:45:42,519 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-29 18:45:42,519 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-29 18:45:42,519 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-29 18:45:42,520 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:40:12" (3/4) ... [2020-11-29 18:45:42,522 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-29 18:45:42,708 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_dd6aa69b-8d17-436b-9a45-c1138dcd6604/bin/ukojak/witness.graphml [2020-11-29 18:45:42,709 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-29 18:45:42,710 INFO L168 Benchmark]: Toolchain (without parser) took 334351.96 ms. Allocated memory was 100.7 MB in the beginning and 1.3 GB in the end (delta: 1.2 GB). Free memory was 71.9 MB in the beginning and 764.5 MB in the end (delta: -692.6 MB). Peak memory consumption was 524.1 MB. Max. memory is 16.1 GB. [2020-11-29 18:45:42,710 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 100.7 MB. Free memory was 57.5 MB in the beginning and 57.4 MB in the end (delta: 69.9 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-29 18:45:42,711 INFO L168 Benchmark]: CACSL2BoogieTranslator took 562.93 ms. Allocated memory is still 100.7 MB. Free memory was 71.6 MB in the beginning and 72.5 MB in the end (delta: -958.8 kB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-11-29 18:45:42,711 INFO L168 Benchmark]: Boogie Procedure Inliner took 114.99 ms. Allocated memory is still 100.7 MB. Free memory was 72.5 MB in the beginning and 69.5 MB in the end (delta: 3.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-29 18:45:42,712 INFO L168 Benchmark]: Boogie Preprocessor took 52.38 ms. Allocated memory is still 100.7 MB. Free memory was 69.5 MB in the beginning and 67.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-29 18:45:42,712 INFO L168 Benchmark]: RCFGBuilder took 3890.60 ms. Allocated memory was 100.7 MB in the beginning and 155.2 MB in the end (delta: 54.5 MB). Free memory was 67.4 MB in the beginning and 69.4 MB in the end (delta: -1.9 MB). Peak memory consumption was 55.2 MB. Max. memory is 16.1 GB. [2020-11-29 18:45:42,713 INFO L168 Benchmark]: CodeCheck took 329528.51 ms. Allocated memory was 155.2 MB in the beginning and 1.3 GB in the end (delta: 1.2 GB). Free memory was 69.4 MB in the beginning and 785.4 MB in the end (delta: -716.1 MB). Peak memory consumption was 446.8 MB. Max. memory is 16.1 GB. [2020-11-29 18:45:42,713 INFO L168 Benchmark]: Witness Printer took 190.23 ms. Allocated memory is still 1.3 GB. Free memory was 785.4 MB in the beginning and 764.5 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. [2020-11-29 18:45:42,716 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: 329.1s, OverallIterations: 70, TraceHistogramMax: 0, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: -1741139704 SDtfs, 1595029374 SDslu, 2101377416 SDs, 0 SdLazy, 879535350 SolverSat, -2009668024 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 224.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 22727 GetRequests, 20616 SyntacticMatches, 1179 SemanticMatches, 932 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 472455 ImplicationChecksByTransitivity, 303.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.4s SsaConstructionTime, 7.2s SatisfiabilityAnalysisTime, 25.9s InterpolantComputationTime, 2250 NumberOfCodeBlocks, 2250 NumberOfCodeBlocksAsserted, 70 NumberOfCheckSat, 2133 ConstructedInterpolants, 0 QuantifiedInterpolants, 597222 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 69 InterpolantComputations, 13 PerfectInterpolantSequences, 353/1528 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: [L24] msg_t nomsg = (msg_t )-1; [L25] port_t p12 ; [L26] char p12_old ; [L27] char p12_new ; [L28] _Bool ep12 ; [L29] port_t p13 ; [L30] char p13_old ; [L31] char p13_new ; [L32] _Bool ep13 ; [L33] port_t p21 ; [L34] char p21_old ; [L35] char p21_new ; [L36] _Bool ep21 ; [L37] port_t p23 ; [L38] char p23_old ; [L39] char p23_new ; [L40] _Bool ep23 ; [L41] port_t p31 ; [L42] char p31_old ; [L43] char p31_new ; [L44] _Bool ep31 ; [L45] port_t p32 ; [L46] char p32_old ; [L47] char p32_new ; [L48] _Bool ep32 ; [L49] char id1 ; [L50] char r1 ; [L51] char st1 ; [L52] char nl1 ; [L53] char m1 ; [L54] char max1 ; [L55] _Bool mode1 ; [L56] char id2 ; [L57] char r2 ; [L58] char st2 ; [L59] char nl2 ; [L60] char m2 ; [L61] char max2 ; [L62] _Bool mode2 ; [L63] char id3 ; [L64] char r3 ; [L65] char st3 ; [L66] char nl3 ; [L67] char m3 ; [L68] char max3 ; [L69] _Bool mode3 ; [L476] int c1 ; [L477] int i2 ; [L480] c1 = 0 [L481] ep12 = __VERIFIER_nondet_bool() [L482] ep13 = __VERIFIER_nondet_bool() [L483] ep21 = __VERIFIER_nondet_bool() [L484] ep23 = __VERIFIER_nondet_bool() [L485] ep31 = __VERIFIER_nondet_bool() [L486] ep32 = __VERIFIER_nondet_bool() [L487] id1 = __VERIFIER_nondet_char() [L488] r1 = __VERIFIER_nondet_char() [L489] st1 = __VERIFIER_nondet_char() [L490] nl1 = __VERIFIER_nondet_char() [L491] m1 = __VERIFIER_nondet_char() [L492] max1 = __VERIFIER_nondet_char() [L493] mode1 = __VERIFIER_nondet_bool() [L494] id2 = __VERIFIER_nondet_char() [L495] r2 = __VERIFIER_nondet_char() [L496] st2 = __VERIFIER_nondet_char() [L497] nl2 = __VERIFIER_nondet_char() [L498] m2 = __VERIFIER_nondet_char() [L499] max2 = __VERIFIER_nondet_char() [L500] mode2 = __VERIFIER_nondet_bool() [L501] id3 = __VERIFIER_nondet_char() [L502] r3 = __VERIFIER_nondet_char() [L503] st3 = __VERIFIER_nondet_char() [L504] nl3 = __VERIFIER_nondet_char() [L505] m3 = __VERIFIER_nondet_char() [L506] max3 = __VERIFIER_nondet_char() [L507] mode3 = __VERIFIER_nondet_bool() [L201] _Bool r121 ; [L202] _Bool r131 ; [L203] _Bool r211 ; [L204] _Bool r231 ; [L205] _Bool r311 ; [L206] _Bool r321 ; [L207] _Bool r122 ; [L208] int tmp ; [L209] _Bool r132 ; [L210] int tmp___0 ; [L211] _Bool r212 ; [L212] int tmp___1 ; [L213] _Bool r232 ; [L214] int tmp___2 ; [L215] _Bool r312 ; [L216] int tmp___3 ; [L217] _Bool r322 ; [L218] int tmp___4 ; [L219] int tmp___5 ; [L222] r121 = ep12 [L223] r131 = ep13 [L224] r211 = ep21 [L225] r231 = ep23 [L226] r311 = ep31 [L227] r321 = ep32 [L228] COND FALSE !(\read(r121)) [L231] COND TRUE \read(r131) [L232] COND TRUE \read(ep32) [L233] tmp = 1 [L240] r122 = (_Bool )tmp [L241] COND TRUE \read(r131) [L242] tmp___0 = 1 [L253] r132 = (_Bool )tmp___0 [L254] COND TRUE \read(r211) [L255] tmp___1 = 1 [L266] r212 = (_Bool )tmp___1 [L267] COND FALSE !(\read(r231)) [L270] COND TRUE \read(r211) [L271] COND TRUE \read(ep13) [L272] tmp___2 = 1 [L279] r232 = (_Bool )tmp___2 [L280] COND FALSE !(\read(r311)) [L283] COND TRUE \read(r321) [L284] COND TRUE \read(ep21) [L285] tmp___3 = 1 [L292] r312 = (_Bool )tmp___3 [L293] COND TRUE \read(r321) [L294] tmp___4 = 1 [L305] r322 = (_Bool )tmp___4 [L306] COND TRUE (int )id1 != (int )id2 [L307] COND TRUE (int )id1 != (int )id3 [L308] COND TRUE (int )id2 != (int )id3 [L309] COND TRUE (int )id1 >= 0 [L310] COND TRUE (int )id2 >= 0 [L311] COND TRUE (int )id3 >= 0 [L312] COND TRUE (int )r1 == 0 [L313] COND TRUE (int )r2 == 0 [L314] COND TRUE (int )r3 == 0 [L315] COND TRUE \read(r122) [L316] COND TRUE \read(r132) [L317] COND TRUE \read(r212) [L318] COND TRUE \read(r232) [L319] COND TRUE \read(r312) [L320] COND TRUE \read(r322) [L321] COND TRUE (int )max1 == (int )id1 [L322] COND TRUE (int )max2 == (int )id2 [L323] COND TRUE (int )max3 == (int )id3 [L324] COND TRUE (int )st1 == 0 [L325] COND TRUE (int )st2 == 0 [L326] COND TRUE (int )st3 == 0 [L327] COND TRUE (int )nl1 == 0 [L328] COND TRUE (int )nl2 == 0 [L329] COND TRUE (int )nl3 == 0 [L330] COND TRUE (int )mode1 == 0 [L331] COND TRUE (int )mode2 == 0 [L332] COND TRUE (int )mode3 == 0 [L333] tmp___5 = 1 [L415] return (tmp___5); [L508] i2 = init() [L509] COND FALSE !(!(i2)) [L510] p12_old = nomsg [L511] p12_new = nomsg [L512] p13_old = nomsg [L513] p13_new = nomsg [L514] p21_old = nomsg [L515] p21_new = nomsg [L516] p23_old = nomsg [L517] p23_new = nomsg [L518] p31_old = nomsg [L519] p31_new = nomsg [L520] p32_old = nomsg [L521] p32_new = nomsg [L522] i2 = 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=-2, m2=127, m3=0, max1=1, max2=3, max3=2, mode1=0, mode2=0, mode3=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=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L523] COND TRUE i2 < 6 [L75] COND FALSE !(\read(mode1)) [L100] COND TRUE (int )r1 < 1 [L101] COND FALSE !(\read(ep12)) [L104] COND TRUE \read(ep13) [L105] EXPR max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L105] p13_new = max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L108] mode1 = (_Bool)1 [L118] COND FALSE !(\read(mode2)) [L143] COND TRUE (int )r2 < 2 [L144] COND TRUE \read(ep21) [L145] EXPR max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L145] p21_new = max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L147] COND FALSE !(\read(ep23)) [L151] mode2 = (_Bool)1 [L161] COND FALSE !(\read(mode3)) [L186] COND TRUE (int )r3 < 2 [L187] COND FALSE !(\read(ep31)) [L190] COND TRUE \read(ep32) [L191] EXPR max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L191] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L194] mode3 = (_Bool)1 [L528] p12_old = p12_new [L529] p12_new = nomsg [L530] p13_old = p13_new [L531] p13_new = nomsg [L532] p21_old = p21_new [L533] p21_new = nomsg [L534] p23_old = p23_new [L535] p23_new = nomsg [L536] p31_old = p31_new [L537] p31_new = nomsg [L538] p32_old = p32_new [L539] p32_new = nomsg [L420] int tmp ; VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=-2, m2=127, m3=0, max1=1, max2=3, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L423] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=-2, m2=127, m3=0, max1=1, max2=3, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L424] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=-2, m2=127, m3=0, max1=1, max2=3, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L425] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=-2, m2=127, m3=0, max1=1, max2=3, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L426] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=-2, m2=127, m3=0, max1=1, max2=3, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L427] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=-2, m2=127, m3=0, max1=1, max2=3, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L430] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=-2, m2=127, m3=0, max1=1, max2=3, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L432] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=-2, m2=127, m3=0, max1=1, max2=3, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L437] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=-2, m2=127, m3=0, max1=1, max2=3, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L440] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=-2, m2=127, m3=0, max1=1, max2=3, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L442] COND TRUE (int )r1 < 2 [L443] tmp = 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=-2, m2=127, m3=0, max1=1, max2=3, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L471] return (tmp); [L540] c1 = check() [L553] COND FALSE !(! arg) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=-2, m2=127, m3=0, max1=1, max2=3, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L542] i2 ++ VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=-2, m2=127, m3=0, max1=1, max2=3, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L523] COND TRUE i2 < 6 [L75] COND TRUE \read(mode1) [L76] r1 = (char )((int )r1 + 1) [L77] COND TRUE \read(ep21) [L78] m1 = p21_old [L79] p21_old = nomsg [L80] COND TRUE (int )m1 > (int )max1 [L81] max1 = m1 [L84] COND FALSE !(\read(ep31)) [L91] COND FALSE !((int )r1 == 2) [L98] mode1 = (_Bool)0 [L118] COND TRUE \read(mode2) [L119] r2 = (char )((int )r2 + 1) [L120] COND FALSE !(\read(ep12)) [L127] COND TRUE \read(ep32) [L128] m2 = p32_old [L129] p32_old = nomsg [L130] COND FALSE !((int )m2 > (int )max2) [L134] COND FALSE !((int )r2 == 2) [L141] mode2 = (_Bool)0 [L161] COND TRUE \read(mode3) [L162] r3 = (char )((int )r3 + 1) [L163] COND TRUE \read(ep13) [L164] m3 = p13_old [L165] p13_old = nomsg [L166] COND FALSE !((int )m3 > (int )max3) [L170] COND FALSE !(\read(ep23)) [L177] COND FALSE !((int )r3 == 2) [L184] mode3 = (_Bool)0 [L528] p12_old = p12_new [L529] p12_new = nomsg [L530] p13_old = p13_new [L531] p13_new = nomsg [L532] p21_old = p21_new [L533] p21_new = nomsg [L534] p23_old = p23_new [L535] p23_new = nomsg [L536] p31_old = p31_new [L537] p31_new = nomsg [L538] p32_old = p32_new [L539] p32_new = nomsg [L420] int tmp ; VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=3, m2=2, m3=1, max1=3, max2=3, max3=2, mode1=0, mode2=0, mode3=0, 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] [L423] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=3, m2=2, m3=1, max1=3, max2=3, max3=2, mode1=0, mode2=0, mode3=0, 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] [L424] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=3, m2=2, m3=1, max1=3, max2=3, max3=2, mode1=0, mode2=0, mode3=0, 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] [L425] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=3, m2=2, m3=1, max1=3, max2=3, max3=2, mode1=0, mode2=0, mode3=0, 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] [L426] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=3, m2=2, m3=1, max1=3, max2=3, max3=2, mode1=0, mode2=0, mode3=0, 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] [L427] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=3, m2=2, m3=1, max1=3, max2=3, max3=2, mode1=0, mode2=0, mode3=0, 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] [L430] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=3, m2=2, m3=1, max1=3, max2=3, max3=2, mode1=0, mode2=0, mode3=0, 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] [L432] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=3, m2=2, m3=1, max1=3, max2=3, max3=2, mode1=0, mode2=0, mode3=0, 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] [L437] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=3, m2=2, m3=1, max1=3, max2=3, max3=2, mode1=0, mode2=0, mode3=0, 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] [L440] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=3, m2=2, m3=1, max1=3, max2=3, max3=2, mode1=0, mode2=0, mode3=0, 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] [L442] COND TRUE (int )r1 < 2 [L443] tmp = 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=3, m2=2, m3=1, max1=3, max2=3, max3=2, mode1=0, mode2=0, mode3=0, 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] [L471] return (tmp); [L540] c1 = check() [L553] COND FALSE !(! arg) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=3, m2=2, m3=1, max1=3, max2=3, max3=2, mode1=0, mode2=0, mode3=0, 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] [L542] i2 ++ VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=3, m2=2, m3=1, max1=3, max2=3, max3=2, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L523] COND TRUE i2 < 6 [L75] COND FALSE !(\read(mode1)) [L100] COND FALSE !((int )r1 < 1) [L108] mode1 = (_Bool)1 [L118] COND FALSE !(\read(mode2)) [L143] COND TRUE (int )r2 < 2 [L144] COND TRUE \read(ep21) [L145] EXPR max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L145] p21_new = max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L147] COND FALSE !(\read(ep23)) [L151] mode2 = (_Bool)1 [L161] COND FALSE !(\read(mode3)) [L186] COND TRUE (int )r3 < 2 [L187] COND FALSE !(\read(ep31)) [L190] COND TRUE \read(ep32) [L191] EXPR max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L191] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L194] mode3 = (_Bool)1 [L528] p12_old = p12_new [L529] p12_new = nomsg [L530] p13_old = p13_new [L531] p13_new = nomsg [L532] p21_old = p21_new [L533] p21_new = nomsg [L534] p23_old = p23_new [L535] p23_new = nomsg [L536] p31_old = p31_new [L537] p31_new = nomsg [L538] p32_old = p32_new [L539] p32_new = nomsg [L420] int tmp ; VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=3, m2=2, m3=1, max1=3, max2=3, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L423] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=3, m2=2, m3=1, max1=3, max2=3, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L424] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=3, m2=2, m3=1, max1=3, max2=3, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L425] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=3, m2=2, m3=1, max1=3, max2=3, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L426] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=3, m2=2, m3=1, max1=3, max2=3, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L427] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=3, m2=2, m3=1, max1=3, max2=3, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L430] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=3, m2=2, m3=1, max1=3, max2=3, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L432] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=3, m2=2, m3=1, max1=3, max2=3, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L437] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=3, m2=2, m3=1, max1=3, max2=3, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L440] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=3, m2=2, m3=1, max1=3, max2=3, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L442] COND TRUE (int )r1 < 2 [L443] tmp = 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=3, m2=2, m3=1, max1=3, max2=3, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L471] return (tmp); [L540] c1 = check() [L553] COND FALSE !(! arg) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=3, m2=2, m3=1, max1=3, max2=3, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L542] i2 ++ VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=3, m2=2, m3=1, max1=3, max2=3, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=2, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L523] COND TRUE i2 < 6 [L75] COND TRUE \read(mode1) [L76] r1 = (char )((int )r1 + 1) [L77] COND TRUE \read(ep21) [L78] m1 = p21_old [L79] p21_old = nomsg [L80] COND FALSE !((int )m1 > (int )max1) [L84] COND FALSE !(\read(ep31)) [L91] COND TRUE (int )r1 == 2 [L92] COND FALSE !((int )max1 == (int )id1) [L95] nl1 = (char)1 [L98] mode1 = (_Bool)0 [L118] COND TRUE \read(mode2) [L119] r2 = (char )((int )r2 + 1) [L120] COND FALSE !(\read(ep12)) [L127] COND TRUE \read(ep32) [L128] m2 = p32_old [L129] p32_old = nomsg [L130] COND FALSE !((int )m2 > (int )max2) [L134] COND TRUE (int )r2 == 2 [L135] COND TRUE (int )max2 == (int )id2 [L136] st2 = (char)1 [L141] mode2 = (_Bool)0 [L161] COND TRUE \read(mode3) [L162] r3 = (char )((int )r3 + 1) [L163] COND TRUE \read(ep13) [L164] m3 = p13_old [L165] p13_old = nomsg [L166] COND FALSE !((int )m3 > (int )max3) [L170] COND FALSE !(\read(ep23)) [L177] COND TRUE (int )r3 == 2 [L178] COND TRUE (int )max3 == (int )id3 [L179] st3 = (char)1 [L184] mode3 = (_Bool)0 [L528] p12_old = p12_new [L529] p12_new = nomsg [L530] p13_old = p13_new [L531] p13_new = nomsg [L532] p21_old = p21_new [L533] p21_new = nomsg [L534] p23_old = p23_new [L535] p23_new = nomsg [L536] p31_old = p31_new [L537] p31_new = nomsg [L538] p32_old = p32_new [L539] p32_new = nomsg [L420] int tmp ; VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=3, m2=2, m3=-1, max1=3, max2=3, max3=2, mode1=0, mode2=0, mode3=0, 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] [L423] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L469] tmp = 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=3, m2=2, m3=-1, max1=3, max2=3, max3=2, mode1=0, mode2=0, mode3=0, 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] [L471] return (tmp); [L540] c1 = check() [L553] COND TRUE ! arg VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=3, m2=2, m3=-1, max1=3, max2=3, max3=2, mode1=0, mode2=0, mode3=0, 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_floodmax.3.4.ufo.BOUNDED-6.pals.c", 3, "reach_error") VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=3, id3=2, m1=3, m2=2, m3=-1, max1=3, max2=3, max3=2, mode1=0, mode2=0, mode3=0, 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 was 57.5 MB in the beginning and 57.4 MB in the end (delta: 69.9 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 562.93 ms. Allocated memory is still 100.7 MB. Free memory was 71.6 MB in the beginning and 72.5 MB in the end (delta: -958.8 kB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 114.99 ms. Allocated memory is still 100.7 MB. Free memory was 72.5 MB in the beginning and 69.5 MB in the end (delta: 3.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 52.38 ms. Allocated memory is still 100.7 MB. Free memory was 69.5 MB in the beginning and 67.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 3890.60 ms. Allocated memory was 100.7 MB in the beginning and 155.2 MB in the end (delta: 54.5 MB). Free memory was 67.4 MB in the beginning and 69.4 MB in the end (delta: -1.9 MB). Peak memory consumption was 55.2 MB. Max. memory is 16.1 GB. * CodeCheck took 329528.51 ms. Allocated memory was 155.2 MB in the beginning and 1.3 GB in the end (delta: 1.2 GB). Free memory was 69.4 MB in the beginning and 785.4 MB in the end (delta: -716.1 MB). Peak memory consumption was 446.8 MB. Max. memory is 16.1 GB. * Witness Printer took 190.23 ms. Allocated memory is still 1.3 GB. Free memory was 785.4 MB in the beginning and 764.5 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...