./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label13_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_5de48303-7f94-4d7d-b237-5258f7a9eae2/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5de48303-7f94-4d7d-b237-5258f7a9eae2/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5de48303-7f94-4d7d-b237-5258f7a9eae2/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5de48303-7f94-4d7d-b237-5258f7a9eae2/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label13_false-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_5de48303-7f94-4d7d-b237-5258f7a9eae2/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5de48303-7f94-4d7d-b237-5258f7a9eae2/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 9f300f737133e82ccd4d7d6f0d6ac5569b27b6d9 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 04:36:25,506 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 04:36:25,507 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 04:36:25,516 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 04:36:25,516 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 04:36:25,517 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 04:36:25,518 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 04:36:25,519 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 04:36:25,521 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 04:36:25,521 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 04:36:25,523 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 04:36:25,523 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 04:36:25,524 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 04:36:25,525 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 04:36:25,525 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 04:36:25,527 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 04:36:25,527 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 04:36:25,529 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 04:36:25,531 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 04:36:25,532 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 04:36:25,533 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 04:36:25,534 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 04:36:25,536 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 04:36:25,536 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 04:36:25,536 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 04:36:25,537 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 04:36:25,538 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 04:36:25,539 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 04:36:25,540 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 04:36:25,540 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 04:36:25,541 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 04:36:25,541 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 04:36:25,541 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 04:36:25,541 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 04:36:25,543 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 04:36:25,543 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 04:36:25,544 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5de48303-7f94-4d7d-b237-5258f7a9eae2/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-10 04:36:25,555 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 04:36:25,556 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 04:36:25,556 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 04:36:25,556 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 04:36:25,557 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 04:36:25,557 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 04:36:25,557 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 04:36:25,557 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 04:36:25,558 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 04:36:25,558 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 04:36:25,558 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 04:36:25,559 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 04:36:25,559 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 04:36:25,559 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 04:36:25,559 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 04:36:25,559 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 04:36:25,559 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 04:36:25,559 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-10 04:36:25,560 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-10 04:36:25,560 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 04:36:25,560 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 04:36:25,560 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-10 04:36:25,560 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 04:36:25,560 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 04:36:25,560 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 04:36:25,560 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-10 04:36:25,561 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 04:36:25,561 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 04:36:25,561 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_5de48303-7f94-4d7d-b237-5258f7a9eae2/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 -> 9f300f737133e82ccd4d7d6f0d6ac5569b27b6d9 [2018-11-10 04:36:25,589 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 04:36:25,600 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 04:36:25,603 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 04:36:25,605 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 04:36:25,605 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 04:36:25,606 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5de48303-7f94-4d7d-b237-5258f7a9eae2/bin-2019/ukojak/../../sv-benchmarks/c/eca-rers2012/Problem02_label13_false-unreach-call_false-termination.c [2018-11-10 04:36:25,655 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5de48303-7f94-4d7d-b237-5258f7a9eae2/bin-2019/ukojak/data/ab992b251/f212a86fef07454f83ac9c56a94a7009/FLAG7cd2c013b [2018-11-10 04:36:26,087 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 04:36:26,087 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5de48303-7f94-4d7d-b237-5258f7a9eae2/sv-benchmarks/c/eca-rers2012/Problem02_label13_false-unreach-call_false-termination.c [2018-11-10 04:36:26,098 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5de48303-7f94-4d7d-b237-5258f7a9eae2/bin-2019/ukojak/data/ab992b251/f212a86fef07454f83ac9c56a94a7009/FLAG7cd2c013b [2018-11-10 04:36:26,112 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5de48303-7f94-4d7d-b237-5258f7a9eae2/bin-2019/ukojak/data/ab992b251/f212a86fef07454f83ac9c56a94a7009 [2018-11-10 04:36:26,115 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 04:36:26,117 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 04:36:26,118 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 04:36:26,118 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 04:36:26,121 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 04:36:26,122 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:36:26" (1/1) ... [2018-11-10 04:36:26,125 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27bb5729 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:36:26, skipping insertion in model container [2018-11-10 04:36:26,125 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:36:26" (1/1) ... [2018-11-10 04:36:26,135 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 04:36:26,178 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 04:36:26,424 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 04:36:26,428 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 04:36:26,498 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 04:36:26,511 INFO L193 MainTranslator]: Completed translation [2018-11-10 04:36:26,512 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:36:26 WrapperNode [2018-11-10 04:36:26,512 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 04:36:26,513 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 04:36:26,513 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 04:36:26,513 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 04:36:26,520 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:36:26" (1/1) ... [2018-11-10 04:36:26,586 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:36:26" (1/1) ... [2018-11-10 04:36:26,621 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 04:36:26,622 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 04:36:26,622 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 04:36:26,622 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 04:36:26,629 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:36:26" (1/1) ... [2018-11-10 04:36:26,630 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:36:26" (1/1) ... [2018-11-10 04:36:26,633 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:36:26" (1/1) ... [2018-11-10 04:36:26,634 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:36:26" (1/1) ... [2018-11-10 04:36:26,650 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:36:26" (1/1) ... [2018-11-10 04:36:26,659 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:36:26" (1/1) ... [2018-11-10 04:36:26,664 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:36:26" (1/1) ... [2018-11-10 04:36:26,670 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 04:36:26,671 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 04:36:26,671 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 04:36:26,671 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 04:36:26,672 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:36:26" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5de48303-7f94-4d7d-b237-5258f7a9eae2/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 04:36:26,722 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-10 04:36:26,722 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 04:36:26,722 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 04:36:28,273 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 04:36:28,274 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:36:28 BoogieIcfgContainer [2018-11-10 04:36:28,274 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 04:36:28,274 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-10 04:36:28,275 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-10 04:36:28,282 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-10 04:36:28,282 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:36:28" (1/1) ... [2018-11-10 04:36:28,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:36:28,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:36:28,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 86 states and 164 transitions. [2018-11-10 04:36:28,321 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 164 transitions. [2018-11-10 04:36:28,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-10 04:36:28,324 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:36:28,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:36:28,596 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 04:36:29,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:36:29,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 165 states and 253 transitions. [2018-11-10 04:36:29,185 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 253 transitions. [2018-11-10 04:36:29,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-10 04:36:29,188 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:36:29,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:36:29,321 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 04:36:29,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:36:29,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 244 states and 344 transitions. [2018-11-10 04:36:29,778 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 344 transitions. [2018-11-10 04:36:29,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-10 04:36:29,781 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:36:29,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:36:29,856 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 04:36:30,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:36:30,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 249 states and 351 transitions. [2018-11-10 04:36:30,034 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 351 transitions. [2018-11-10 04:36:30,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-10 04:36:30,037 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:36:30,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:36:30,093 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:36:30,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:36:30,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 259 states and 363 transitions. [2018-11-10 04:36:30,167 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 363 transitions. [2018-11-10 04:36:30,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-10 04:36:30,170 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:36:30,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:36:30,196 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:36:30,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:36:30,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 264 states and 368 transitions. [2018-11-10 04:36:30,235 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 368 transitions. [2018-11-10 04:36:30,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-10 04:36:30,236 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:36:30,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:36:30,262 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 04:36:30,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:36:30,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 275 states and 383 transitions. [2018-11-10 04:36:30,445 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 383 transitions. [2018-11-10 04:36:30,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-10 04:36:30,449 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:36:30,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:36:30,484 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 04:36:30,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:36:30,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 278 states and 386 transitions. [2018-11-10 04:36:30,528 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 386 transitions. [2018-11-10 04:36:30,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-10 04:36:30,529 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:36:30,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:36:30,560 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 04:36:30,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:36:30,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 279 states and 387 transitions. [2018-11-10 04:36:30,596 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 387 transitions. [2018-11-10 04:36:30,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-10 04:36:30,597 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:36:30,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:36:30,629 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 04:36:30,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:36:30,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 284 states and 393 transitions. [2018-11-10 04:36:30,718 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 393 transitions. [2018-11-10 04:36:30,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-10 04:36:30,719 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:36:30,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:36:30,745 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 04:36:30,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:36:30,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 285 states and 394 transitions. [2018-11-10 04:36:30,760 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 394 transitions. [2018-11-10 04:36:30,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-10 04:36:30,761 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:36:30,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:36:30,787 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 04:36:30,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:36:30,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 292 states and 401 transitions. [2018-11-10 04:36:30,836 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 401 transitions. [2018-11-10 04:36:30,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-10 04:36:30,837 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:36:30,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:36:30,861 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 04:36:30,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:36:30,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 299 states and 408 transitions. [2018-11-10 04:36:30,908 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 408 transitions. [2018-11-10 04:36:30,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-10 04:36:30,909 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:36:30,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:36:30,936 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 04:36:30,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:36:30,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 305 states and 414 transitions. [2018-11-10 04:36:30,974 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 414 transitions. [2018-11-10 04:36:30,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-11-10 04:36:30,974 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:36:30,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:36:31,037 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:36:31,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:36:31,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 325 states and 436 transitions. [2018-11-10 04:36:31,288 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 436 transitions. [2018-11-10 04:36:31,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-11-10 04:36:31,289 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:36:31,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:36:31,351 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-10 04:36:31,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:36:31,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 344 states and 458 transitions. [2018-11-10 04:36:31,524 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 458 transitions. [2018-11-10 04:36:31,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-11-10 04:36:31,525 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:36:31,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:36:31,568 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 04:36:32,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:36:32,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 424 states and 545 transitions. [2018-11-10 04:36:32,136 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 545 transitions. [2018-11-10 04:36:32,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-10 04:36:32,137 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:36:32,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:36:32,330 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 42 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:36:33,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:36:33,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 458 states and 587 transitions. [2018-11-10 04:36:33,268 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 587 transitions. [2018-11-10 04:36:33,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-10 04:36:33,269 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:36:33,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:36:33,354 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 04:36:33,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:36:33,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 471 states and 603 transitions. [2018-11-10 04:36:33,608 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 603 transitions. [2018-11-10 04:36:33,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-10 04:36:33,609 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:36:33,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:36:33,661 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-10 04:36:34,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:36:34,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 558 states and 694 transitions. [2018-11-10 04:36:34,340 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 694 transitions. [2018-11-10 04:36:34,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-10 04:36:34,341 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:36:34,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:36:34,366 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 04:36:34,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:36:34,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 569 states and 708 transitions. [2018-11-10 04:36:34,556 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 708 transitions. [2018-11-10 04:36:34,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-10 04:36:34,557 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:36:34,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:36:34,608 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:36:35,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:36:35,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 590 states and 734 transitions. [2018-11-10 04:36:35,023 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 734 transitions. [2018-11-10 04:36:35,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-10 04:36:35,024 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:36:35,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:36:35,047 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-10 04:36:35,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:36:35,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 601 states and 749 transitions. [2018-11-10 04:36:35,372 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 749 transitions. [2018-11-10 04:36:35,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-10 04:36:35,373 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:36:35,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:36:35,547 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 04:36:36,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:36:36,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 615 states and 769 transitions. [2018-11-10 04:36:36,014 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 769 transitions. [2018-11-10 04:36:36,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-11-10 04:36:36,015 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:36:36,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:36:36,034 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 04:36:36,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:36:36,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 624 states and 778 transitions. [2018-11-10 04:36:36,151 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 778 transitions. [2018-11-10 04:36:36,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-11-10 04:36:36,151 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:36:36,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:36:36,171 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-10 04:36:36,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:36:36,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 657 states and 818 transitions. [2018-11-10 04:36:36,904 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 818 transitions. [2018-11-10 04:36:36,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-11-10 04:36:36,905 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:36:36,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:36:36,968 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 04:36:37,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:36:37,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 664 states and 828 transitions. [2018-11-10 04:36:37,182 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 828 transitions. [2018-11-10 04:36:37,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-11-10 04:36:37,183 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:36:37,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:36:37,433 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 68 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-10 04:36:38,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:36:38,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 688 states and 860 transitions. [2018-11-10 04:36:38,565 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 860 transitions. [2018-11-10 04:36:38,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-11-10 04:36:38,566 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:36:38,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:36:38,597 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 68 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-10 04:36:39,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:36:39,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 701 states and 874 transitions. [2018-11-10 04:36:39,166 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 874 transitions. [2018-11-10 04:36:39,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-11-10 04:36:39,167 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:36:39,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:36:39,214 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 68 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-10 04:36:39,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:36:39,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 709 states and 885 transitions. [2018-11-10 04:36:39,702 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 885 transitions. [2018-11-10 04:36:39,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-11-10 04:36:39,703 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:36:39,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:36:39,737 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-10 04:36:39,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:36:39,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 711 states and 887 transitions. [2018-11-10 04:36:39,760 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 887 transitions. [2018-11-10 04:36:39,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-11-10 04:36:39,761 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:36:39,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:36:39,810 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:36:40,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:36:40,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 716 states and 894 transitions. [2018-11-10 04:36:40,091 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 894 transitions. [2018-11-10 04:36:40,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-10 04:36:40,092 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:36:40,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:36:40,121 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-10 04:36:40,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:36:40,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 729 states and 907 transitions. [2018-11-10 04:36:40,175 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 907 transitions. [2018-11-10 04:36:40,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-11-10 04:36:40,176 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:36:40,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:36:40,247 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 04:36:40,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:36:40,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 747 states and 927 transitions. [2018-11-10 04:36:40,740 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 927 transitions. [2018-11-10 04:36:40,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-11-10 04:36:40,741 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:36:40,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:36:40,832 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-10 04:36:41,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:36:41,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 771 states and 955 transitions. [2018-11-10 04:36:41,303 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 955 transitions. [2018-11-10 04:36:41,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-11-10 04:36:41,303 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:36:41,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:36:41,328 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 04:36:42,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:36:42,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 791 states and 981 transitions. [2018-11-10 04:36:42,054 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 981 transitions. [2018-11-10 04:36:42,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-11-10 04:36:42,055 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:36:42,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:36:42,083 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-10 04:36:42,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:36:42,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 813 states and 1008 transitions. [2018-11-10 04:36:42,568 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1008 transitions. [2018-11-10 04:36:42,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-11-10 04:36:42,568 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:36:42,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:36:42,600 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-11-10 04:36:42,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:36:42,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 819 states and 1014 transitions. [2018-11-10 04:36:42,714 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1014 transitions. [2018-11-10 04:36:42,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-11-10 04:36:42,715 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:36:42,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:36:42,738 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-10 04:36:43,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:36:43,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1050 states to 852 states and 1050 transitions. [2018-11-10 04:36:43,225 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1050 transitions. [2018-11-10 04:36:43,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-11-10 04:36:43,225 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:36:43,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:36:43,245 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-10 04:36:44,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:36:44,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1097 states to 886 states and 1097 transitions. [2018-11-10 04:36:44,132 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1097 transitions. [2018-11-10 04:36:44,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-11-10 04:36:44,133 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:36:44,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:36:44,163 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-10 04:36:44,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:36:44,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1106 states to 891 states and 1106 transitions. [2018-11-10 04:36:44,600 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 1106 transitions. [2018-11-10 04:36:44,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-11-10 04:36:44,601 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:36:44,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:36:44,634 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-10 04:36:44,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:36:44,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 895 states and 1110 transitions. [2018-11-10 04:36:44,672 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1110 transitions. [2018-11-10 04:36:44,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-11-10 04:36:44,672 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:36:44,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:36:44,702 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-10 04:36:44,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:36:44,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1114 states to 899 states and 1114 transitions. [2018-11-10 04:36:44,936 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1114 transitions. [2018-11-10 04:36:44,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-11-10 04:36:44,938 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:36:44,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:36:44,961 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-10 04:36:45,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:36:45,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 906 states and 1121 transitions. [2018-11-10 04:36:45,242 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1121 transitions. [2018-11-10 04:36:45,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-11-10 04:36:45,243 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:36:45,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:36:45,263 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-10 04:36:45,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:36:45,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 908 states and 1122 transitions. [2018-11-10 04:36:45,371 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1122 transitions. [2018-11-10 04:36:45,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-11-10 04:36:45,371 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:36:45,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:36:45,402 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 04:36:46,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:36:46,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1136 states to 917 states and 1136 transitions. [2018-11-10 04:36:46,098 INFO L276 IsEmpty]: Start isEmpty. Operand 917 states and 1136 transitions. [2018-11-10 04:36:46,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-11-10 04:36:46,099 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:36:46,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:36:46,131 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 04:36:46,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:36:46,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1144 states to 925 states and 1144 transitions. [2018-11-10 04:36:46,348 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1144 transitions. [2018-11-10 04:36:46,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-11-10 04:36:46,349 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:36:46,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:36:46,373 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 81 proven. 1 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-10 04:36:47,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:36:47,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1178 states to 950 states and 1178 transitions. [2018-11-10 04:36:47,114 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1178 transitions. [2018-11-10 04:36:47,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-11-10 04:36:47,116 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:36:47,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:36:47,138 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 81 proven. 1 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-10 04:36:48,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:36:48,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1208 states to 969 states and 1208 transitions. [2018-11-10 04:36:48,206 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1208 transitions. [2018-11-10 04:36:48,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-11-10 04:36:48,207 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:36:48,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:36:48,235 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 81 proven. 1 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-10 04:36:48,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:36:48,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 977 states and 1217 transitions. [2018-11-10 04:36:48,507 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1217 transitions. [2018-11-10 04:36:48,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-11-10 04:36:48,508 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:36:48,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:36:48,546 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 04:36:48,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:36:48,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1224 states to 984 states and 1224 transitions. [2018-11-10 04:36:48,675 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1224 transitions. [2018-11-10 04:36:48,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-11-10 04:36:48,677 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:36:48,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:36:48,712 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-11-10 04:36:49,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:36:49,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 1008 states and 1255 transitions. [2018-11-10 04:36:49,871 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1255 transitions. [2018-11-10 04:36:49,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-11-10 04:36:49,872 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:36:49,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:36:49,898 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-11-10 04:36:50,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:36:50,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1264 states to 1016 states and 1264 transitions. [2018-11-10 04:36:50,235 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states and 1264 transitions. [2018-11-10 04:36:50,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-11-10 04:36:50,236 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:36:50,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:36:50,262 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-11-10 04:36:50,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:36:50,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1271 states to 1021 states and 1271 transitions. [2018-11-10 04:36:50,553 INFO L276 IsEmpty]: Start isEmpty. Operand 1021 states and 1271 transitions. [2018-11-10 04:36:50,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-11-10 04:36:50,553 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:36:50,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:36:50,575 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-11-10 04:36:50,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:36:50,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1280 states to 1029 states and 1280 transitions. [2018-11-10 04:36:50,870 INFO L276 IsEmpty]: Start isEmpty. Operand 1029 states and 1280 transitions. [2018-11-10 04:36:50,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-11-10 04:36:50,871 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:36:50,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:36:50,893 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-10 04:36:51,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:36:51,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1035 states and 1289 transitions. [2018-11-10 04:36:51,563 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1289 transitions. [2018-11-10 04:36:51,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-11-10 04:36:51,564 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:36:51,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:36:51,593 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-10 04:36:53,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:36:53,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1088 states and 1352 transitions. [2018-11-10 04:36:53,460 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1352 transitions. [2018-11-10 04:36:53,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-11-10 04:36:53,461 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:36:53,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:36:53,496 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-10 04:36:54,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:36:54,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1104 states and 1369 transitions. [2018-11-10 04:36:54,174 INFO L276 IsEmpty]: Start isEmpty. Operand 1104 states and 1369 transitions. [2018-11-10 04:36:54,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-11-10 04:36:54,175 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:36:54,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:36:54,301 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-10 04:36:55,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:36:55,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1405 states to 1129 states and 1405 transitions. [2018-11-10 04:36:55,286 INFO L276 IsEmpty]: Start isEmpty. Operand 1129 states and 1405 transitions. [2018-11-10 04:36:55,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-11-10 04:36:55,287 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:36:55,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:36:55,319 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 04:36:55,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:36:55,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1412 states to 1137 states and 1412 transitions. [2018-11-10 04:36:55,735 INFO L276 IsEmpty]: Start isEmpty. Operand 1137 states and 1412 transitions. [2018-11-10 04:36:55,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-11-10 04:36:55,736 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:36:55,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:36:55,772 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-10 04:36:55,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:36:55,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1421 states to 1146 states and 1421 transitions. [2018-11-10 04:36:55,821 INFO L276 IsEmpty]: Start isEmpty. Operand 1146 states and 1421 transitions. [2018-11-10 04:36:55,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-11-10 04:36:55,822 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:36:55,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:36:55,861 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-10 04:36:56,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:36:56,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1436 states to 1162 states and 1436 transitions. [2018-11-10 04:36:56,481 INFO L276 IsEmpty]: Start isEmpty. Operand 1162 states and 1436 transitions. [2018-11-10 04:36:56,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-11-10 04:36:56,482 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:36:56,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:36:56,506 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-10 04:36:56,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:36:56,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1439 states to 1164 states and 1439 transitions. [2018-11-10 04:36:56,721 INFO L276 IsEmpty]: Start isEmpty. Operand 1164 states and 1439 transitions. [2018-11-10 04:36:56,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-11-10 04:36:56,721 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:36:56,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:36:57,129 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:37:00,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:37:00,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1519 states to 1233 states and 1519 transitions. [2018-11-10 04:37:00,817 INFO L276 IsEmpty]: Start isEmpty. Operand 1233 states and 1519 transitions. [2018-11-10 04:37:00,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-11-10 04:37:00,818 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:37:00,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:37:01,136 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:37:03,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:37:03,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1561 states to 1269 states and 1561 transitions. [2018-11-10 04:37:03,644 INFO L276 IsEmpty]: Start isEmpty. Operand 1269 states and 1561 transitions. [2018-11-10 04:37:03,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-11-10 04:37:03,645 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:37:03,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:37:03,687 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:37:04,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:37:04,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1286 states and 1583 transitions. [2018-11-10 04:37:04,685 INFO L276 IsEmpty]: Start isEmpty. Operand 1286 states and 1583 transitions. [2018-11-10 04:37:04,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-11-10 04:37:04,686 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:37:04,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:37:04,756 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-10 04:37:05,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:37:05,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1606 states to 1306 states and 1606 transitions. [2018-11-10 04:37:05,846 INFO L276 IsEmpty]: Start isEmpty. Operand 1306 states and 1606 transitions. [2018-11-10 04:37:05,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-11-10 04:37:05,847 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:37:05,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:37:05,886 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-11-10 04:37:06,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:37:06,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1613 states to 1309 states and 1613 transitions. [2018-11-10 04:37:06,023 INFO L276 IsEmpty]: Start isEmpty. Operand 1309 states and 1613 transitions. [2018-11-10 04:37:06,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-11-10 04:37:06,023 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:37:06,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:37:06,047 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:37:06,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:37:06,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1624 states to 1318 states and 1624 transitions. [2018-11-10 04:37:06,182 INFO L276 IsEmpty]: Start isEmpty. Operand 1318 states and 1624 transitions. [2018-11-10 04:37:06,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-11-10 04:37:06,183 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:37:06,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:37:06,214 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:37:06,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:37:06,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1631 states to 1326 states and 1631 transitions. [2018-11-10 04:37:06,500 INFO L276 IsEmpty]: Start isEmpty. Operand 1326 states and 1631 transitions. [2018-11-10 04:37:06,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-11-10 04:37:06,501 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:37:06,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:37:07,154 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-10 04:37:10,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:37:10,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1668 states to 1362 states and 1668 transitions. [2018-11-10 04:37:10,297 INFO L276 IsEmpty]: Start isEmpty. Operand 1362 states and 1668 transitions. [2018-11-10 04:37:10,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-11-10 04:37:10,298 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:37:10,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:37:10,879 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 04:37:14,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:37:14,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1737 states to 1431 states and 1737 transitions. [2018-11-10 04:37:14,590 INFO L276 IsEmpty]: Start isEmpty. Operand 1431 states and 1737 transitions. [2018-11-10 04:37:14,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-11-10 04:37:14,591 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:37:14,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:37:14,692 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 04:37:18,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:37:18,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1769 states to 1464 states and 1769 transitions. [2018-11-10 04:37:18,022 INFO L276 IsEmpty]: Start isEmpty. Operand 1464 states and 1769 transitions. [2018-11-10 04:37:18,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-11-10 04:37:18,023 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:37:18,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:37:18,047 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 121 proven. 1 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-11-10 04:37:18,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:37:18,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1789 states to 1483 states and 1789 transitions. [2018-11-10 04:37:18,335 INFO L276 IsEmpty]: Start isEmpty. Operand 1483 states and 1789 transitions. [2018-11-10 04:37:18,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-11-10 04:37:18,336 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:37:18,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:37:18,374 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 04:37:19,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:37:19,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1814 states to 1505 states and 1814 transitions. [2018-11-10 04:37:19,270 INFO L276 IsEmpty]: Start isEmpty. Operand 1505 states and 1814 transitions. [2018-11-10 04:37:19,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-11-10 04:37:19,271 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:37:19,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:37:19,330 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 04:37:19,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:37:19,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1817 states to 1509 states and 1817 transitions. [2018-11-10 04:37:19,503 INFO L276 IsEmpty]: Start isEmpty. Operand 1509 states and 1817 transitions. [2018-11-10 04:37:19,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-11-10 04:37:19,505 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:37:19,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:37:19,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:37:19,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:37:19,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:37:19,730 WARN L496 CodeCheckObserver]: This program is UNSAFE, Check terminated with 76 iterations. [2018-11-10 04:37:19,875 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 10.11 04:37:19 ImpRootNode [2018-11-10 04:37:19,875 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-10 04:37:19,876 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 04:37:19,876 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 04:37:19,876 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 04:37:19,877 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:36:28" (3/4) ... [2018-11-10 04:37:19,881 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-10 04:37:20,006 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_5de48303-7f94-4d7d-b237-5258f7a9eae2/bin-2019/ukojak/witness.graphml [2018-11-10 04:37:20,006 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 04:37:20,007 INFO L168 Benchmark]: Toolchain (without parser) took 53891.05 ms. Allocated memory was 1.0 GB in the beginning and 2.3 GB in the end (delta: 1.3 GB). Free memory was 957.5 MB in the beginning and 1.3 GB in the end (delta: -367.6 MB). Peak memory consumption was 902.7 MB. Max. memory is 11.5 GB. [2018-11-10 04:37:20,008 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 982.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 04:37:20,008 INFO L168 Benchmark]: CACSL2BoogieTranslator took 394.86 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 925.3 MB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. [2018-11-10 04:37:20,009 INFO L168 Benchmark]: Boogie Procedure Inliner took 108.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 925.3 MB in the beginning and 1.1 GB in the end (delta: -208.3 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2018-11-10 04:37:20,009 INFO L168 Benchmark]: Boogie Preprocessor took 48.96 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: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-11-10 04:37:20,009 INFO L168 Benchmark]: RCFGBuilder took 1603.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 879.7 MB in the end (delta: 247.1 MB). Peak memory consumption was 247.1 MB. Max. memory is 11.5 GB. [2018-11-10 04:37:20,009 INFO L168 Benchmark]: CodeCheck took 51600.71 ms. Allocated memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: 1.1 GB). Free memory was 879.7 MB in the beginning and 1.4 GB in the end (delta: -473.5 MB). Peak memory consumption was 649.0 MB. Max. memory is 11.5 GB. [2018-11-10 04:37:20,010 INFO L168 Benchmark]: Witness Printer took 130.31 ms. Allocated memory is still 2.3 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 28.0 MB). Peak memory consumption was 28.0 MB. Max. memory is 11.5 GB. [2018-11-10 04:37:20,012 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, 51.4s OverallTime, 76 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: -1607968256 SDtfs, -800359912 SDslu, -1589446656 SDs, 0 SdLazy, -1650108358 SolverSat, 1620764814 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 182.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 69269 GetRequests, 67958 SyntacticMatches, 539 SemanticMatches, 772 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 395578 ImplicationChecksByTransitivity, 42.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 10464 NumberOfCodeBlocks, 10464 NumberOfCodeBlocksAsserted, 76 NumberOfCheckSat, 10208 ConstructedInterpolants, 0 QuantifiedInterpolants, 3830128 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 75 InterpolantComputations, 66 PerfectInterpolantSequences, 6048/6088 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: 430]: 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 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=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=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] [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=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=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] [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=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=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] [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=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=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] [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=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=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] [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=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=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] [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=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=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] [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=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=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] [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=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=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] [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=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=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] [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=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=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] [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=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=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] [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=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=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] [L165] COND FALSE !((((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) 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] [L169] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) 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] [L175] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) 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] [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=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] [L185] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) 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] [L187] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) 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] [L189] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) 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] [L191] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) 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] [L194] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) 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] [L198] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) 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] [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=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] [L212] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) 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] [L215] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) 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] [L218] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) 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] [L223] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) 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] [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=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] [L232] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) 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] [L234] COND FALSE !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1)))) 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] [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=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] [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=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] [L253] COND FALSE !((((a17==9)&&(((((input==1)&&((a25==1)||!(a25==1)))&&(a11==1))&&(a21==1))&&(a19==1)))&&(a28==9))) 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] [L259] COND FALSE !((!(a11==1)&&((a19==1)&&(((((a28==9)&&(input==6))&&(a21==1))&&(a17==8))&&!(a25==1))))) 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] [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=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] [L276] COND FALSE !(((a28==7)&&((a17==8)&&(!(a25==1)&&((a21==1)&&((a19==1)&&((input==5)&&!(a11==1)))))))) 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] [L280] COND FALSE !(((a28==8)&&((a21==1)&&((!(a11==1)&&(((input==1)&&(a17==8))&&(a19==1)))&&(a25==1))))) 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] [L283] COND FALSE !((((((a17==8)&&(((input==6)&&((a25==1)||!(a25==1)))&&(a21==1)))&&(a28==10))&&!(a11==1))&&(a19==1))) 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] [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=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] [L291] COND FALSE !(((a17==8)&&(((a21==1)&&(!(a11==1)&&((a25==1)&&((a28==8)&&(input==6)))))&&(a19==1)))) 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] [L293] COND FALSE !((((a19==1)&&((a17==8)&&(((!(a25==1)&&(input==5))&&(a21==1))&&!(a11==1))))&&(a28==11))) 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] [L297] COND FALSE !(((a11==1)&&(((a17==9)&&((a28==9)&&((a19==1)&&(((a25==1)||!(a25==1))&&(input==5)))))&&(a21==1)))) 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] [L309] COND FALSE !((((((((input==3)&&(a19==1))&&(a21==1))&&(a17==8))&&!(a25==1))&&(a28==11))&&!(a11==1))) 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] [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=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] [L328] COND FALSE !((((a19==1)&&(((!(a11==1)&&(((a25==1)||!(a25==1))&&(input==3)))&&(a28==10))&&(a21==1)))&&(a17==8))) 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] [L331] COND FALSE !(((!(a11==1)&&(((((input==4)&&(a17==8))&&!(a25==1))&&(a21==1))&&(a28==11)))&&(a19==1))) 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] [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=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] [L349] COND FALSE !((!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1)))) 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] [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=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] [L361] COND FALSE !(((a19==1)&&((((a21==1)&&((!(a25==1)&&(input==3))&&(a17==9)))&&(a28==8))&&(a11==1)))) 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] [L368] COND TRUE ((a17==8)&&(((a21==1)&&(((input==5)&&((!(a25==1)&&(a28==8))||((a28==9)&&(a25==1))))&&(a19==1)))&&!(a11==1))) [L369] a11 = 1 [L370] a19 = 0 [L371] a25 = 1 [L372] a17 = 7 [L373] a28 = 9 [L374] RET return -1; VAL [a=1, a11=1, a17=7, a19=0, 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=7, a19=0, 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=7, a19=0, 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=7, a19=0, 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=7, a19=0, 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=7, a19=0, 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=7, a19=0, 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=7, a19=0, 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=7, a19=0, 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=7, a19=0, 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=7, a19=0, 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=7, a19=0, 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=7, a19=0, 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=7, a19=0, 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=7, a19=0, 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=7, a19=0, 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=7, a19=0, 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=7, a19=0, 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=7, a19=0, 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=7, a19=0, 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=7, a19=0, 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=7, a19=0, 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=7, a19=0, 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=7, a19=0, 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=7, a19=0, 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=7, a19=0, 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=7, a19=0, 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=7, a19=0, 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=7, a19=0, 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=7, a19=0, 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=7, a19=0, 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=7, a19=0, 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=7, a19=0, 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=7, a19=0, 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=7, a19=0, 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=7, a19=0, 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=7, a19=0, 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=7, a19=0, 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=7, a19=0, 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=7, a19=0, 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=7, a19=0, 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=7, a19=0, 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=7, a19=0, 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=7, a19=0, 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=7, a19=0, 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=7, a19=0, 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=7, a19=0, 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=7, a19=0, 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=7, a19=0, 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=7, a19=0, 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=7, a19=0, 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=7, a19=0, 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=7, a19=0, 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=7, a19=0, 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=7, a19=0, 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=7, a19=0, 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=7, a19=0, 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=7, a19=0, 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=7, a19=0, 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=7, a19=0, 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=7, a19=0, 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=7, a19=0, 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=7, a19=0, 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=7, a19=0, 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=7, a19=0, 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=7, a19=0, 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=7, a19=0, 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=7, a19=0, 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=7, a19=0, 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=7, a19=0, 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=7, a19=0, 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=7, a19=0, 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=7, a19=0, 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=7, a19=0, 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=7, a19=0, 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))) [L426] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==9))&&(a19==1))&&(a21==1))&&(a17==8))) VAL [a=1, a11=1, a17=7, a19=0, 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] [L429] COND TRUE ((((((a25==1)&&(a11==1))&&(a28==9))&&!(a19==1))&&(a21==1))&&(a17==7)) VAL [a=1, a11=1, a17=7, a19=0, 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] [L430] __VERIFIER_error() VAL [a=1, a11=1, a17=7, a19=0, 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 982.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 394.86 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 925.3 MB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 108.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 925.3 MB in the beginning and 1.1 GB in the end (delta: -208.3 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 48.96 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: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1603.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 879.7 MB in the end (delta: 247.1 MB). Peak memory consumption was 247.1 MB. Max. memory is 11.5 GB. * CodeCheck took 51600.71 ms. Allocated memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: 1.1 GB). Free memory was 879.7 MB in the beginning and 1.4 GB in the end (delta: -473.5 MB). Peak memory consumption was 649.0 MB. Max. memory is 11.5 GB. * Witness Printer took 130.31 ms. Allocated memory is still 2.3 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 28.0 MB). Peak memory consumption was 28.0 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...