./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.3.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_b4880779-004c-4845-b293-0ac47a8231d3/bin/ukojak/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_b4880779-004c-4845-b293-0ac47a8231d3/bin/ukojak/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_b4880779-004c-4845-b293-0ac47a8231d3/bin/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_b4880779-004c-4845-b293-0ac47a8231d3/bin/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.3.ufo.BOUNDED-6.pals.c -s /tmp/vcloud-vcloud-master/worker/run_dir_b4880779-004c-4845-b293-0ac47a8231d3/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_b4880779-004c-4845-b293-0ac47a8231d3/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 4d55ff05c625cc4e931d19e7a1796a7096a7af1e ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:55:04,414 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-29 18:55:04,418 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-29 18:55:04,505 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-29 18:55:04,507 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-29 18:55:04,514 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-29 18:55:04,519 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-29 18:55:04,528 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-29 18:55:04,531 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-29 18:55:04,534 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-29 18:55:04,536 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-29 18:55:04,539 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-29 18:55:04,540 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-29 18:55:04,551 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-29 18:55:04,554 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-29 18:55:04,556 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-29 18:55:04,557 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-29 18:55:04,559 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-29 18:55:04,562 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-29 18:55:04,565 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-29 18:55:04,567 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-29 18:55:04,569 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-29 18:55:04,571 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-29 18:55:04,573 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-29 18:55:04,577 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-29 18:55:04,578 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-29 18:55:04,578 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-29 18:55:04,580 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-29 18:55:04,581 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-29 18:55:04,582 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-29 18:55:04,583 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-29 18:55:04,584 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-29 18:55:04,585 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-29 18:55:04,587 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-29 18:55:04,589 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-29 18:55:04,589 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-29 18:55:04,591 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-29 18:55:04,591 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-29 18:55:04,591 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-29 18:55:04,593 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-29 18:55:04,594 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-29 18:55:04,595 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_b4880779-004c-4845-b293-0ac47a8231d3/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2020-11-29 18:55:04,625 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-29 18:55:04,625 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-29 18:55:04,626 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-11-29 18:55:04,626 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2020-11-29 18:55:04,627 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-29 18:55:04,628 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-29 18:55:04,628 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-29 18:55:04,628 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-29 18:55:04,629 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-29 18:55:04,629 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-29 18:55:04,629 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-29 18:55:04,630 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-29 18:55:04,630 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-29 18:55:04,630 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-29 18:55:04,631 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-29 18:55:04,631 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-29 18:55:04,631 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-29 18:55:04,632 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-29 18:55:04,632 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2020-11-29 18:55:04,632 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2020-11-29 18:55:04,633 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-29 18:55:04,633 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-29 18:55:04,633 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2020-11-29 18:55:04,634 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-29 18:55:04,634 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-29 18:55:04,634 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-29 18:55:04,634 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2020-11-29 18:55:04,635 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-29 18:55:04,635 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-29 18:55:04,635 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_b4880779-004c-4845-b293-0ac47a8231d3/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_b4880779-004c-4845-b293-0ac47a8231d3/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 -> 4d55ff05c625cc4e931d19e7a1796a7096a7af1e [2020-11-29 18:55:04,963 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-29 18:55:05,005 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-29 18:55:05,010 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-29 18:55:05,013 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-29 18:55:05,015 INFO L275 PluginConnector]: CDTParser initialized [2020-11-29 18:55:05,017 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_b4880779-004c-4845-b293-0ac47a8231d3/bin/ukojak/../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.3.ufo.BOUNDED-6.pals.c [2020-11-29 18:55:05,123 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b4880779-004c-4845-b293-0ac47a8231d3/bin/ukojak/data/d98948331/4c409ded95b8450988b078c0cc1e8f9e/FLAG4996e394b [2020-11-29 18:55:05,799 INFO L306 CDTParser]: Found 1 translation units. [2020-11-29 18:55:05,800 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_b4880779-004c-4845-b293-0ac47a8231d3/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.3.ufo.BOUNDED-6.pals.c [2020-11-29 18:55:05,817 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b4880779-004c-4845-b293-0ac47a8231d3/bin/ukojak/data/d98948331/4c409ded95b8450988b078c0cc1e8f9e/FLAG4996e394b [2020-11-29 18:55:06,079 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_b4880779-004c-4845-b293-0ac47a8231d3/bin/ukojak/data/d98948331/4c409ded95b8450988b078c0cc1e8f9e [2020-11-29 18:55:06,082 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-29 18:55:06,085 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-29 18:55:06,100 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-29 18:55:06,101 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-29 18:55:06,105 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-29 18:55:06,107 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:55:06" (1/1) ... [2020-11-29 18:55:06,110 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4047fc67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:55:06, skipping insertion in model container [2020-11-29 18:55:06,110 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:55:06" (1/1) ... [2020-11-29 18:55:06,120 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-29 18:55:06,162 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-29 18:55:06,548 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 18:55:06,574 INFO L203 MainTranslator]: Completed pre-run [2020-11-29 18:55:06,667 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 18:55:06,700 INFO L208 MainTranslator]: Completed translation [2020-11-29 18:55:06,701 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:55:06 WrapperNode [2020-11-29 18:55:06,701 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-29 18:55:06,702 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-29 18:55:06,703 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-29 18:55:06,703 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-29 18:55:06,724 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:55:06" (1/1) ... [2020-11-29 18:55:06,739 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:55:06" (1/1) ... [2020-11-29 18:55:06,803 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-29 18:55:06,804 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-29 18:55:06,804 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-29 18:55:06,804 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-29 18:55:06,832 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:55:06" (1/1) ... [2020-11-29 18:55:06,832 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:55:06" (1/1) ... [2020-11-29 18:55:06,837 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:55:06" (1/1) ... [2020-11-29 18:55:06,838 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:55:06" (1/1) ... [2020-11-29 18:55:06,850 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:55:06" (1/1) ... [2020-11-29 18:55:06,861 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:55:06" (1/1) ... [2020-11-29 18:55:06,881 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:55:06" (1/1) ... [2020-11-29 18:55:06,886 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-29 18:55:06,887 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-29 18:55:06,887 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-29 18:55:06,888 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-29 18:55:06,889 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:55:06" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b4880779-004c-4845-b293-0ac47a8231d3/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:55:07,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-29 18:55:07,004 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-29 18:55:07,005 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-29 18:55:07,006 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-29 18:55:11,331 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-29 18:55:11,332 INFO L298 CfgBuilder]: Removed 19 assume(true) statements. [2020-11-29 18:55:11,336 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:55:11 BoogieIcfgContainer [2020-11-29 18:55:11,337 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-29 18:55:11,339 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2020-11-29 18:55:11,342 INFO L271 PluginConnector]: Initializing CodeCheck... [2020-11-29 18:55:11,355 INFO L275 PluginConnector]: CodeCheck initialized [2020-11-29 18:55:11,356 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:55:11" (1/1) ... [2020-11-29 18:55:11,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:55:11,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:55:11,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 19 states and 30 transitions. [2020-11-29 18:55:11,427 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 30 transitions. [2020-11-29 18:55:11,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-11-29 18:55:11,430 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:55:11,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:55:12,218 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:55:12,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:55:12,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 21 states and 34 transitions. [2020-11-29 18:55:12,379 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 34 transitions. [2020-11-29 18:55:12,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-11-29 18:55:12,380 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:55:12,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:55:12,707 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:55:13,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:55:13,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 24 states and 41 transitions. [2020-11-29 18:55:13,229 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 41 transitions. [2020-11-29 18:55:13,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-11-29 18:55:13,233 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:55:13,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:55:13,424 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:55:14,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:55:14,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 28 states and 50 transitions. [2020-11-29 18:55:14,287 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 50 transitions. [2020-11-29 18:55:14,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-29 18:55:14,288 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:55:14,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:55:14,559 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:55:15,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:55:15,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 33 states and 60 transitions. [2020-11-29 18:55:15,652 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 60 transitions. [2020-11-29 18:55:15,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-29 18:55:15,653 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:55:15,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:55:15,749 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:55:16,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:55:16,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 37 states and 68 transitions. [2020-11-29 18:55:16,179 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 68 transitions. [2020-11-29 18:55:16,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-29 18:55:16,180 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:55:16,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:55:16,397 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:55:17,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:55:17,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 43 states and 80 transitions. [2020-11-29 18:55:17,841 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 80 transitions. [2020-11-29 18:55:17,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-29 18:55:17,842 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:55:17,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:55:17,968 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:55:18,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:55:18,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 44 states and 81 transitions. [2020-11-29 18:55:18,228 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 81 transitions. [2020-11-29 18:55:18,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-29 18:55:18,229 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:55:18,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:55:18,638 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:55:19,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:55:19,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 51 states and 92 transitions. [2020-11-29 18:55:19,708 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 92 transitions. [2020-11-29 18:55:19,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-29 18:55:19,709 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:55:19,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:55:19,817 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:55:19,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:55:19,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 52 states and 93 transitions. [2020-11-29 18:55:19,981 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 93 transitions. [2020-11-29 18:55:19,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-29 18:55:19,982 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:55:20,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:55:20,263 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:55:20,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:55:20,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 55 states and 99 transitions. [2020-11-29 18:55:20,431 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 99 transitions. [2020-11-29 18:55:20,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-29 18:55:20,433 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:55:20,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:55:21,063 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:55:24,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:55:24,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 71 states and 133 transitions. [2020-11-29 18:55:24,523 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 133 transitions. [2020-11-29 18:55:24,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-29 18:55:24,525 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:55:24,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:55:25,568 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:55:27,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:55:27,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 77 states and 151 transitions. [2020-11-29 18:55:27,759 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 151 transitions. [2020-11-29 18:55:27,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-29 18:55:27,761 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:55:27,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:55:27,991 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:55:28,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:55:28,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 78 states and 153 transitions. [2020-11-29 18:55:28,660 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 153 transitions. [2020-11-29 18:55:28,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-29 18:55:28,661 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:55:28,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:55:28,894 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:55:29,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:55:29,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 79 states and 156 transitions. [2020-11-29 18:55:29,520 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 156 transitions. [2020-11-29 18:55:29,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-29 18:55:29,522 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:55:29,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:55:29,892 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:55:33,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:55:33,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 87 states and 178 transitions. [2020-11-29 18:55:33,382 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 178 transitions. [2020-11-29 18:55:33,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-29 18:55:33,384 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:55:33,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:55:33,571 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:55:34,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:55:34,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 88 states and 181 transitions. [2020-11-29 18:55:34,217 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 181 transitions. [2020-11-29 18:55:34,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-29 18:55:34,218 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:55:34,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:55:34,458 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:55:35,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:55:35,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 89 states and 183 transitions. [2020-11-29 18:55:35,217 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 183 transitions. [2020-11-29 18:55:35,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-29 18:55:35,218 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:55:35,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:55:35,950 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:55:37,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:55:37,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 91 states and 187 transitions. [2020-11-29 18:55:37,550 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 187 transitions. [2020-11-29 18:55:37,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-29 18:55:37,551 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:55:37,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:55:37,772 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:55:40,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:55:40,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 95 states and 198 transitions. [2020-11-29 18:55:40,052 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 198 transitions. [2020-11-29 18:55:40,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-29 18:55:40,053 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:55:40,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:55:40,342 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:55:41,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:55:41,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 96 states and 200 transitions. [2020-11-29 18:55:41,156 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 200 transitions. [2020-11-29 18:55:41,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-29 18:55:41,157 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:55:41,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:55:41,380 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:55:42,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:55:42,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 97 states and 203 transitions. [2020-11-29 18:55:42,077 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 203 transitions. [2020-11-29 18:55:42,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-29 18:55:42,077 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:55:42,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:55:43,116 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 21 [2020-11-29 18:55:43,351 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:55:46,812 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 44 [2020-11-29 18:55:49,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:55:49,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 116 states and 235 transitions. [2020-11-29 18:55:49,047 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 235 transitions. [2020-11-29 18:55:49,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-11-29 18:55:49,047 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:55:49,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:55:49,238 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:55:51,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:55:51,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 121 states and 246 transitions. [2020-11-29 18:55:51,477 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 246 transitions. [2020-11-29 18:55:51,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-11-29 18:55:51,478 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:55:51,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:55:52,772 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:55:57,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:55:57,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 138 states and 267 transitions. [2020-11-29 18:55:57,200 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 267 transitions. [2020-11-29 18:55:57,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-11-29 18:55:57,201 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:55:57,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:55:59,094 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:56:03,501 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2020-11-29 18:56:04,278 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2020-11-29 18:56:05,686 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 34 [2020-11-29 18:56:06,824 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 35 [2020-11-29 18:56:07,901 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 37 [2020-11-29 18:56:10,438 WARN L193 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2020-11-29 18:56:13,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:56:13,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 167 states and 336 transitions. [2020-11-29 18:56:13,028 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 336 transitions. [2020-11-29 18:56:13,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-11-29 18:56:13,029 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:56:13,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:56:15,726 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 26 [2020-11-29 18:56:16,222 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 21 [2020-11-29 18:56:16,692 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:56:22,046 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 36 [2020-11-29 18:56:22,229 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 37 [2020-11-29 18:56:23,209 WARN L193 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2020-11-29 18:56:23,906 WARN L193 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2020-11-29 18:56:25,121 WARN L193 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2020-11-29 18:56:25,939 WARN L193 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2020-11-29 18:56:26,865 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2020-11-29 18:56:27,194 WARN L193 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2020-11-29 18:56:27,597 WARN L193 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2020-11-29 18:56:28,522 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-11-29 18:56:28,873 WARN L193 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2020-11-29 18:56:29,302 WARN L193 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2020-11-29 18:56:30,345 WARN L193 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-11-29 18:56:30,710 WARN L193 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2020-11-29 18:56:31,115 WARN L193 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2020-11-29 18:56:32,077 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2020-11-29 18:56:32,498 WARN L193 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2020-11-29 18:56:32,968 WARN L193 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 58 [2020-11-29 18:56:33,485 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2020-11-29 18:56:34,128 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2020-11-29 18:56:35,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:56:35,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 196 states and 390 transitions. [2020-11-29 18:56:35,606 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 390 transitions. [2020-11-29 18:56:35,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-11-29 18:56:35,608 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:56:35,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:56:35,935 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:56:36,306 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 33 [2020-11-29 18:56:36,578 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2020-11-29 18:56:38,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:56:38,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 198 states and 398 transitions. [2020-11-29 18:56:38,650 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 398 transitions. [2020-11-29 18:56:38,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-11-29 18:56:38,651 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:56:38,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:56:38,881 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:56:39,293 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 22 [2020-11-29 18:56:39,652 WARN L193 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 26 [2020-11-29 18:56:40,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:56:40,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 199 states and 404 transitions. [2020-11-29 18:56:40,581 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 404 transitions. [2020-11-29 18:56:40,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-11-29 18:56:40,582 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:56:40,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:56:43,972 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:56:45,776 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 33 [2020-11-29 18:56:47,661 WARN L193 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 36 [2020-11-29 18:56:48,892 WARN L193 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2020-11-29 18:56:49,940 WARN L193 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 33 [2020-11-29 18:56:50,323 WARN L193 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2020-11-29 18:56:51,373 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2020-11-29 18:56:51,657 WARN L193 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 34 [2020-11-29 18:56:52,024 WARN L193 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2020-11-29 18:56:53,078 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2020-11-29 18:56:53,353 WARN L193 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 37 [2020-11-29 18:56:53,739 WARN L193 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2020-11-29 18:56:54,839 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2020-11-29 18:56:55,229 WARN L193 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 32 [2020-11-29 18:56:55,615 WARN L193 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2020-11-29 18:56:56,670 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2020-11-29 18:56:56,925 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 28 [2020-11-29 18:56:57,206 WARN L193 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2020-11-29 18:57:02,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:57:02,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 216 states and 441 transitions. [2020-11-29 18:57:02,758 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 441 transitions. [2020-11-29 18:57:02,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-11-29 18:57:02,759 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:57:02,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:57:04,397 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:57:11,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:57:11,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 220 states and 459 transitions. [2020-11-29 18:57:11,505 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 459 transitions. [2020-11-29 18:57:11,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-11-29 18:57:11,506 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:57:11,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:57:11,642 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:57:13,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:57:13,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 221 states and 461 transitions. [2020-11-29 18:57:13,199 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 461 transitions. [2020-11-29 18:57:13,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-11-29 18:57:13,200 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:57:13,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:57:13,339 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:57:15,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:57:15,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 222 states and 463 transitions. [2020-11-29 18:57:15,043 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 463 transitions. [2020-11-29 18:57:15,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-11-29 18:57:15,044 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:57:15,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:57:19,052 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:57:26,713 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-11-29 18:57:29,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:57:29,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 226 states and 482 transitions. [2020-11-29 18:57:29,373 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 482 transitions. [2020-11-29 18:57:29,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-11-29 18:57:29,374 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:57:29,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:57:29,606 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:57:31,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:57:31,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 227 states and 484 transitions. [2020-11-29 18:57:31,442 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 484 transitions. [2020-11-29 18:57:31,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-11-29 18:57:31,444 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:57:31,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:57:31,618 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:57:32,347 WARN L193 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 27 [2020-11-29 18:57:34,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:57:34,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 229 states and 488 transitions. [2020-11-29 18:57:34,886 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 488 transitions. [2020-11-29 18:57:34,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-11-29 18:57:34,887 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:57:34,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:57:35,059 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:57:36,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:57:36,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 230 states and 489 transitions. [2020-11-29 18:57:36,724 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 489 transitions. [2020-11-29 18:57:36,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-11-29 18:57:36,725 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:57:36,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:57:36,897 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:57:38,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:57:38,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 231 states and 491 transitions. [2020-11-29 18:57:38,870 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 491 transitions. [2020-11-29 18:57:38,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-11-29 18:57:38,870 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:57:38,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:57:41,726 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:57:44,639 WARN L193 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 31 [2020-11-29 18:57:45,281 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2020-11-29 18:57:46,382 WARN L193 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 34 [2020-11-29 18:57:47,921 WARN L193 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 29 [2020-11-29 18:57:50,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:57:50,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 234 states and 500 transitions. [2020-11-29 18:57:50,255 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 500 transitions. [2020-11-29 18:57:50,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-11-29 18:57:50,256 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:57:50,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:57:50,357 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:57:51,038 WARN L193 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 31 [2020-11-29 18:57:55,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:57:55,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 237 states and 512 transitions. [2020-11-29 18:57:55,541 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 512 transitions. [2020-11-29 18:57:55,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-11-29 18:57:55,542 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:57:55,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:57:55,662 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:57:57,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:57:57,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 238 states and 514 transitions. [2020-11-29 18:57:57,464 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 514 transitions. [2020-11-29 18:57:57,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-11-29 18:57:57,465 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:57:57,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:57:57,558 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:57:57,999 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 22 [2020-11-29 18:58:01,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:58:01,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 240 states and 519 transitions. [2020-11-29 18:58:01,861 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 519 transitions. [2020-11-29 18:58:01,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-11-29 18:58:01,862 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:58:01,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:58:01,962 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:58:02,511 WARN L193 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 22 [2020-11-29 18:58:02,876 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2020-11-29 18:58:04,323 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-11-29 18:58:04,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:58:04,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 241 states and 521 transitions. [2020-11-29 18:58:04,367 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 521 transitions. [2020-11-29 18:58:04,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-11-29 18:58:04,368 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:58:04,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:58:04,467 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:58:06,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:58:06,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 242 states and 523 transitions. [2020-11-29 18:58:06,646 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 523 transitions. [2020-11-29 18:58:06,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-11-29 18:58:06,647 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:58:06,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:58:09,497 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 30 [2020-11-29 18:58:10,515 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 26 [2020-11-29 18:58:12,666 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 15 [2020-11-29 18:58:12,678 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:58:17,663 WARN L193 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2020-11-29 18:58:18,369 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2020-11-29 18:58:18,705 WARN L193 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 31 [2020-11-29 18:58:19,080 WARN L193 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 37 [2020-11-29 18:58:20,768 WARN L193 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 34 [2020-11-29 18:58:21,176 WARN L193 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 40 [2020-11-29 18:58:22,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-11-29 18:58:22,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 246 states and 528 transitions. [2020-11-29 18:58:22,747 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 528 transitions. [2020-11-29 18:58:22,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-11-29 18:58:22,748 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-11-29 18:58:24,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 18:58:24,411 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 18:58:25,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 18:58:25,185 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 18:58:25,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 18:58:25,828 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 18:58:26,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 18:58:26,284 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 18:58:26,539 WARN L483 CodeCheckObserver]: This program is UNSAFE, Check terminated with 45 iterations. [2020-11-29 18:58:26,810 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 29.11 06:58:26 ImpRootNode [2020-11-29 18:58:26,810 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2020-11-29 18:58:26,810 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-29 18:58:26,810 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-29 18:58:26,811 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-29 18:58:26,811 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:55:11" (3/4) ... [2020-11-29 18:58:26,814 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-29 18:58:27,085 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_b4880779-004c-4845-b293-0ac47a8231d3/bin/ukojak/witness.graphml [2020-11-29 18:58:27,085 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-29 18:58:27,087 INFO L168 Benchmark]: Toolchain (without parser) took 201001.62 ms. Allocated memory was 102.8 MB in the beginning and 931.1 MB in the end (delta: 828.4 MB). Free memory was 73.2 MB in the beginning and 715.9 MB in the end (delta: -642.7 MB). Peak memory consumption was 186.6 MB. Max. memory is 16.1 GB. [2020-11-29 18:58:27,087 INFO L168 Benchmark]: CDTParser took 0.39 ms. Allocated memory is still 102.8 MB. Free memory was 62.2 MB in the beginning and 62.2 MB in the end (delta: 69.9 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-29 18:58:27,088 INFO L168 Benchmark]: CACSL2BoogieTranslator took 601.35 ms. Allocated memory was 102.8 MB in the beginning and 123.7 MB in the end (delta: 21.0 MB). Free memory was 73.2 MB in the beginning and 94.2 MB in the end (delta: -21.0 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-11-29 18:58:27,088 INFO L168 Benchmark]: Boogie Procedure Inliner took 100.75 ms. Allocated memory is still 123.7 MB. Free memory was 94.2 MB in the beginning and 91.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-29 18:58:27,089 INFO L168 Benchmark]: Boogie Preprocessor took 82.27 ms. Allocated memory is still 123.7 MB. Free memory was 91.5 MB in the beginning and 89.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:58:27,089 INFO L168 Benchmark]: RCFGBuilder took 4449.91 ms. Allocated memory was 123.7 MB in the beginning and 161.5 MB in the end (delta: 37.7 MB). Free memory was 89.4 MB in the beginning and 94.1 MB in the end (delta: -4.7 MB). Peak memory consumption was 76.8 MB. Max. memory is 16.1 GB. [2020-11-29 18:58:27,090 INFO L168 Benchmark]: CodeCheck took 195470.38 ms. Allocated memory was 161.5 MB in the beginning and 931.1 MB in the end (delta: 769.7 MB). Free memory was 94.1 MB in the beginning and 737.9 MB in the end (delta: -643.8 MB). Peak memory consumption was 124.8 MB. Max. memory is 16.1 GB. [2020-11-29 18:58:27,091 INFO L168 Benchmark]: Witness Printer took 274.74 ms. Allocated memory is still 931.1 MB. Free memory was 737.9 MB in the beginning and 715.9 MB in the end (delta: 22.0 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.1 GB. [2020-11-29 18:58:27,095 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: 195.1s, OverallIterations: 45, TraceHistogramMax: 0, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: -1968569984 SDtfs, -1514370626 SDslu, -297531706 SDs, 0 SdLazy, -359773140 SolverSat, -1069051568 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 105.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12143 GetRequests, 10861 SyntacticMatches, 624 SemanticMatches, 658 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244403 ImplicationChecksByTransitivity, 176.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.3s SsaConstructionTime, 3.0s SatisfiabilityAnalysisTime, 32.3s InterpolantComputationTime, 1240 NumberOfCodeBlocks, 1240 NumberOfCodeBlocksAsserted, 45 NumberOfCheckSat, 1148 ConstructedInterpolants, 0 QuantifiedInterpolants, 471705 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 44 InterpolantComputations, 10 PerfectInterpolantSequences, 127/689 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 FALSE !(\read(r211)) [L257] COND TRUE \read(r231) [L258] COND TRUE \read(ep31) [L259] tmp___1 = 1 [L266] r212 = (_Bool )tmp___1 [L267] COND TRUE \read(r231) [L268] tmp___2 = 1 [L279] r232 = (_Bool )tmp___2 [L280] COND TRUE \read(r311) [L281] 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=0, ep23=1, ep31=1, ep32=255, id1=94, id2=95, id3=93, m1=95, m2=96, m3=-1, max1=94, max2=95, max3=93, 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 < 2 [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 FALSE !(\read(ep21)) [L147] COND TRUE \read(ep23) [L148] EXPR max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L148] p23_new = max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L151] mode2 = (_Bool)1 [L161] COND FALSE !(\read(mode3)) [L186] COND TRUE (int )r3 < 2 [L187] COND TRUE \read(ep31) [L188] EXPR max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L188] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [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=0, ep23=1, ep31=1, ep32=255, id1=94, id2=95, id3=93, m1=95, m2=96, m3=-1, max1=94, max2=95, max3=93, 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=94, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=95, p31=0, p31_new=-1, p31_old=93, p32=0, p32_new=-1, p32_old=93, 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=0, ep23=1, ep31=1, ep32=255, id1=94, id2=95, id3=93, m1=95, m2=96, m3=-1, max1=94, max2=95, max3=93, 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=94, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=95, p31=0, p31_new=-1, p31_old=93, p32=0, p32_new=-1, p32_old=93, 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=0, ep23=1, ep31=1, ep32=255, id1=94, id2=95, id3=93, m1=95, m2=96, m3=-1, max1=94, max2=95, max3=93, 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=94, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=95, p31=0, p31_new=-1, p31_old=93, p32=0, p32_new=-1, p32_old=93, 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=0, ep23=1, ep31=1, ep32=255, id1=94, id2=95, id3=93, m1=95, m2=96, m3=-1, max1=94, max2=95, max3=93, 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=94, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=95, p31=0, p31_new=-1, p31_old=93, p32=0, p32_new=-1, p32_old=93, 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=0, ep23=1, ep31=1, ep32=255, id1=94, id2=95, id3=93, m1=95, m2=96, m3=-1, max1=94, max2=95, max3=93, 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=94, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=95, p31=0, p31_new=-1, p31_old=93, p32=0, p32_new=-1, p32_old=93, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L427] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=255, id1=94, id2=95, id3=93, m1=95, m2=96, m3=-1, max1=94, max2=95, max3=93, 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=94, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=95, p31=0, p31_new=-1, p31_old=93, p32=0, p32_new=-1, p32_old=93, 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=0, ep23=1, ep31=1, ep32=255, id1=94, id2=95, id3=93, m1=95, m2=96, m3=-1, max1=94, max2=95, max3=93, 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=94, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=95, p31=0, p31_new=-1, p31_old=93, p32=0, p32_new=-1, p32_old=93, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L432] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=255, id1=94, id2=95, id3=93, m1=95, m2=96, m3=-1, max1=94, max2=95, max3=93, 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=94, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=95, p31=0, p31_new=-1, p31_old=93, p32=0, p32_new=-1, p32_old=93, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L437] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=255, id1=94, id2=95, id3=93, m1=95, m2=96, m3=-1, max1=94, max2=95, max3=93, 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=94, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=95, p31=0, p31_new=-1, p31_old=93, p32=0, p32_new=-1, p32_old=93, 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=0, ep23=1, ep31=1, ep32=255, id1=94, id2=95, id3=93, m1=95, m2=96, m3=-1, max1=94, max2=95, max3=93, 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=94, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=95, p31=0, p31_new=-1, p31_old=93, p32=0, p32_new=-1, p32_old=93, 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=0, ep23=1, ep31=1, ep32=255, id1=94, id2=95, id3=93, m1=95, m2=96, m3=-1, max1=94, max2=95, max3=93, 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=94, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=95, p31=0, p31_new=-1, p31_old=93, p32=0, p32_new=-1, p32_old=93, 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=0, ep23=1, ep31=1, ep32=255, id1=94, id2=95, id3=93, m1=95, m2=96, m3=-1, max1=94, max2=95, max3=93, 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=94, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=95, p31=0, p31_new=-1, p31_old=93, p32=0, p32_new=-1, p32_old=93, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L542] i2 ++ VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=255, id1=94, id2=95, id3=93, m1=95, m2=96, m3=-1, max1=94, max2=95, max3=93, 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=94, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=95, p31=0, p31_new=-1, p31_old=93, p32=0, p32_new=-1, p32_old=93, 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 FALSE !(\read(ep21)) [L84] COND TRUE \read(ep31) [L85] m1 = p31_old [L86] p31_old = nomsg [L87] COND FALSE !((int )m1 > (int )max1) [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 TRUE (int )m3 > (int )max3 [L167] max3 = m3 [L170] COND TRUE \read(ep23) [L171] m3 = p23_old [L172] p23_old = nomsg [L173] COND TRUE (int )m3 > (int )max3 [L174] max3 = m3 [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=0, ep23=1, ep31=1, ep32=255, id1=94, id2=95, id3=93, m1=93, m2=93, m3=95, max1=94, max2=95, max3=95, 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=0, ep23=1, ep31=1, ep32=255, id1=94, id2=95, id3=93, m1=93, m2=93, m3=95, max1=94, max2=95, max3=95, 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=0, ep23=1, ep31=1, ep32=255, id1=94, id2=95, id3=93, m1=93, m2=93, m3=95, max1=94, max2=95, max3=95, 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=0, ep23=1, ep31=1, ep32=255, id1=94, id2=95, id3=93, m1=93, m2=93, m3=95, max1=94, max2=95, max3=95, 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=0, ep23=1, ep31=1, ep32=255, id1=94, id2=95, id3=93, m1=93, m2=93, m3=95, max1=94, max2=95, max3=95, 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=0, ep23=1, ep31=1, ep32=255, id1=94, id2=95, id3=93, m1=93, m2=93, m3=95, max1=94, max2=95, max3=95, 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=0, ep23=1, ep31=1, ep32=255, id1=94, id2=95, id3=93, m1=93, m2=93, m3=95, max1=94, max2=95, max3=95, 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=0, ep23=1, ep31=1, ep32=255, id1=94, id2=95, id3=93, m1=93, m2=93, m3=95, max1=94, max2=95, max3=95, 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=0, ep23=1, ep31=1, ep32=255, id1=94, id2=95, id3=93, m1=93, m2=93, m3=95, max1=94, max2=95, max3=95, 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=0, ep23=1, ep31=1, ep32=255, id1=94, id2=95, id3=93, m1=93, m2=93, m3=95, max1=94, max2=95, max3=95, 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=0, ep23=1, ep31=1, ep32=255, id1=94, id2=95, id3=93, m1=93, m2=93, m3=95, max1=94, max2=95, max3=95, 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=0, ep23=1, ep31=1, ep32=255, id1=94, id2=95, id3=93, m1=93, m2=93, m3=95, max1=94, max2=95, max3=95, 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=0, ep23=1, ep31=1, ep32=255, id1=94, id2=95, id3=93, m1=93, m2=93, m3=95, max1=94, max2=95, max3=95, 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 TRUE (int )r1 < 2 [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 FALSE !(\read(ep21)) [L147] COND TRUE \read(ep23) [L148] EXPR max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L148] p23_new = max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L151] mode2 = (_Bool)1 [L161] COND FALSE !(\read(mode3)) [L186] COND TRUE (int )r3 < 2 [L187] COND TRUE \read(ep31) [L188] EXPR max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L188] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [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=0, ep23=1, ep31=1, ep32=255, id1=94, id2=95, id3=93, m1=93, m2=93, m3=95, max1=94, max2=95, max3=95, 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=94, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=95, p31=0, p31_new=-1, p31_old=95, p32=0, p32_new=-1, p32_old=95, 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=0, ep23=1, ep31=1, ep32=255, id1=94, id2=95, id3=93, m1=93, m2=93, m3=95, max1=94, max2=95, max3=95, 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=94, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=95, p31=0, p31_new=-1, p31_old=95, p32=0, p32_new=-1, p32_old=95, 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=0, ep23=1, ep31=1, ep32=255, id1=94, id2=95, id3=93, m1=93, m2=93, m3=95, max1=94, max2=95, max3=95, 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=94, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=95, p31=0, p31_new=-1, p31_old=95, p32=0, p32_new=-1, p32_old=95, 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=0, ep23=1, ep31=1, ep32=255, id1=94, id2=95, id3=93, m1=93, m2=93, m3=95, max1=94, max2=95, max3=95, 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=94, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=95, p31=0, p31_new=-1, p31_old=95, p32=0, p32_new=-1, p32_old=95, 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=0, ep23=1, ep31=1, ep32=255, id1=94, id2=95, id3=93, m1=93, m2=93, m3=95, max1=94, max2=95, max3=95, 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=94, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=95, p31=0, p31_new=-1, p31_old=95, p32=0, p32_new=-1, p32_old=95, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L427] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=255, id1=94, id2=95, id3=93, m1=93, m2=93, m3=95, max1=94, max2=95, max3=95, 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=94, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=95, p31=0, p31_new=-1, p31_old=95, p32=0, p32_new=-1, p32_old=95, 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=0, ep23=1, ep31=1, ep32=255, id1=94, id2=95, id3=93, m1=93, m2=93, m3=95, max1=94, max2=95, max3=95, 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=94, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=95, p31=0, p31_new=-1, p31_old=95, p32=0, p32_new=-1, p32_old=95, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L432] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=255, id1=94, id2=95, id3=93, m1=93, m2=93, m3=95, max1=94, max2=95, max3=95, 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=94, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=95, p31=0, p31_new=-1, p31_old=95, p32=0, p32_new=-1, p32_old=95, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L437] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=255, id1=94, id2=95, id3=93, m1=93, m2=93, m3=95, max1=94, max2=95, max3=95, 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=94, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=95, p31=0, p31_new=-1, p31_old=95, p32=0, p32_new=-1, p32_old=95, 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=0, ep23=1, ep31=1, ep32=255, id1=94, id2=95, id3=93, m1=93, m2=93, m3=95, max1=94, max2=95, max3=95, 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=94, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=95, p31=0, p31_new=-1, p31_old=95, p32=0, p32_new=-1, p32_old=95, 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=0, ep23=1, ep31=1, ep32=255, id1=94, id2=95, id3=93, m1=93, m2=93, m3=95, max1=94, max2=95, max3=95, 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=94, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=95, p31=0, p31_new=-1, p31_old=95, p32=0, p32_new=-1, p32_old=95, 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=0, ep23=1, ep31=1, ep32=255, id1=94, id2=95, id3=93, m1=93, m2=93, m3=95, max1=94, max2=95, max3=95, 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=94, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=95, p31=0, p31_new=-1, p31_old=95, p32=0, p32_new=-1, p32_old=95, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L542] i2 ++ VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=255, id1=94, id2=95, id3=93, m1=93, m2=93, m3=95, max1=94, max2=95, max3=95, 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=94, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=95, p31=0, p31_new=-1, p31_old=95, p32=0, p32_new=-1, p32_old=95, 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 FALSE !(\read(ep21)) [L84] COND TRUE \read(ep31) [L85] m1 = p31_old [L86] p31_old = nomsg [L87] COND TRUE (int )m1 > (int )max1 [L88] max1 = m1 [L91] COND TRUE (int )r1 == 2 [L92] COND FALSE !((int )max1 == (int )id1) [L95] st1 = (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 TRUE \read(ep23) [L171] m3 = p23_old [L172] p23_old = nomsg [L173] COND FALSE !((int )m3 > (int )max3) [L177] COND TRUE (int )r3 == 2 [L178] COND FALSE !((int )max3 == (int )id3) [L181] nl3 = (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=0, ep23=1, ep31=1, ep32=255, id1=94, id2=95, id3=93, m1=95, m2=95, m3=95, max1=95, max2=95, max3=95, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=1, 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=1, st2=1, st3=0] [L423] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L469] tmp = 0 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=255, id1=94, id2=95, id3=93, m1=95, m2=95, m3=95, max1=95, max2=95, max3=95, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=1, 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=1, st2=1, st3=0] [L471] return (tmp); [L540] c1 = check() [L553] COND TRUE ! arg VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=255, id1=94, id2=95, id3=93, m1=95, m2=95, m3=95, max1=95, max2=95, max3=95, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=1, 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=1, st2=1, st3=0] [L3] __assert_fail("0", "pals_floodmax.3.3.ufo.BOUNDED-6.pals.c", 3, "reach_error") VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=255, id1=94, id2=95, id3=93, m1=95, m2=95, m3=95, max1=95, max2=95, max3=95, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=1, 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=1, st2=1, st3=0] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.39 ms. Allocated memory is still 102.8 MB. Free memory was 62.2 MB in the beginning and 62.2 MB in the end (delta: 69.9 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 601.35 ms. Allocated memory was 102.8 MB in the beginning and 123.7 MB in the end (delta: 21.0 MB). Free memory was 73.2 MB in the beginning and 94.2 MB in the end (delta: -21.0 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 100.75 ms. Allocated memory is still 123.7 MB. Free memory was 94.2 MB in the beginning and 91.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 82.27 ms. Allocated memory is still 123.7 MB. Free memory was 91.5 MB in the beginning and 89.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 4449.91 ms. Allocated memory was 123.7 MB in the beginning and 161.5 MB in the end (delta: 37.7 MB). Free memory was 89.4 MB in the beginning and 94.1 MB in the end (delta: -4.7 MB). Peak memory consumption was 76.8 MB. Max. memory is 16.1 GB. * CodeCheck took 195470.38 ms. Allocated memory was 161.5 MB in the beginning and 931.1 MB in the end (delta: 769.7 MB). Free memory was 94.1 MB in the beginning and 737.9 MB in the end (delta: -643.8 MB). Peak memory consumption was 124.8 MB. Max. memory is 16.1 GB. * Witness Printer took 274.74 ms. Allocated memory is still 931.1 MB. Free memory was 737.9 MB in the beginning and 715.9 MB in the end (delta: 22.0 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.1 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...