./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label43_false-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_646b6e07-5f32-454f-bffa-7cdc1e8785ba/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_646b6e07-5f32-454f-bffa-7cdc1e8785ba/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_646b6e07-5f32-454f-bffa-7cdc1e8785ba/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_646b6e07-5f32-454f-bffa-7cdc1e8785ba/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label43_false-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_646b6e07-5f32-454f-bffa-7cdc1e8785ba/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_646b6e07-5f32-454f-bffa-7cdc1e8785ba/bin-2019/ukojak --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3aae675ead2f575cce05887b769a7a66f133447b ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.1.23-1dbac8b [2018-11-10 02:28:03,271 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 02:28:03,272 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 02:28:03,279 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 02:28:03,280 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 02:28:03,280 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 02:28:03,281 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 02:28:03,282 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 02:28:03,283 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 02:28:03,283 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 02:28:03,284 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 02:28:03,284 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 02:28:03,285 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 02:28:03,286 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 02:28:03,286 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 02:28:03,287 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 02:28:03,287 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 02:28:03,289 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 02:28:03,290 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 02:28:03,291 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 02:28:03,292 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 02:28:03,292 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 02:28:03,294 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 02:28:03,294 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 02:28:03,294 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 02:28:03,295 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 02:28:03,296 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 02:28:03,296 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 02:28:03,297 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 02:28:03,297 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 02:28:03,298 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 02:28:03,298 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 02:28:03,298 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 02:28:03,298 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 02:28:03,299 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 02:28:03,299 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 02:28:03,300 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_646b6e07-5f32-454f-bffa-7cdc1e8785ba/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-10 02:28:03,310 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 02:28:03,310 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 02:28:03,311 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 02:28:03,311 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 02:28:03,311 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 02:28:03,311 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 02:28:03,312 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 02:28:03,312 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 02:28:03,312 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 02:28:03,312 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 02:28:03,312 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 02:28:03,312 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 02:28:03,312 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 02:28:03,312 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 02:28:03,312 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 02:28:03,312 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 02:28:03,313 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 02:28:03,313 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-10 02:28:03,313 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-10 02:28:03,313 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 02:28:03,313 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 02:28:03,313 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-10 02:28:03,313 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 02:28:03,314 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 02:28:03,314 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 02:28:03,314 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-10 02:28:03,314 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 02:28:03,314 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 02:28:03,314 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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/working_dir_646b6e07-5f32-454f-bffa-7cdc1e8785ba/bin-2019/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(__VERIFIER_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 -> 3aae675ead2f575cce05887b769a7a66f133447b [2018-11-10 02:28:03,335 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 02:28:03,343 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 02:28:03,345 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 02:28:03,346 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 02:28:03,346 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 02:28:03,347 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_646b6e07-5f32-454f-bffa-7cdc1e8785ba/bin-2019/ukojak/../../sv-benchmarks/c/eca-rers2012/Problem02_label43_false-unreach-call_false-termination.c [2018-11-10 02:28:03,381 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_646b6e07-5f32-454f-bffa-7cdc1e8785ba/bin-2019/ukojak/data/bbe85a4bc/9378b038d5b542c495f2d0794cd8fe7d/FLAG9d4b374e1 [2018-11-10 02:28:03,844 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 02:28:03,845 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_646b6e07-5f32-454f-bffa-7cdc1e8785ba/sv-benchmarks/c/eca-rers2012/Problem02_label43_false-unreach-call_false-termination.c [2018-11-10 02:28:03,854 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_646b6e07-5f32-454f-bffa-7cdc1e8785ba/bin-2019/ukojak/data/bbe85a4bc/9378b038d5b542c495f2d0794cd8fe7d/FLAG9d4b374e1 [2018-11-10 02:28:03,865 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_646b6e07-5f32-454f-bffa-7cdc1e8785ba/bin-2019/ukojak/data/bbe85a4bc/9378b038d5b542c495f2d0794cd8fe7d [2018-11-10 02:28:03,868 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 02:28:03,869 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 02:28:03,870 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 02:28:03,870 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 02:28:03,873 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 02:28:03,874 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:28:03" (1/1) ... [2018-11-10 02:28:03,876 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32089edc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:28:03, skipping insertion in model container [2018-11-10 02:28:03,876 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:28:03" (1/1) ... [2018-11-10 02:28:03,884 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 02:28:03,918 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 02:28:04,133 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 02:28:04,137 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 02:28:04,202 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 02:28:04,214 INFO L193 MainTranslator]: Completed translation [2018-11-10 02:28:04,215 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:28:04 WrapperNode [2018-11-10 02:28:04,215 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 02:28:04,215 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 02:28:04,215 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 02:28:04,216 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 02:28:04,222 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:28:04" (1/1) ... [2018-11-10 02:28:04,286 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:28:04" (1/1) ... [2018-11-10 02:28:04,320 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 02:28:04,321 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 02:28:04,321 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 02:28:04,321 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 02:28:04,329 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:28:04" (1/1) ... [2018-11-10 02:28:04,329 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:28:04" (1/1) ... [2018-11-10 02:28:04,332 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:28:04" (1/1) ... [2018-11-10 02:28:04,332 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:28:04" (1/1) ... [2018-11-10 02:28:04,345 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:28:04" (1/1) ... [2018-11-10 02:28:04,353 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:28:04" (1/1) ... [2018-11-10 02:28:04,357 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:28:04" (1/1) ... [2018-11-10 02:28:04,361 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 02:28:04,362 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 02:28:04,362 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 02:28:04,362 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 02:28:04,363 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:28:04" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_646b6e07-5f32-454f-bffa-7cdc1e8785ba/bin-2019/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 [2018-11-10 02:28:04,409 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-10 02:28:04,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 02:28:04,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 02:28:05,929 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 02:28:05,929 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 02:28:05 BoogieIcfgContainer [2018-11-10 02:28:05,929 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 02:28:05,930 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-10 02:28:05,930 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-10 02:28:05,938 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-10 02:28:05,938 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 02:28:05" (1/1) ... [2018-11-10 02:28:05,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:28:05,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 02:28:05,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 86 states and 164 transitions. [2018-11-10 02:28:05,971 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 164 transitions. [2018-11-10 02:28:05,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-10 02:28:05,975 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 02:28:06,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:28:06,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:28:06,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 02:28:06,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 165 states and 278 transitions. [2018-11-10 02:28:06,593 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 278 transitions. [2018-11-10 02:28:06,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-10 02:28:06,595 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 02:28:06,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:28:06,659 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:28:06,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 02:28:06,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 169 states and 284 transitions. [2018-11-10 02:28:06,696 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 284 transitions. [2018-11-10 02:28:06,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-10 02:28:06,698 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 02:28:06,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:28:06,746 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:28:06,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 02:28:06,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 174 states and 291 transitions. [2018-11-10 02:28:06,920 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 291 transitions. [2018-11-10 02:28:06,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-10 02:28:06,921 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 02:28:06,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:28:06,963 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:28:07,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 02:28:07,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 180 states and 301 transitions. [2018-11-10 02:28:07,059 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 301 transitions. [2018-11-10 02:28:07,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-10 02:28:07,063 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 02:28:07,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:28:07,093 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:28:07,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 02:28:07,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 187 states and 314 transitions. [2018-11-10 02:28:07,244 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 314 transitions. [2018-11-10 02:28:07,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-10 02:28:07,246 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 02:28:07,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:28:07,319 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:28:07,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 02:28:07,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 267 states and 397 transitions. [2018-11-10 02:28:07,724 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 397 transitions. [2018-11-10 02:28:07,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-10 02:28:07,725 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 02:28:07,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:28:07,772 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:28:07,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 02:28:07,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 272 states and 406 transitions. [2018-11-10 02:28:07,951 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 406 transitions. [2018-11-10 02:28:07,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-10 02:28:07,953 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 02:28:07,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:28:07,991 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:28:08,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 02:28:08,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 276 states and 412 transitions. [2018-11-10 02:28:08,082 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 412 transitions. [2018-11-10 02:28:08,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-10 02:28:08,083 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 02:28:08,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:28:08,101 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 02:28:08,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 02:28:08,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 281 states and 419 transitions. [2018-11-10 02:28:08,305 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 419 transitions. [2018-11-10 02:28:08,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-10 02:28:08,306 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 02:28:08,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:28:08,324 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 02:28:08,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 02:28:08,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 285 states and 423 transitions. [2018-11-10 02:28:08,410 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 423 transitions. [2018-11-10 02:28:08,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-10 02:28:08,411 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 02:28:08,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:28:08,428 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 02:28:08,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 02:28:08,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 288 states and 426 transitions. [2018-11-10 02:28:08,464 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 426 transitions. [2018-11-10 02:28:08,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-10 02:28:08,465 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 02:28:08,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:28:08,483 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 02:28:08,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 02:28:08,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 291 states and 429 transitions. [2018-11-10 02:28:08,525 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 429 transitions. [2018-11-10 02:28:08,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-10 02:28:08,526 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 02:28:08,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:28:08,549 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 02:28:08,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 02:28:08,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 293 states and 431 transitions. [2018-11-10 02:28:08,565 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 431 transitions. [2018-11-10 02:28:08,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-10 02:28:08,566 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 02:28:08,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:28:08,589 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:28:08,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 02:28:08,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 298 states and 436 transitions. [2018-11-10 02:28:08,624 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 436 transitions. [2018-11-10 02:28:08,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-10 02:28:08,625 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 02:28:08,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:28:08,646 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:28:08,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 02:28:08,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 300 states and 438 transitions. [2018-11-10 02:28:08,668 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 438 transitions. [2018-11-10 02:28:08,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-10 02:28:08,668 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 02:28:08,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:28:08,689 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:28:08,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 02:28:08,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 304 states and 442 transitions. [2018-11-10 02:28:08,722 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 442 transitions. [2018-11-10 02:28:08,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-10 02:28:08,723 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 02:28:08,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:28:08,801 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-10 02:28:09,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 02:28:09,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 323 states and 470 transitions. [2018-11-10 02:28:09,103 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 470 transitions. [2018-11-10 02:28:09,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-10 02:28:09,104 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 02:28:09,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:28:09,128 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:28:09,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 02:28:09,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 324 states and 471 transitions. [2018-11-10 02:28:09,148 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 471 transitions. [2018-11-10 02:28:09,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-10 02:28:09,149 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 02:28:09,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:28:09,182 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:28:09,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 02:28:09,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 325 states and 472 transitions. [2018-11-10 02:28:09,208 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 472 transitions. [2018-11-10 02:28:09,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-11-10 02:28:09,209 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 02:28:09,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:28:09,255 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 02:28:09,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 02:28:09,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 345 states and 495 transitions. [2018-11-10 02:28:09,600 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 495 transitions. [2018-11-10 02:28:09,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-11-10 02:28:09,600 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 02:28:09,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:28:09,667 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:28:09,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 02:28:09,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 352 states and 504 transitions. [2018-11-10 02:28:09,886 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 504 transitions. [2018-11-10 02:28:09,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-11-10 02:28:09,887 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 02:28:09,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:28:09,911 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 02:28:10,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 02:28:10,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 358 states and 512 transitions. [2018-11-10 02:28:10,170 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 512 transitions. [2018-11-10 02:28:10,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-11-10 02:28:10,170 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 02:28:10,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:28:10,203 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:28:10,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 02:28:10,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 438 states and 595 transitions. [2018-11-10 02:28:10,610 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 595 transitions. [2018-11-10 02:28:10,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-11-10 02:28:10,611 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 02:28:10,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:28:10,658 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:28:11,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 02:28:11,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 447 states and 607 transitions. [2018-11-10 02:28:11,091 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 607 transitions. [2018-11-10 02:28:11,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-11-10 02:28:11,091 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 02:28:11,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:28:11,106 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-10 02:28:11,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 02:28:11,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 452 states and 614 transitions. [2018-11-10 02:28:11,326 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 614 transitions. [2018-11-10 02:28:11,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-11-10 02:28:11,327 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 02:28:11,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:28:11,342 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-10 02:28:11,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 02:28:11,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 456 states and 618 transitions. [2018-11-10 02:28:11,442 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 618 transitions. [2018-11-10 02:28:11,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-10 02:28:11,443 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 02:28:11,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:28:11,515 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 02:28:12,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 02:28:12,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 479 states and 646 transitions. [2018-11-10 02:28:12,365 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 646 transitions. [2018-11-10 02:28:12,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-10 02:28:12,366 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 02:28:12,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:28:12,466 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:28:12,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 02:28:12,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 489 states and 657 transitions. [2018-11-10 02:28:12,800 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 657 transitions. [2018-11-10 02:28:12,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-10 02:28:12,800 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 02:28:12,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:28:12,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:28:12,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:28:12,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:28:12,929 WARN L496 CodeCheckObserver]: This program is UNSAFE, Check terminated with 29 iterations. [2018-11-10 02:28:13,004 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 10.11 02:28:13 ImpRootNode [2018-11-10 02:28:13,004 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-10 02:28:13,005 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 02:28:13,005 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 02:28:13,005 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 02:28:13,006 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 02:28:05" (3/4) ... [2018-11-10 02:28:13,008 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-10 02:28:13,089 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_646b6e07-5f32-454f-bffa-7cdc1e8785ba/bin-2019/ukojak/witness.graphml [2018-11-10 02:28:13,089 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 02:28:13,089 INFO L168 Benchmark]: Toolchain (without parser) took 9220.76 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 415.8 MB). Free memory was 957.5 MB in the beginning and 1.2 GB in the end (delta: -278.4 MB). Peak memory consumption was 137.4 MB. Max. memory is 11.5 GB. [2018-11-10 02:28:13,090 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 02:28:13,090 INFO L168 Benchmark]: CACSL2BoogieTranslator took 345.14 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 922.6 MB in the end (delta: 34.9 MB). Peak memory consumption was 34.9 MB. Max. memory is 11.5 GB. [2018-11-10 02:28:13,090 INFO L168 Benchmark]: Boogie Procedure Inliner took 105.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 922.6 MB in the beginning and 1.1 GB in the end (delta: -213.8 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2018-11-10 02:28:13,091 INFO L168 Benchmark]: Boogie Preprocessor took 40.71 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 4.8 MB). Peak memory consumption was 4.8 MB. Max. memory is 11.5 GB. [2018-11-10 02:28:13,091 INFO L168 Benchmark]: RCFGBuilder took 1567.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 882.2 MB in the end (delta: 249.4 MB). Peak memory consumption was 249.4 MB. Max. memory is 11.5 GB. [2018-11-10 02:28:13,091 INFO L168 Benchmark]: CodeCheck took 7074.49 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 268.4 MB). Free memory was 882.2 MB in the beginning and 1.2 GB in the end (delta: -364.9 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 02:28:13,092 INFO L168 Benchmark]: Witness Printer took 84.05 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 11.5 GB. [2018-11-10 02:28:13,093 INFO L336 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, 228 locations, 1 error locations. UNSAFE Result, 6.9s OverallTime, 29 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: -1343217476 SDtfs, 373416140 SDslu, -762255884 SDs, 0 SdLazy, 615118656 SolverSat, -57286536 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 23.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 22723 GetRequests, 22469 SyntacticMatches, 68 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19625 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 2977 NumberOfCodeBlocks, 2977 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 2832 ConstructedInterpolants, 0 QuantifiedInterpolants, 485047 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 PerfectInterpolantSequences, 665/665 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 427]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L7] int a= 1; [L8] int e= 5; [L9] int d= 4; [L10] int f= 6; [L11] int c= 3; [L14] int u = 21; [L15] int v = 22; [L16] int w = 23; [L17] int x = 24; [L18] int y = 25; [L19] int z = 26; [L22] int a25 = 0; [L23] int a11 = 0; [L24] int a28 = 7; [L25] int a19 = 1; [L26] int a21 = 1; [L27] int a17 = 8; [L603] int output = -1; VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L614] CALL, EXPR calculate_output(input) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L50] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L74] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L91] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L95] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L99] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L106] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L113] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L130] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L143] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L159] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND TRUE (((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1)) [L166] a25 = 1 [L167] a28 = 9 [L168] RET return 26; VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L614] EXPR calculate_output(input) [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L614] CALL, EXPR calculate_output(input) [L30] COND TRUE (((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8)) [L31] a28 = 9 [L32] a11 = 1 [L33] a25 = 1 [L34] RET return -1; VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L614] EXPR calculate_output(input) [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L614] CALL calculate_output(input) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L50] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L74] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L91] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L95] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L99] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L106] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L113] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L130] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L143] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L159] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !((((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L169] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L179] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L185] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L187] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L191] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L198] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L202] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L212] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L215] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L225] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L232] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L234] COND FALSE !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L237] COND FALSE !((!(a11==1)&&(((a17==8)&&((((!(a25==1)&&(a28==11))||((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1))))&&(input==3))&&(a21==1)))&&!(a19==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((((!(a11==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==5)))&&(a21==1))&&!(a19==1))&&(a17==8))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L253] COND FALSE !((((a17==9)&&(((((input==1)&&((a25==1)||!(a25==1)))&&(a11==1))&&(a21==1))&&(a19==1)))&&(a28==9))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L259] COND FALSE !((!(a11==1)&&((a19==1)&&(((((a28==9)&&(input==6))&&(a21==1))&&(a17==8))&&!(a25==1))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((a17==9)&&((a21==1)&&((a11==1)&&(((input==3)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a19==1)))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L276] COND FALSE !(((a28==7)&&((a17==8)&&(!(a25==1)&&((a21==1)&&((a19==1)&&((input==5)&&!(a11==1)))))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L280] COND FALSE !(((a28==8)&&((a21==1)&&((!(a11==1)&&(((input==1)&&(a17==8))&&(a19==1)))&&(a25==1))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !((((((a17==8)&&(((input==6)&&((a25==1)||!(a25==1)))&&(a21==1)))&&(a28==10))&&!(a11==1))&&(a19==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((!(a11==1)&&((!(a19==1)&&(((!(a25==1)&&(a28==11))||(((a28==10)&&!(a25==1))||((a25==1)&&(a28==11))))&&(input==5)))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L291] COND FALSE !(((a17==8)&&(((a21==1)&&(!(a11==1)&&((a25==1)&&((a28==8)&&(input==6)))))&&(a19==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L293] COND FALSE !((((a19==1)&&((a17==8)&&(((!(a25==1)&&(input==5))&&(a21==1))&&!(a11==1))))&&(a28==11))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L297] COND FALSE !(((a11==1)&&(((a17==9)&&((a28==9)&&((a19==1)&&(((a25==1)||!(a25==1))&&(input==5)))))&&(a21==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((((((input==3)&&(a19==1))&&(a21==1))&&(a17==8))&&!(a25==1))&&(a28==11))&&!(a11==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L314] COND FALSE !(((a19==1)&&((a21==1)&&((((input==5)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a11==1))&&(a17==9))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((((a19==1)&&(((!(a11==1)&&(((a25==1)||!(a25==1))&&(input==3)))&&(a28==10))&&(a21==1)))&&(a17==8))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L331] COND FALSE !(((!(a11==1)&&(((((input==4)&&(a17==8))&&!(a25==1))&&(a21==1))&&(a28==11)))&&(a19==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L337] COND FALSE !((((!(a19==1)&&(((input==4)&&(((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1)))||(!(a25==1)&&(a28==11))))&&(a21==1)))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L349] COND FALSE !((!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L354] COND FALSE !((((((a21==1)&&((((a28==8)&&!(a25==1))||((a28==9)&&(a25==1)))&&(input==6)))&&!(a11==1))&&!(a19==1))&&(a17==8))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L361] COND FALSE !(((a19==1)&&((((a21==1)&&((!(a25==1)&&(input==3))&&(a17==9)))&&(a28==8))&&(a11==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L368] COND FALSE !(((a17==8)&&(((a21==1)&&(((input==5)&&((!(a25==1)&&(a28==8))||((a28==9)&&(a25==1))))&&(a19==1)))&&!(a11==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L375] COND FALSE !(((a19==1)&&(((((a17==8)&&((input==5)&&!(a11==1)))&&(a21==1))&&(a25==1))&&(a28==8)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L378] COND FALSE !((((!(a11==1)&&((((a21==1)&&(input==4))&&(a28==10))&&(a17==8)))&&!(a19==1))&&(a25==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L380] COND FALSE !(((a28==8)&&(((a19==1)&&((a11==1)&&(!(a25==1)&&((a17==9)&&(input==6)))))&&(a21==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L389] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==6)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))&&(a17==8))&&!(a19==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L394] COND FALSE !((((((!(a25==1)&&((a19==1)&&(input==3)))&&(a28==9))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L398] COND FALSE !((((a17==8)&&((((input==4)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9))))&&(a21==1))&&!(a19==1)))&&!(a11==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L402] COND FALSE !((((!(a11==1)&&((((a19==1)&&(input==5))&&(a17==8))&&(a21==1)))&&(a28==9))&&!(a25==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L404] COND FALSE !((((a11==1)&&((a19==1)&&((a21==1)&&(((a17==9)&&(input==5))&&!(a25==1)))))&&(a28==8))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L407] COND FALSE !((!(a11==1)&&((a21==1)&&(((a19==1)&&((a17==8)&&((a25==1)&&(input==5))))&&(a28==11))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L409] COND FALSE !(((a19==1)&&((a17==8)&&(((((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))&&!(a11==1))&&(a21==1))))) [L414] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==7))&&!(a19==1))&&(a21==1))&&(a17==8))) [L417] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==10))&&(a19==1))&&(a21==1))&&(a17==8))) [L420] COND FALSE !(((((((a25==1)&&!(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==8))) [L423] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==7))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L426] COND TRUE ((((((a25==1)&&(a11==1))&&(a28==9))&&(a19==1))&&(a21==1))&&(a17==8)) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L427] __VERIFIER_error() VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 345.14 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 922.6 MB in the end (delta: 34.9 MB). Peak memory consumption was 34.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 105.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 922.6 MB in the beginning and 1.1 GB in the end (delta: -213.8 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.71 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 4.8 MB). Peak memory consumption was 4.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1567.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 882.2 MB in the end (delta: 249.4 MB). Peak memory consumption was 249.4 MB. Max. memory is 11.5 GB. * CodeCheck took 7074.49 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 268.4 MB). Free memory was 882.2 MB in the beginning and 1.2 GB in the end (delta: -364.9 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 84.05 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...