./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 69874e26 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_1b0c744e-eeb1-4fc7-acd5-d40aebd6d0fb/bin/ukojak/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_1b0c744e-eeb1-4fc7-acd5-d40aebd6d0fb/bin/ukojak/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_1b0c744e-eeb1-4fc7-acd5-d40aebd6d0fb/bin/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_1b0c744e-eeb1-4fc7-acd5-d40aebd6d0fb/bin/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c -s /tmp/vcloud-vcloud-master/worker/run_dir_1b0c744e-eeb1-4fc7-acd5-d40aebd6d0fb/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_1b0c744e-eeb1-4fc7-acd5-d40aebd6d0fb/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 62ccd24833ac0ecc58b2c95d80707ba13f2363b8 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-69874e2 [2020-12-01 16:23:34,171 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-01 16:23:34,195 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-01 16:23:34,259 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-01 16:23:34,259 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-01 16:23:34,261 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-01 16:23:34,263 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-01 16:23:34,266 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-01 16:23:34,269 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-01 16:23:34,270 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-01 16:23:34,272 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-01 16:23:34,273 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-01 16:23:34,274 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-01 16:23:34,276 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-01 16:23:34,277 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-01 16:23:34,279 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-01 16:23:34,280 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-01 16:23:34,282 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-01 16:23:34,285 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-01 16:23:34,287 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-01 16:23:34,290 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-01 16:23:34,292 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-01 16:23:34,294 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-01 16:23:34,295 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-01 16:23:34,299 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-01 16:23:34,300 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-01 16:23:34,300 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-01 16:23:34,302 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-01 16:23:34,302 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-01 16:23:34,304 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-01 16:23:34,304 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-01 16:23:34,305 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-01 16:23:34,307 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-01 16:23:34,308 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-01 16:23:34,309 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-01 16:23:34,309 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-01 16:23:34,310 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-01 16:23:34,311 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-01 16:23:34,311 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-01 16:23:34,312 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-01 16:23:34,313 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-01 16:23:34,318 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_1b0c744e-eeb1-4fc7-acd5-d40aebd6d0fb/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2020-12-01 16:23:34,370 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-01 16:23:34,370 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-01 16:23:34,371 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-01 16:23:34,371 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2020-12-01 16:23:34,372 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-01 16:23:34,372 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-01 16:23:34,373 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-01 16:23:34,373 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-01 16:23:34,373 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-01 16:23:34,373 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-01 16:23:34,373 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-01 16:23:34,374 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-01 16:23:34,374 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-01 16:23:34,374 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-01 16:23:34,374 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-01 16:23:34,374 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-01 16:23:34,375 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-01 16:23:34,375 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-01 16:23:34,375 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2020-12-01 16:23:34,375 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2020-12-01 16:23:34,375 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-01 16:23:34,376 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-12-01 16:23:34,376 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2020-12-01 16:23:34,376 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-01 16:23:34,376 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-01 16:23:34,377 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-01 16:23:34,377 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2020-12-01 16:23:34,377 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-01 16:23:34,377 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-01 16:23:34,377 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_1b0c744e-eeb1-4fc7-acd5-d40aebd6d0fb/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_1b0c744e-eeb1-4fc7-acd5-d40aebd6d0fb/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 -> 62ccd24833ac0ecc58b2c95d80707ba13f2363b8 [2020-12-01 16:23:34,695 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-01 16:23:34,745 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-01 16:23:34,749 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-01 16:23:34,751 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-01 16:23:34,754 INFO L275 PluginConnector]: CDTParser initialized [2020-12-01 16:23:34,755 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_1b0c744e-eeb1-4fc7-acd5-d40aebd6d0fb/bin/ukojak/../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c [2020-12-01 16:23:34,841 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1b0c744e-eeb1-4fc7-acd5-d40aebd6d0fb/bin/ukojak/data/83c99a492/12e63d5f2596430b93fe7337ebd21ea0/FLAGf871c1875 [2020-12-01 16:23:35,462 INFO L306 CDTParser]: Found 1 translation units. [2020-12-01 16:23:35,463 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_1b0c744e-eeb1-4fc7-acd5-d40aebd6d0fb/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c [2020-12-01 16:23:35,473 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1b0c744e-eeb1-4fc7-acd5-d40aebd6d0fb/bin/ukojak/data/83c99a492/12e63d5f2596430b93fe7337ebd21ea0/FLAGf871c1875 [2020-12-01 16:23:35,721 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_1b0c744e-eeb1-4fc7-acd5-d40aebd6d0fb/bin/ukojak/data/83c99a492/12e63d5f2596430b93fe7337ebd21ea0 [2020-12-01 16:23:35,724 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-01 16:23:35,726 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-01 16:23:35,728 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-01 16:23:35,728 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-01 16:23:35,737 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-01 16:23:35,738 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 04:23:35" (1/1) ... [2020-12-01 16:23:35,753 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1493510a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:23:35, skipping insertion in model container [2020-12-01 16:23:35,754 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 04:23:35" (1/1) ... [2020-12-01 16:23:35,761 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-01 16:23:35,806 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-01 16:23:36,093 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-01 16:23:36,113 INFO L203 MainTranslator]: Completed pre-run [2020-12-01 16:23:36,231 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-01 16:23:36,250 INFO L208 MainTranslator]: Completed translation [2020-12-01 16:23:36,251 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:23:36 WrapperNode [2020-12-01 16:23:36,251 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-01 16:23:36,252 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-01 16:23:36,253 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-01 16:23:36,253 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-01 16:23:36,278 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:23:36" (1/1) ... [2020-12-01 16:23:36,290 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:23:36" (1/1) ... [2020-12-01 16:23:36,345 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-01 16:23:36,346 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-01 16:23:36,346 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-01 16:23:36,347 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-01 16:23:36,357 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:23:36" (1/1) ... [2020-12-01 16:23:36,358 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:23:36" (1/1) ... [2020-12-01 16:23:36,375 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:23:36" (1/1) ... [2020-12-01 16:23:36,377 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:23:36" (1/1) ... [2020-12-01 16:23:36,388 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:23:36" (1/1) ... [2020-12-01 16:23:36,427 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:23:36" (1/1) ... [2020-12-01 16:23:36,431 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:23:36" (1/1) ... [2020-12-01 16:23:36,436 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-01 16:23:36,450 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-01 16:23:36,450 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-01 16:23:36,450 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-01 16:23:36,452 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:23:36" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1b0c744e-eeb1-4fc7-acd5-d40aebd6d0fb/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-12-01 16:23:36,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-01 16:23:36,530 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-01 16:23:36,530 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-01 16:23:36,530 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-01 16:23:40,093 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-01 16:23:40,093 INFO L298 CfgBuilder]: Removed 21 assume(true) statements. [2020-12-01 16:23:40,100 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 04:23:40 BoogieIcfgContainer [2020-12-01 16:23:40,100 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-01 16:23:40,101 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2020-12-01 16:23:40,102 INFO L271 PluginConnector]: Initializing CodeCheck... [2020-12-01 16:23:40,117 INFO L275 PluginConnector]: CodeCheck initialized [2020-12-01 16:23:40,118 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 04:23:40" (1/1) ... [2020-12-01 16:23:40,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 16:23:40,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:23:40,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 19 states and 30 transitions. [2020-12-01 16:23:40,175 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 30 transitions. [2020-12-01 16:23:40,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-12-01 16:23:40,179 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:23:40,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:23:40,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 16:23:41,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:23:41,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 21 states and 34 transitions. [2020-12-01 16:23:41,070 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 34 transitions. [2020-12-01 16:23:41,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-12-01 16:23:41,070 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:23:41,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:23:41,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 16:23:41,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:23:41,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 24 states and 41 transitions. [2020-12-01 16:23:41,792 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 41 transitions. [2020-12-01 16:23:41,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-12-01 16:23:41,793 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:23:41,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:23:41,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 16:23:42,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:23:42,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 28 states and 50 transitions. [2020-12-01 16:23:42,750 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 50 transitions. [2020-12-01 16:23:42,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-01 16:23:42,755 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:23:42,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:23:42,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 16:23:43,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:23:43,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 33 states and 60 transitions. [2020-12-01 16:23:43,876 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 60 transitions. [2020-12-01 16:23:43,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-01 16:23:43,877 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:23:43,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:23:44,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 16:23:45,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:23:45,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 40 states and 74 transitions. [2020-12-01 16:23:45,331 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 74 transitions. [2020-12-01 16:23:45,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-12-01 16:23:45,331 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:23:45,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:23:45,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 16:23:46,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:23:46,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 46 states and 86 transitions. [2020-12-01 16:23:46,677 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 86 transitions. [2020-12-01 16:23:46,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-01 16:23:46,678 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:23:46,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:23:46,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 16:23:47,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:23:47,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 47 states and 87 transitions. [2020-12-01 16:23:47,078 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 87 transitions. [2020-12-01 16:23:47,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-01 16:23:47,079 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:23:47,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:23:47,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 16:23:47,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:23:47,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 48 states and 88 transitions. [2020-12-01 16:23:47,157 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 88 transitions. [2020-12-01 16:23:47,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-01 16:23:47,158 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:23:47,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:23:47,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 16:23:49,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:23:49,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 58 states and 104 transitions. [2020-12-01 16:23:49,335 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 104 transitions. [2020-12-01 16:23:49,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-01 16:23:49,336 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:23:49,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:23:49,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 16:23:49,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:23:49,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 61 states and 109 transitions. [2020-12-01 16:23:49,882 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 109 transitions. [2020-12-01 16:23:49,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-01 16:23:49,883 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:23:49,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:23:50,490 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 16:23:50,867 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 37 [2020-12-01 16:23:54,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:23:54,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 77 states and 149 transitions. [2020-12-01 16:23:54,714 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 149 transitions. [2020-12-01 16:23:54,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-01 16:23:54,716 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:23:54,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:23:55,082 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 16:23:57,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:23:57,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 84 states and 168 transitions. [2020-12-01 16:23:57,741 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 168 transitions. [2020-12-01 16:23:57,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-01 16:23:57,743 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:23:57,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:23:57,921 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 16:23:58,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:23:58,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 85 states and 169 transitions. [2020-12-01 16:23:58,545 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 169 transitions. [2020-12-01 16:23:58,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-01 16:23:58,546 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:23:58,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:23:58,891 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 16:24:01,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:24:01,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 92 states and 187 transitions. [2020-12-01 16:24:01,817 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 187 transitions. [2020-12-01 16:24:01,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-01 16:24:01,818 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:24:01,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:24:01,932 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 16:24:03,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:24:03,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 95 states and 195 transitions. [2020-12-01 16:24:03,902 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 195 transitions. [2020-12-01 16:24:03,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-01 16:24:03,904 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:24:03,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:24:04,037 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 16:24:04,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:24:04,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 96 states and 199 transitions. [2020-12-01 16:24:04,528 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 199 transitions. [2020-12-01 16:24:04,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-01 16:24:04,530 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:24:04,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:24:04,881 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 16:24:08,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:24:08,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 104 states and 218 transitions. [2020-12-01 16:24:08,788 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 218 transitions. [2020-12-01 16:24:08,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-01 16:24:08,789 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:24:08,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:24:08,910 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 16:24:11,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:24:11,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 108 states and 231 transitions. [2020-12-01 16:24:11,404 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 231 transitions. [2020-12-01 16:24:11,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-01 16:24:11,405 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:24:11,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:24:11,524 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 16:24:12,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:24:12,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 109 states and 233 transitions. [2020-12-01 16:24:12,391 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 233 transitions. [2020-12-01 16:24:12,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-01 16:24:12,392 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:24:12,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:24:12,539 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 16:24:13,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:24:13,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 110 states and 238 transitions. [2020-12-01 16:24:13,314 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 238 transitions. [2020-12-01 16:24:13,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-01 16:24:13,315 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:24:13,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:24:14,290 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 16:24:20,852 WARN L197 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 34 [2020-12-01 16:24:21,717 WARN L197 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 35 [2020-12-01 16:24:23,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:24:23,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 129 states and 273 transitions. [2020-12-01 16:24:23,995 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 273 transitions. [2020-12-01 16:24:23,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-01 16:24:23,996 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:24:24,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:24:24,273 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 16:24:25,540 WARN L197 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2020-12-01 16:24:28,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:24:28,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 133 states and 285 transitions. [2020-12-01 16:24:28,162 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 285 transitions. [2020-12-01 16:24:28,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-01 16:24:28,163 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:24:28,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:24:28,365 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 16:24:29,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:24:29,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 134 states and 286 transitions. [2020-12-01 16:24:29,130 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 286 transitions. [2020-12-01 16:24:29,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-12-01 16:24:29,131 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:24:29,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:24:30,279 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 16:24:36,654 WARN L197 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 36 [2020-12-01 16:24:38,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:24:38,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 154 states and 322 transitions. [2020-12-01 16:24:38,934 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 322 transitions. [2020-12-01 16:24:38,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-12-01 16:24:38,934 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:24:39,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:24:39,616 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 16:24:40,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:24:40,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 156 states and 327 transitions. [2020-12-01 16:24:40,470 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 327 transitions. [2020-12-01 16:24:40,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-12-01 16:24:40,470 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:24:40,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:24:41,565 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 16:24:44,018 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2020-12-01 16:24:44,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:24:44,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 158 states and 331 transitions. [2020-12-01 16:24:44,892 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 331 transitions. [2020-12-01 16:24:44,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-12-01 16:24:44,893 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:24:44,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:24:45,205 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 16:24:48,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:24:48,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 163 states and 339 transitions. [2020-12-01 16:24:48,202 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 339 transitions. [2020-12-01 16:24:48,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-12-01 16:24:48,203 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:24:48,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:24:50,510 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 16:24:52,599 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2020-12-01 16:24:53,608 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 39 [2020-12-01 16:25:03,508 WARN L197 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 28 [2020-12-01 16:25:06,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:25:06,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 192 states and 409 transitions. [2020-12-01 16:25:06,227 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 409 transitions. [2020-12-01 16:25:06,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-12-01 16:25:06,228 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:25:06,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:25:06,379 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 16:25:06,649 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 28 [2020-12-01 16:25:06,911 WARN L197 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 29 [2020-12-01 16:25:07,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:25:07,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 197 states and 418 transitions. [2020-12-01 16:25:07,888 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 418 transitions. [2020-12-01 16:25:07,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-12-01 16:25:07,889 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:25:07,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:25:09,285 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 16:25:15,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:25:15,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 201 states and 425 transitions. [2020-12-01 16:25:15,183 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 425 transitions. [2020-12-01 16:25:15,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-12-01 16:25:15,184 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:25:15,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:25:15,316 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 16:25:15,873 WARN L197 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 31 [2020-12-01 16:25:16,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:25:16,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 202 states and 427 transitions. [2020-12-01 16:25:16,997 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 427 transitions. [2020-12-01 16:25:17,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-12-01 16:25:17,000 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:25:17,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:25:17,131 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 16:25:18,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:25:18,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 203 states and 428 transitions. [2020-12-01 16:25:18,332 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 428 transitions. [2020-12-01 16:25:18,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-12-01 16:25:18,342 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:25:18,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:25:21,904 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 16:25:24,643 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 32 [2020-12-01 16:25:25,404 WARN L197 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 34 [2020-12-01 16:25:26,852 WARN L197 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 35 [2020-12-01 16:25:28,067 WARN L197 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 35 [2020-12-01 16:25:28,361 WARN L197 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 37 [2020-12-01 16:25:29,833 WARN L197 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 32 [2020-12-01 16:25:31,143 WARN L197 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 37 [2020-12-01 16:25:31,447 WARN L197 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2020-12-01 16:25:34,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:25:34,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 210 states and 443 transitions. [2020-12-01 16:25:34,947 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 443 transitions. [2020-12-01 16:25:34,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-12-01 16:25:34,948 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:25:35,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:25:35,113 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 16:25:36,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:25:36,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 211 states and 445 transitions. [2020-12-01 16:25:36,513 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 445 transitions. [2020-12-01 16:25:36,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-12-01 16:25:36,514 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:25:36,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:25:38,423 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 16:25:39,923 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 30 [2020-12-01 16:25:42,089 WARN L197 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 33 [2020-12-01 16:25:42,316 WARN L197 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 34 [2020-12-01 16:25:43,576 WARN L197 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 36 [2020-12-01 16:25:43,860 WARN L197 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2020-12-01 16:25:45,004 WARN L197 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2020-12-01 16:25:45,364 WARN L197 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2020-12-01 16:25:47,170 WARN L197 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2020-12-01 16:25:48,999 WARN L197 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2020-12-01 16:25:50,872 WARN L197 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2020-12-01 16:25:52,646 WARN L197 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 31 [2020-12-01 16:25:53,037 WARN L197 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2020-12-01 16:25:54,243 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2020-12-01 16:25:59,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:25:59,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 228 states and 479 transitions. [2020-12-01 16:25:59,189 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 479 transitions. [2020-12-01 16:25:59,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-12-01 16:25:59,189 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:25:59,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:25:59,326 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 16:25:59,644 WARN L197 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 34 [2020-12-01 16:25:59,887 WARN L197 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 35 [2020-12-01 16:26:01,633 WARN L197 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 27 [2020-12-01 16:26:01,944 WARN L197 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 33 [2020-12-01 16:26:03,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:26:03,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 234 states and 490 transitions. [2020-12-01 16:26:03,142 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 490 transitions. [2020-12-01 16:26:03,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-12-01 16:26:03,143 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:26:03,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:26:08,698 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 16:26:10,956 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 30 [2020-12-01 16:26:11,892 WARN L197 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 37 [2020-12-01 16:26:14,329 WARN L197 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 37 [2020-12-01 16:26:15,490 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 27 [2020-12-01 16:26:15,806 WARN L197 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2020-12-01 16:26:17,226 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 27 [2020-12-01 16:26:17,544 WARN L197 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2020-12-01 16:26:18,977 WARN L197 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 30 [2020-12-01 16:26:19,312 WARN L197 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2020-12-01 16:26:21,165 WARN L197 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 33 [2020-12-01 16:26:22,736 WARN L197 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 30 [2020-12-01 16:26:23,174 WARN L197 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2020-12-01 16:26:24,751 WARN L197 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2020-12-01 16:26:26,388 WARN L197 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2020-12-01 16:26:26,968 WARN L197 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2020-12-01 16:26:27,768 WARN L197 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2020-12-01 16:26:28,611 WARN L197 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2020-12-01 16:26:29,163 WARN L197 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 36 [2020-12-01 16:26:29,758 WARN L197 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 39 [2020-12-01 16:26:30,534 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-12-01 16:26:31,354 WARN L197 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2020-12-01 16:26:31,875 WARN L197 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 30 [2020-12-01 16:26:32,436 WARN L197 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 30 [2020-12-01 16:26:34,472 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 20 [2020-12-01 16:26:37,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:26:37,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 248 states and 530 transitions. [2020-12-01 16:26:37,035 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 530 transitions. [2020-12-01 16:26:37,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-12-01 16:26:37,036 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:26:37,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:26:37,460 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 16:26:37,841 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-12-01 16:26:38,255 WARN L197 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2020-12-01 16:26:40,168 WARN L197 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2020-12-01 16:26:40,572 WARN L197 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2020-12-01 16:26:41,371 WARN L197 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2020-12-01 16:26:42,462 WARN L197 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2020-12-01 16:26:42,858 WARN L197 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2020-12-01 16:26:43,662 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2020-12-01 16:26:44,828 WARN L197 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2020-12-01 16:26:45,253 WARN L197 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2020-12-01 16:26:46,091 WARN L197 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2020-12-01 16:26:46,894 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2020-12-01 16:26:47,645 WARN L197 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2020-12-01 16:26:49,556 WARN L197 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 29 [2020-12-01 16:26:49,925 WARN L197 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2020-12-01 16:26:51,792 WARN L197 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 29 [2020-12-01 16:26:52,252 WARN L197 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 32 [2020-12-01 16:26:54,378 WARN L197 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 19 [2020-12-01 16:26:54,818 WARN L197 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 28 [2020-12-01 16:26:56,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:26:56,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 255 states and 545 transitions. [2020-12-01 16:26:56,411 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 545 transitions. [2020-12-01 16:26:56,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-12-01 16:26:56,411 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:26:56,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:26:56,840 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 16:26:57,268 WARN L197 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 26 [2020-12-01 16:26:57,709 WARN L197 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 31 [2020-12-01 16:26:59,680 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 17 [2020-12-01 16:27:00,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:27:00,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 257 states and 556 transitions. [2020-12-01 16:27:00,499 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 556 transitions. [2020-12-01 16:27:00,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-12-01 16:27:00,499 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:27:00,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:27:00,922 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 16:27:01,539 WARN L197 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 32 [2020-12-01 16:27:02,104 WARN L197 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 34 [2020-12-01 16:27:03,799 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-12-01 16:27:04,213 WARN L197 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 23 [2020-12-01 16:27:04,784 WARN L197 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 23 [2020-12-01 16:27:06,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:27:06,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 259 states and 558 transitions. [2020-12-01 16:27:06,416 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 558 transitions. [2020-12-01 16:27:06,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-12-01 16:27:06,417 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:27:06,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:27:06,825 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 16:27:07,345 WARN L197 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 31 [2020-12-01 16:27:07,760 WARN L197 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 32 [2020-12-01 16:27:09,729 WARN L197 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-12-01 16:27:10,081 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-12-01 16:27:10,931 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2020-12-01 16:27:11,754 WARN L197 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2020-12-01 16:27:11,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:27:11,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 261 states and 561 transitions. [2020-12-01 16:27:11,801 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 561 transitions. [2020-12-01 16:27:11,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-12-01 16:27:11,802 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:27:11,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:27:15,123 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 16:27:18,661 WARN L197 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2020-12-01 16:27:19,119 WARN L197 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2020-12-01 16:27:20,036 WARN L197 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2020-12-01 16:27:20,929 WARN L197 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2020-12-01 16:27:21,312 WARN L197 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2020-12-01 16:27:21,800 WARN L197 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2020-12-01 16:27:22,773 WARN L197 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2020-12-01 16:27:23,718 WARN L197 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2020-12-01 16:27:24,179 WARN L197 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2020-12-01 16:27:25,051 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2020-12-01 16:27:30,008 WARN L197 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 19 [2020-12-01 16:27:30,524 WARN L197 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 29 [2020-12-01 16:27:32,280 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2020-12-01 16:27:32,776 WARN L197 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 17 [2020-12-01 16:27:33,310 WARN L197 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 27 [2020-12-01 16:27:35,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:27:35,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 267 states and 580 transitions. [2020-12-01 16:27:35,110 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 580 transitions. [2020-12-01 16:27:35,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-12-01 16:27:35,111 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:27:35,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:27:35,212 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 16:27:35,743 WARN L197 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 33 [2020-12-01 16:27:37,911 WARN L197 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 30 [2020-12-01 16:27:44,168 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-12-01 16:27:45,907 WARN L197 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 22 [2020-12-01 16:27:46,407 WARN L197 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 28 [2020-12-01 16:27:48,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:27:48,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 276 states and 594 transitions. [2020-12-01 16:27:48,461 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 594 transitions. [2020-12-01 16:27:48,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-12-01 16:27:48,462 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:27:48,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:27:48,567 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 16:27:49,301 WARN L197 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 31 [2020-12-01 16:27:51,436 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2020-12-01 16:27:53,815 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2020-12-01 16:27:54,350 WARN L197 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2020-12-01 16:27:55,732 WARN L197 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2020-12-01 16:27:56,766 WARN L197 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2020-12-01 16:27:57,383 WARN L197 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 32 [2020-12-01 16:27:57,972 WARN L197 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 34 [2020-12-01 16:27:59,002 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2020-12-01 16:28:00,043 WARN L197 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-12-01 16:28:00,671 WARN L197 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 26 [2020-12-01 16:28:01,248 WARN L197 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 28 [2020-12-01 16:28:03,458 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2020-12-01 16:28:03,908 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 16 [2020-12-01 16:28:06,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:28:06,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 282 states and 610 transitions. [2020-12-01 16:28:06,252 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 610 transitions. [2020-12-01 16:28:06,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-12-01 16:28:06,253 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:28:06,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:28:06,351 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 16:28:06,802 WARN L197 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 30 [2020-12-01 16:28:07,237 WARN L197 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-12-01 16:28:09,368 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2020-12-01 16:28:09,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:28:09,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 283 states and 616 transitions. [2020-12-01 16:28:09,444 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 616 transitions. [2020-12-01 16:28:09,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-12-01 16:28:09,445 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:28:09,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:28:09,557 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 16:28:10,021 WARN L197 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2020-12-01 16:28:10,458 WARN L197 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2020-12-01 16:28:11,583 WARN L197 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2020-12-01 16:28:12,598 WARN L197 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2020-12-01 16:28:13,176 WARN L197 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 31 [2020-12-01 16:28:13,739 WARN L197 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 33 [2020-12-01 16:28:14,801 WARN L197 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2020-12-01 16:28:15,995 WARN L197 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2020-12-01 16:28:16,391 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 19 [2020-12-01 16:28:16,772 WARN L197 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 21 [2020-12-01 16:28:18,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:28:18,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 286 states and 619 transitions. [2020-12-01 16:28:18,675 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 619 transitions. [2020-12-01 16:28:18,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-12-01 16:28:18,676 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:28:18,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:28:18,771 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-12-01 16:28:20,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:28:20,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 286 states and 618 transitions. [2020-12-01 16:28:20,246 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 618 transitions. [2020-12-01 16:28:20,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-12-01 16:28:20,246 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:28:20,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:28:27,962 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 16:28:29,355 WARN L197 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2020-12-01 16:28:33,562 WARN L197 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2020-12-01 16:28:35,593 WARN L197 SmtUtils]: Spent 499.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2020-12-01 16:28:36,835 WARN L197 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2020-12-01 16:28:38,062 WARN L197 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2020-12-01 16:28:38,600 WARN L197 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2020-12-01 16:28:39,434 WARN L197 SmtUtils]: Spent 531.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2020-12-01 16:28:40,685 WARN L197 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2020-12-01 16:28:41,952 WARN L197 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2020-12-01 16:28:42,467 WARN L197 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2020-12-01 16:28:43,311 WARN L197 SmtUtils]: Spent 546.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2020-12-01 16:28:44,777 WARN L197 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2020-12-01 16:28:46,098 WARN L197 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2020-12-01 16:28:46,914 WARN L197 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2020-12-01 16:28:48,175 WARN L197 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-12-01 16:28:50,180 WARN L197 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 24 [2020-12-01 16:28:50,865 WARN L197 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 24 [2020-12-01 16:28:53,959 WARN L197 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 23 [2020-12-01 16:28:54,677 WARN L197 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 23 [2020-12-01 16:29:03,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:29:03,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 293 states and 637 transitions. [2020-12-01 16:29:03,227 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 637 transitions. [2020-12-01 16:29:03,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-12-01 16:29:03,228 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:29:03,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:29:03,392 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 16:29:04,091 WARN L197 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 31 [2020-12-01 16:29:05,454 WARN L197 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 34 [2020-12-01 16:29:05,866 WARN L197 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 34 [2020-12-01 16:29:08,246 WARN L197 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2020-12-01 16:29:08,707 WARN L197 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 36 [2020-12-01 16:29:11,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:29:11,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 294 states and 638 transitions. [2020-12-01 16:29:11,191 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 638 transitions. [2020-12-01 16:29:11,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-12-01 16:29:11,192 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:29:11,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:29:11,375 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 16:29:11,941 WARN L197 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 27 [2020-12-01 16:29:12,373 WARN L197 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 30 [2020-12-01 16:29:15,001 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 22 [2020-12-01 16:29:15,511 WARN L197 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2020-12-01 16:29:22,515 WARN L197 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 23 [2020-12-01 16:29:23,204 WARN L197 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 23 [2020-12-01 16:29:25,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:29:25,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 300 states and 653 transitions. [2020-12-01 16:29:25,957 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 653 transitions. [2020-12-01 16:29:25,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-12-01 16:29:25,958 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:29:26,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:29:26,136 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 16:29:27,209 WARN L197 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2020-12-01 16:29:29,848 WARN L197 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2020-12-01 16:29:30,516 WARN L197 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 35 [2020-12-01 16:29:31,784 WARN L197 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2020-12-01 16:29:33,131 WARN L197 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2020-12-01 16:29:33,803 WARN L197 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 26 [2020-12-01 16:29:34,477 WARN L197 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 37 [2020-12-01 16:29:36,768 WARN L197 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2020-12-01 16:29:37,312 WARN L197 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-12-01 16:29:38,769 WARN L197 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2020-12-01 16:29:45,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:29:45,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 307 states and 666 transitions. [2020-12-01 16:29:45,233 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 666 transitions. [2020-12-01 16:29:45,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-12-01 16:29:45,234 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:29:45,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:29:45,380 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 16:29:46,190 WARN L197 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 32 [2020-12-01 16:29:46,970 WARN L197 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2020-12-01 16:29:48,251 WARN L197 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2020-12-01 16:29:49,618 WARN L197 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2020-12-01 16:29:50,273 WARN L197 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2020-12-01 16:29:51,797 WARN L197 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2020-12-01 16:29:52,332 WARN L197 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2020-12-01 16:29:52,930 WARN L197 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2020-12-01 16:29:54,190 WARN L197 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2020-12-01 16:29:55,573 WARN L197 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2020-12-01 16:29:55,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:29:55,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 310 states and 669 transitions. [2020-12-01 16:29:55,620 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 669 transitions. [2020-12-01 16:29:55,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-12-01 16:29:55,621 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:29:55,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:29:55,702 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-12-01 16:29:57,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2020-12-01 16:29:57,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 310 states and 668 transitions. [2020-12-01 16:29:57,426 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 668 transitions. [2020-12-01 16:29:57,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-12-01 16:29:57,428 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2020-12-01 16:29:58,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 16:29:58,432 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 16:29:59,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 16:29:59,911 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 16:30:02,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 16:30:02,096 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 16:30:03,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 16:30:03,768 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 16:30:34,875 WARN L483 CodeCheckObserver]: This program is UNSAFE, Check terminated with 54 iterations. [2020-12-01 16:30:35,145 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 01.12 04:30:35 ImpRootNode [2020-12-01 16:30:35,145 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2020-12-01 16:30:35,146 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-01 16:30:35,146 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-01 16:30:35,146 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-01 16:30:35,148 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 04:23:40" (3/4) ... [2020-12-01 16:30:35,150 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-01 16:30:35,367 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_1b0c744e-eeb1-4fc7-acd5-d40aebd6d0fb/bin/ukojak/witness.graphml [2020-12-01 16:30:35,367 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-01 16:30:35,368 INFO L168 Benchmark]: Toolchain (without parser) took 419642.07 ms. Allocated memory was 113.2 MB in the beginning and 1.2 GB in the end (delta: 1.1 GB). Free memory was 82.7 MB in the beginning and 802.3 MB in the end (delta: -719.6 MB). Peak memory consumption was 356.6 MB. Max. memory is 16.1 GB. [2020-12-01 16:30:35,369 INFO L168 Benchmark]: CDTParser took 0.34 ms. Allocated memory is still 81.8 MB. Free memory was 41.4 MB in the beginning and 41.3 MB in the end (delta: 70.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-01 16:30:35,369 INFO L168 Benchmark]: CACSL2BoogieTranslator took 523.63 ms. Allocated memory is still 113.2 MB. Free memory was 82.7 MB in the beginning and 84.1 MB in the end (delta: -1.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-12-01 16:30:35,369 INFO L168 Benchmark]: Boogie Procedure Inliner took 92.76 ms. Allocated memory is still 113.2 MB. Free memory was 84.1 MB in the beginning and 81.1 MB in the end (delta: 3.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-01 16:30:35,370 INFO L168 Benchmark]: Boogie Preprocessor took 103.26 ms. Allocated memory is still 113.2 MB. Free memory was 81.1 MB in the beginning and 78.7 MB in the end (delta: 2.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-12-01 16:30:35,370 INFO L168 Benchmark]: RCFGBuilder took 3650.38 ms. Allocated memory was 113.2 MB in the beginning and 188.7 MB in the end (delta: 75.5 MB). Free memory was 78.3 MB in the beginning and 116.7 MB in the end (delta: -38.4 MB). Peak memory consumption was 66.1 MB. Max. memory is 16.1 GB. [2020-12-01 16:30:35,370 INFO L168 Benchmark]: CodeCheck took 415044.59 ms. Allocated memory was 188.7 MB in the beginning and 1.2 GB in the end (delta: 1.0 GB). Free memory was 116.7 MB in the beginning and 825.5 MB in the end (delta: -708.9 MB). Peak memory consumption was 291.4 MB. Max. memory is 16.1 GB. [2020-12-01 16:30:35,371 INFO L168 Benchmark]: Witness Printer took 221.32 ms. Allocated memory is still 1.2 GB. Free memory was 825.5 MB in the beginning and 802.3 MB in the end (delta: 23.3 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.1 GB. [2020-12-01 16:30:35,373 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: 414.7s, OverallIterations: 54, TraceHistogramMax: 0, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 828320944 SDtfs, -812387082 SDslu, 605641024 SDs, 0 SdLazy, 927537414 SolverSat, -1319060168 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 169.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 14986 GetRequests, 13220 SyntacticMatches, 814 SemanticMatches, 952 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 509868 ImplicationChecksByTransitivity, 356.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.4s SsaConstructionTime, 6.9s SatisfiabilityAnalysisTime, 33.6s InterpolantComputationTime, 1568 NumberOfCodeBlocks, 1568 NumberOfCodeBlocksAsserted, 54 NumberOfCheckSat, 1467 ConstructedInterpolants, 0 QuantifiedInterpolants, 536477 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 53 InterpolantComputations, 12 PerfectInterpolantSequences, 229/937 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 3]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L27] msg_t nomsg = (msg_t )-1; [L28] port_t p12 ; [L29] char p12_old ; [L30] char p12_new ; [L31] _Bool ep12 ; [L32] port_t p13 ; [L33] char p13_old ; [L34] char p13_new ; [L35] _Bool ep13 ; [L36] port_t p21 ; [L37] char p21_old ; [L38] char p21_new ; [L39] _Bool ep21 ; [L40] port_t p23 ; [L41] char p23_old ; [L42] char p23_new ; [L43] _Bool ep23 ; [L44] port_t p31 ; [L45] char p31_old ; [L46] char p31_new ; [L47] _Bool ep31 ; [L48] port_t p32 ; [L49] char p32_old ; [L50] char p32_new ; [L51] _Bool ep32 ; [L52] char id1 ; [L53] char r1 ; [L54] char st1 ; [L55] char nl1 ; [L56] char m1 ; [L57] char max1 ; [L58] _Bool mode1 ; [L59] _Bool newmax1 ; [L60] char id2 ; [L61] char r2 ; [L62] char st2 ; [L63] char nl2 ; [L64] char m2 ; [L65] char max2 ; [L66] _Bool mode2 ; [L67] _Bool newmax2 ; [L68] char id3 ; [L69] char r3 ; [L70] char st3 ; [L71] char nl3 ; [L72] char m3 ; [L73] char max3 ; [L74] _Bool mode3 ; [L75] _Bool newmax3 ; [L518] int c1 ; [L519] int i2 ; [L522] c1 = 0 [L523] ep12 = __VERIFIER_nondet_bool() [L524] ep13 = __VERIFIER_nondet_bool() [L525] ep21 = __VERIFIER_nondet_bool() [L526] ep23 = __VERIFIER_nondet_bool() [L527] ep31 = __VERIFIER_nondet_bool() [L528] ep32 = __VERIFIER_nondet_bool() [L529] id1 = __VERIFIER_nondet_char() [L530] r1 = __VERIFIER_nondet_char() [L531] st1 = __VERIFIER_nondet_char() [L532] nl1 = __VERIFIER_nondet_char() [L533] m1 = __VERIFIER_nondet_char() [L534] max1 = __VERIFIER_nondet_char() [L535] mode1 = __VERIFIER_nondet_bool() [L536] newmax1 = __VERIFIER_nondet_bool() [L537] id2 = __VERIFIER_nondet_char() [L538] r2 = __VERIFIER_nondet_char() [L539] st2 = __VERIFIER_nondet_char() [L540] nl2 = __VERIFIER_nondet_char() [L541] m2 = __VERIFIER_nondet_char() [L542] max2 = __VERIFIER_nondet_char() [L543] mode2 = __VERIFIER_nondet_bool() [L544] newmax2 = __VERIFIER_nondet_bool() [L545] id3 = __VERIFIER_nondet_char() [L546] r3 = __VERIFIER_nondet_char() [L547] st3 = __VERIFIER_nondet_char() [L548] nl3 = __VERIFIER_nondet_char() [L549] m3 = __VERIFIER_nondet_char() [L550] max3 = __VERIFIER_nondet_char() [L551] mode3 = __VERIFIER_nondet_bool() [L552] newmax3 = __VERIFIER_nondet_bool() [L231] _Bool r121 ; [L232] _Bool r131 ; [L233] _Bool r211 ; [L234] _Bool r231 ; [L235] _Bool r311 ; [L236] _Bool r321 ; [L237] _Bool r122 ; [L238] int tmp ; [L239] _Bool r132 ; [L240] int tmp___0 ; [L241] _Bool r212 ; [L242] int tmp___1 ; [L243] _Bool r232 ; [L244] int tmp___2 ; [L245] _Bool r312 ; [L246] int tmp___3 ; [L247] _Bool r322 ; [L248] int tmp___4 ; [L249] int tmp___5 ; [L252] r121 = ep12 [L253] r131 = ep13 [L254] r211 = ep21 [L255] r231 = ep23 [L256] r311 = ep31 [L257] r321 = ep32 [L258] COND TRUE \read(r121) [L259] tmp = 1 [L270] r122 = (_Bool )tmp [L271] COND TRUE \read(r131) [L272] tmp___0 = 1 [L283] r132 = (_Bool )tmp___0 [L284] COND TRUE \read(r211) [L285] tmp___1 = 1 [L296] r212 = (_Bool )tmp___1 [L297] COND FALSE !(\read(r231)) [L300] COND TRUE \read(r211) [L301] COND TRUE \read(ep13) [L302] tmp___2 = 1 [L309] r232 = (_Bool )tmp___2 [L310] COND TRUE \read(r311) [L311] tmp___3 = 1 [L322] r312 = (_Bool )tmp___3 [L323] COND FALSE !(\read(r321)) [L326] COND TRUE \read(r311) [L327] COND TRUE \read(ep12) [L328] tmp___4 = 1 [L335] r322 = (_Bool )tmp___4 [L336] COND TRUE (int )id1 != (int )id2 [L337] COND TRUE (int )id1 != (int )id3 [L338] COND TRUE (int )id2 != (int )id3 [L339] COND TRUE (int )id1 >= 0 [L340] COND TRUE (int )id2 >= 0 [L341] COND TRUE (int )id3 >= 0 [L342] COND TRUE (int )r1 == 0 [L343] COND TRUE (int )r2 == 0 [L344] COND TRUE (int )r3 == 0 [L345] COND TRUE \read(r122) [L346] COND TRUE \read(r132) [L347] COND TRUE \read(r212) [L348] COND TRUE \read(r232) [L349] COND TRUE \read(r312) [L350] COND TRUE \read(r322) [L351] COND TRUE (int )max1 == (int )id1 [L352] COND TRUE (int )max2 == (int )id2 [L353] COND TRUE (int )max3 == (int )id3 [L354] COND TRUE (int )st1 == 0 [L355] COND TRUE (int )st2 == 0 [L356] COND TRUE (int )st3 == 0 [L357] COND TRUE (int )nl1 == 0 [L358] COND TRUE (int )nl2 == 0 [L359] COND TRUE (int )nl3 == 0 [L360] COND TRUE (int )mode1 == 0 [L361] COND TRUE (int )mode2 == 0 [L362] COND TRUE (int )mode3 == 0 [L363] COND TRUE \read(newmax1) [L364] COND TRUE \read(newmax2) [L365] COND TRUE \read(newmax3) [L366] tmp___5 = 1 [L457] return (tmp___5); [L553] i2 = init() [L21] COND FALSE !(!cond) [L555] p12_old = nomsg [L556] p12_new = nomsg [L557] p13_old = nomsg [L558] p13_new = nomsg [L559] p21_old = nomsg [L560] p21_new = nomsg [L561] p23_old = nomsg [L562] p23_new = nomsg [L563] p31_old = nomsg [L564] p31_new = nomsg [L565] p32_old = nomsg [L566] p32_new = nomsg [L567] i2 = 0 VAL [ep12=1, ep13=255, ep21=1, ep23=0, ep31=1, ep32=0, id1=125, id2=126, id3=124, m1=127, m2=-2, m3=127, max1=125, max2=126, max3=124, mode1=0, mode2=0, mode3=0, newmax1=255, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L568] COND TRUE i2 < 6 [L78] _Bool newmax ; [L81] newmax = (_Bool)0 [L82] COND FALSE !(\read(mode1)) [L110] COND TRUE (int )r1 < 2 [L111] COND TRUE \read(ep12) [L112] COND TRUE \read(newmax1) [L113] EXPR max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L113] p12_new = max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L116] COND TRUE \read(ep13) [L117] COND TRUE \read(newmax1) [L118] EXPR max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L118] p13_new = max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L122] mode1 = (_Bool)1 [L129] _Bool newmax ; [L132] newmax = (_Bool)0 [L133] COND FALSE !(\read(mode2)) [L161] COND TRUE (int )r2 < 2 [L162] COND TRUE \read(ep21) [L163] COND TRUE \read(newmax2) [L164] EXPR max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L164] p21_new = max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L167] COND FALSE !(\read(ep23)) [L173] mode2 = (_Bool)1 [L180] _Bool newmax ; [L183] newmax = (_Bool)0 [L184] COND FALSE !(\read(mode3)) [L212] COND TRUE (int )r3 < 2 [L213] COND TRUE \read(ep31) [L214] COND TRUE \read(newmax3) [L215] EXPR max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L215] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L218] COND FALSE !(\read(ep32)) [L224] mode3 = (_Bool)1 [L573] p12_old = p12_new [L574] p12_new = nomsg [L575] p13_old = p13_new [L576] p13_new = nomsg [L577] p21_old = p21_new [L578] p21_new = nomsg [L579] p23_old = p23_new [L580] p23_new = nomsg [L581] p31_old = p31_new [L582] p31_new = nomsg [L583] p32_old = p32_new [L584] p32_new = nomsg [L462] int tmp ; VAL [ep12=1, ep13=255, ep21=1, ep23=0, ep31=1, ep32=0, id1=125, id2=126, id3=124, m1=127, m2=-2, m3=127, max1=125, max2=126, max3=124, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=125, p13=0, p13_new=-1, p13_old=125, p21=0, p21_new=-1, p21_old=126, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=124, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L465] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=255, ep21=1, ep23=0, ep31=1, ep32=0, id1=125, id2=126, id3=124, m1=127, m2=-2, m3=127, max1=125, max2=126, max3=124, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=125, p13=0, p13_new=-1, p13_old=125, p21=0, p21_new=-1, p21_old=126, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=124, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L466] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=255, ep21=1, ep23=0, ep31=1, ep32=0, id1=125, id2=126, id3=124, m1=127, m2=-2, m3=127, max1=125, max2=126, max3=124, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=125, p13=0, p13_new=-1, p13_old=125, p21=0, p21_new=-1, p21_old=126, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=124, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L467] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=255, ep21=1, ep23=0, ep31=1, ep32=0, id1=125, id2=126, id3=124, m1=127, m2=-2, m3=127, max1=125, max2=126, max3=124, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=125, p13=0, p13_new=-1, p13_old=125, p21=0, p21_new=-1, p21_old=126, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=124, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L468] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=255, ep21=1, ep23=0, ep31=1, ep32=0, id1=125, id2=126, id3=124, m1=127, m2=-2, m3=127, max1=125, max2=126, max3=124, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=125, p13=0, p13_new=-1, p13_old=125, p21=0, p21_new=-1, p21_old=126, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=124, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L469] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=255, ep21=1, ep23=0, ep31=1, ep32=0, id1=125, id2=126, id3=124, m1=127, m2=-2, m3=127, max1=125, max2=126, max3=124, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=125, p13=0, p13_new=-1, p13_old=125, p21=0, p21_new=-1, p21_old=126, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=124, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L472] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=255, ep21=1, ep23=0, ep31=1, ep32=0, id1=125, id2=126, id3=124, m1=127, m2=-2, m3=127, max1=125, max2=126, max3=124, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=125, p13=0, p13_new=-1, p13_old=125, p21=0, p21_new=-1, p21_old=126, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=124, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L474] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=255, ep21=1, ep23=0, ep31=1, ep32=0, id1=125, id2=126, id3=124, m1=127, m2=-2, m3=127, max1=125, max2=126, max3=124, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=125, p13=0, p13_new=-1, p13_old=125, p21=0, p21_new=-1, p21_old=126, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=124, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L479] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=255, ep21=1, ep23=0, ep31=1, ep32=0, id1=125, id2=126, id3=124, m1=127, m2=-2, m3=127, max1=125, max2=126, max3=124, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=125, p13=0, p13_new=-1, p13_old=125, p21=0, p21_new=-1, p21_old=126, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=124, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L482] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=255, ep21=1, ep23=0, ep31=1, ep32=0, id1=125, id2=126, id3=124, m1=127, m2=-2, m3=127, max1=125, max2=126, max3=124, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=125, p13=0, p13_new=-1, p13_old=125, p21=0, p21_new=-1, p21_old=126, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=124, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L484] COND TRUE (int )r1 < 2 [L485] tmp = 1 VAL [ep12=1, ep13=255, ep21=1, ep23=0, ep31=1, ep32=0, id1=125, id2=126, id3=124, m1=127, m2=-2, m3=127, max1=125, max2=126, max3=124, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=125, p13=0, p13_new=-1, p13_old=125, p21=0, p21_new=-1, p21_old=126, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=124, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L513] return (tmp); [L585] c1 = check() [L598] COND FALSE !(! arg) VAL [ep12=1, ep13=255, ep21=1, ep23=0, ep31=1, ep32=0, id1=125, id2=126, id3=124, m1=127, m2=-2, m3=127, max1=125, max2=126, max3=124, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=125, p13=0, p13_new=-1, p13_old=125, p21=0, p21_new=-1, p21_old=126, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=124, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L587] i2 ++ VAL [ep12=1, ep13=255, ep21=1, ep23=0, ep31=1, ep32=0, id1=125, id2=126, id3=124, m1=127, m2=-2, m3=127, max1=125, max2=126, max3=124, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=125, p13=0, p13_new=-1, p13_old=125, p21=0, p21_new=-1, p21_old=126, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=124, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L568] COND TRUE i2 < 6 [L78] _Bool newmax ; [L81] newmax = (_Bool)0 [L82] COND TRUE \read(mode1) [L83] r1 = (char )((int )r1 + 1) [L84] COND TRUE \read(ep21) [L85] m1 = p21_old [L86] p21_old = nomsg [L87] COND TRUE (int )m1 > (int )max1 [L88] max1 = m1 [L89] newmax = (_Bool)1 [L92] COND TRUE \read(ep31) [L93] m1 = p31_old [L94] p31_old = nomsg [L95] COND FALSE !((int )m1 > (int )max1) [L100] newmax1 = newmax [L101] COND FALSE !((int )r1 == 2) [L108] mode1 = (_Bool)0 [L129] _Bool newmax ; [L132] newmax = (_Bool)0 [L133] COND TRUE \read(mode2) [L134] r2 = (char )((int )r2 + 1) [L135] COND TRUE \read(ep12) [L136] m2 = p12_old [L137] p12_old = nomsg [L138] COND FALSE !((int )m2 > (int )max2) [L143] COND FALSE !(\read(ep32)) [L151] newmax2 = newmax [L152] COND FALSE !((int )r2 == 2) [L159] mode2 = (_Bool)0 [L180] _Bool newmax ; [L183] newmax = (_Bool)0 [L184] COND TRUE \read(mode3) [L185] r3 = (char )((int )r3 + 1) [L186] COND TRUE \read(ep13) [L187] m3 = p13_old [L188] p13_old = nomsg [L189] COND TRUE (int )m3 > (int )max3 [L190] max3 = m3 [L191] newmax = (_Bool)1 [L194] COND FALSE !(\read(ep23)) [L202] newmax3 = newmax [L203] COND FALSE !((int )r3 == 2) [L210] mode3 = (_Bool)0 [L573] p12_old = p12_new [L574] p12_new = nomsg [L575] p13_old = p13_new [L576] p13_new = nomsg [L577] p21_old = p21_new [L578] p21_new = nomsg [L579] p23_old = p23_new [L580] p23_new = nomsg [L581] p31_old = p31_new [L582] p31_new = nomsg [L583] p32_old = p32_new [L584] p32_new = nomsg [L462] int tmp ; VAL [ep12=1, ep13=255, ep21=1, ep23=0, ep31=1, ep32=0, id1=125, id2=126, id3=124, m1=124, m2=125, m3=125, max1=126, max2=126, max3=125, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L465] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=255, ep21=1, ep23=0, ep31=1, ep32=0, id1=125, id2=126, id3=124, m1=124, m2=125, m3=125, max1=126, max2=126, max3=125, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L466] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=255, ep21=1, ep23=0, ep31=1, ep32=0, id1=125, id2=126, id3=124, m1=124, m2=125, m3=125, max1=126, max2=126, max3=125, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L467] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=255, ep21=1, ep23=0, ep31=1, ep32=0, id1=125, id2=126, id3=124, m1=124, m2=125, m3=125, max1=126, max2=126, max3=125, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L468] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=255, ep21=1, ep23=0, ep31=1, ep32=0, id1=125, id2=126, id3=124, m1=124, m2=125, m3=125, max1=126, max2=126, max3=125, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L469] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=255, ep21=1, ep23=0, ep31=1, ep32=0, id1=125, id2=126, id3=124, m1=124, m2=125, m3=125, max1=126, max2=126, max3=125, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L472] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=255, ep21=1, ep23=0, ep31=1, ep32=0, id1=125, id2=126, id3=124, m1=124, m2=125, m3=125, max1=126, max2=126, max3=125, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L474] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=255, ep21=1, ep23=0, ep31=1, ep32=0, id1=125, id2=126, id3=124, m1=124, m2=125, m3=125, max1=126, max2=126, max3=125, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L479] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=255, ep21=1, ep23=0, ep31=1, ep32=0, id1=125, id2=126, id3=124, m1=124, m2=125, m3=125, max1=126, max2=126, max3=125, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L482] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=255, ep21=1, ep23=0, ep31=1, ep32=0, id1=125, id2=126, id3=124, m1=124, m2=125, m3=125, max1=126, max2=126, max3=125, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L484] COND TRUE (int )r1 < 2 [L485] tmp = 1 VAL [ep12=1, ep13=255, ep21=1, ep23=0, ep31=1, ep32=0, id1=125, id2=126, id3=124, m1=124, m2=125, m3=125, max1=126, max2=126, max3=125, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L513] return (tmp); [L585] c1 = check() [L598] COND FALSE !(! arg) VAL [ep12=1, ep13=255, ep21=1, ep23=0, ep31=1, ep32=0, id1=125, id2=126, id3=124, m1=124, m2=125, m3=125, max1=126, max2=126, max3=125, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L587] i2 ++ VAL [ep12=1, ep13=255, ep21=1, ep23=0, ep31=1, ep32=0, id1=125, id2=126, id3=124, m1=124, m2=125, m3=125, max1=126, max2=126, max3=125, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L568] COND TRUE i2 < 6 [L78] _Bool newmax ; [L81] newmax = (_Bool)0 [L82] COND FALSE !(\read(mode1)) [L110] COND TRUE (int )r1 < 2 [L111] COND TRUE \read(ep12) [L112] COND TRUE \read(newmax1) [L113] EXPR max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L113] p12_new = max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L116] COND TRUE \read(ep13) [L117] COND TRUE \read(newmax1) [L118] EXPR max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L118] p13_new = max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L122] mode1 = (_Bool)1 [L129] _Bool newmax ; [L132] newmax = (_Bool)0 [L133] COND FALSE !(\read(mode2)) [L161] COND TRUE (int )r2 < 2 [L162] COND TRUE \read(ep21) [L163] COND FALSE !(\read(newmax2)) [L167] COND FALSE !(\read(ep23)) [L173] mode2 = (_Bool)1 [L180] _Bool newmax ; [L183] newmax = (_Bool)0 [L184] COND FALSE !(\read(mode3)) [L212] COND TRUE (int )r3 < 2 [L213] COND TRUE \read(ep31) [L214] COND TRUE \read(newmax3) [L215] EXPR max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L215] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L218] COND FALSE !(\read(ep32)) [L224] mode3 = (_Bool)1 [L573] p12_old = p12_new [L574] p12_new = nomsg [L575] p13_old = p13_new [L576] p13_new = nomsg [L577] p21_old = p21_new [L578] p21_new = nomsg [L579] p23_old = p23_new [L580] p23_new = nomsg [L581] p31_old = p31_new [L582] p31_new = nomsg [L583] p32_old = p32_new [L584] p32_new = nomsg [L462] int tmp ; VAL [ep12=1, ep13=255, ep21=1, ep23=0, ep31=1, ep32=0, id1=125, id2=126, id3=124, m1=124, m2=125, m3=125, max1=126, max2=126, max3=125, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=125, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L465] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=255, ep21=1, ep23=0, ep31=1, ep32=0, id1=125, id2=126, id3=124, m1=124, m2=125, m3=125, max1=126, max2=126, max3=125, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=125, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L466] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=255, ep21=1, ep23=0, ep31=1, ep32=0, id1=125, id2=126, id3=124, m1=124, m2=125, m3=125, max1=126, max2=126, max3=125, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=125, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L467] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=255, ep21=1, ep23=0, ep31=1, ep32=0, id1=125, id2=126, id3=124, m1=124, m2=125, m3=125, max1=126, max2=126, max3=125, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=125, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L468] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=255, ep21=1, ep23=0, ep31=1, ep32=0, id1=125, id2=126, id3=124, m1=124, m2=125, m3=125, max1=126, max2=126, max3=125, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=125, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L469] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=255, ep21=1, ep23=0, ep31=1, ep32=0, id1=125, id2=126, id3=124, m1=124, m2=125, m3=125, max1=126, max2=126, max3=125, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=125, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L472] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=255, ep21=1, ep23=0, ep31=1, ep32=0, id1=125, id2=126, id3=124, m1=124, m2=125, m3=125, max1=126, max2=126, max3=125, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=125, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L474] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=255, ep21=1, ep23=0, ep31=1, ep32=0, id1=125, id2=126, id3=124, m1=124, m2=125, m3=125, max1=126, max2=126, max3=125, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=125, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L479] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=255, ep21=1, ep23=0, ep31=1, ep32=0, id1=125, id2=126, id3=124, m1=124, m2=125, m3=125, max1=126, max2=126, max3=125, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=125, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L482] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=255, ep21=1, ep23=0, ep31=1, ep32=0, id1=125, id2=126, id3=124, m1=124, m2=125, m3=125, max1=126, max2=126, max3=125, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=125, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L484] COND TRUE (int )r1 < 2 [L485] tmp = 1 VAL [ep12=1, ep13=255, ep21=1, ep23=0, ep31=1, ep32=0, id1=125, id2=126, id3=124, m1=124, m2=125, m3=125, max1=126, max2=126, max3=125, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=125, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L513] return (tmp); [L585] c1 = check() [L598] COND FALSE !(! arg) VAL [ep12=1, ep13=255, ep21=1, ep23=0, ep31=1, ep32=0, id1=125, id2=126, id3=124, m1=124, m2=125, m3=125, max1=126, max2=126, max3=125, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=125, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L587] i2 ++ VAL [ep12=1, ep13=255, ep21=1, ep23=0, ep31=1, ep32=0, id1=125, id2=126, id3=124, m1=124, m2=125, m3=125, max1=126, max2=126, max3=125, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=126, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=125, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L568] COND TRUE i2 < 6 [L78] _Bool newmax ; [L81] newmax = (_Bool)0 [L82] COND TRUE \read(mode1) [L83] r1 = (char )((int )r1 + 1) [L84] COND TRUE \read(ep21) [L85] m1 = p21_old [L86] p21_old = nomsg [L87] COND FALSE !((int )m1 > (int )max1) [L92] COND TRUE \read(ep31) [L93] m1 = p31_old [L94] p31_old = nomsg [L95] COND FALSE !((int )m1 > (int )max1) [L100] newmax1 = newmax [L101] COND TRUE (int )r1 == 2 [L102] COND FALSE !((int )max1 == (int )id1) [L105] st1 = (char)1 [L108] mode1 = (_Bool)0 [L129] _Bool newmax ; [L132] newmax = (_Bool)0 [L133] COND TRUE \read(mode2) [L134] r2 = (char )((int )r2 + 1) [L135] COND TRUE \read(ep12) [L136] m2 = p12_old [L137] p12_old = nomsg [L138] COND FALSE !((int )m2 > (int )max2) [L143] COND FALSE !(\read(ep32)) [L151] newmax2 = newmax [L152] COND TRUE (int )r2 == 2 [L153] COND TRUE (int )max2 == (int )id2 [L154] st2 = (char)1 [L159] mode2 = (_Bool)0 [L180] _Bool newmax ; [L183] newmax = (_Bool)0 [L184] COND TRUE \read(mode3) [L185] r3 = (char )((int )r3 + 1) [L186] COND TRUE \read(ep13) [L187] m3 = p13_old [L188] p13_old = nomsg [L189] COND TRUE (int )m3 > (int )max3 [L190] max3 = m3 [L191] newmax = (_Bool)1 [L194] COND FALSE !(\read(ep23)) [L202] newmax3 = newmax [L203] COND TRUE (int )r3 == 2 [L204] COND FALSE !((int )max3 == (int )id3) [L207] nl3 = (char)1 [L210] mode3 = (_Bool)0 [L573] p12_old = p12_new [L574] p12_new = nomsg [L575] p13_old = p13_new [L576] p13_new = nomsg [L577] p21_old = p21_new [L578] p21_new = nomsg [L579] p23_old = p23_new [L580] p23_new = nomsg [L581] p31_old = p31_new [L582] p31_new = nomsg [L583] p32_old = p32_new [L584] p32_new = nomsg [L462] int tmp ; VAL [ep12=1, ep13=255, ep21=1, ep23=0, ep31=1, ep32=0, id1=125, id2=126, id3=124, m1=125, m2=126, m3=126, max1=126, max2=126, max3=126, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, 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] [L465] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L511] tmp = 0 VAL [ep12=1, ep13=255, ep21=1, ep23=0, ep31=1, ep32=0, id1=125, id2=126, id3=124, m1=125, m2=126, m3=126, max1=126, max2=126, max3=126, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, 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] [L513] return (tmp); [L585] c1 = check() [L598] COND TRUE ! arg VAL [ep12=1, ep13=255, ep21=1, ep23=0, ep31=1, ep32=0, id1=125, id2=126, id3=124, m1=125, m2=126, m3=126, max1=126, max2=126, max3=126, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, 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_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c", 3, "reach_error") VAL [ep12=1, ep13=255, ep21=1, ep23=0, ep31=1, ep32=0, id1=125, id2=126, id3=124, m1=125, m2=126, m3=126, max1=126, max2=126, max3=126, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, 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.34 ms. Allocated memory is still 81.8 MB. Free memory was 41.4 MB in the beginning and 41.3 MB in the end (delta: 70.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 523.63 ms. Allocated memory is still 113.2 MB. Free memory was 82.7 MB in the beginning and 84.1 MB in the end (delta: -1.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 92.76 ms. Allocated memory is still 113.2 MB. Free memory was 84.1 MB in the beginning and 81.1 MB in the end (delta: 3.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 103.26 ms. Allocated memory is still 113.2 MB. Free memory was 81.1 MB in the beginning and 78.7 MB in the end (delta: 2.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 3650.38 ms. Allocated memory was 113.2 MB in the beginning and 188.7 MB in the end (delta: 75.5 MB). Free memory was 78.3 MB in the beginning and 116.7 MB in the end (delta: -38.4 MB). Peak memory consumption was 66.1 MB. Max. memory is 16.1 GB. * CodeCheck took 415044.59 ms. Allocated memory was 188.7 MB in the beginning and 1.2 GB in the end (delta: 1.0 GB). Free memory was 116.7 MB in the beginning and 825.5 MB in the end (delta: -708.9 MB). Peak memory consumption was 291.4 MB. Max. memory is 16.1 GB. * Witness Printer took 221.32 ms. Allocated memory is still 1.2 GB. Free memory was 825.5 MB in the beginning and 802.3 MB in the end (delta: 23.3 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...