./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label13.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_b08a5c49-48f8-415b-b606-4def6990e483/bin/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_b08a5c49-48f8-415b-b606-4def6990e483/bin/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_b08a5c49-48f8-415b-b606-4def6990e483/bin/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_b08a5c49-48f8-415b-b606-4def6990e483/bin/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label13.c -s /tmp/vcloud-vcloud-master/worker/run_dir_b08a5c49-48f8-415b-b606-4def6990e483/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_b08a5c49-48f8-415b-b606-4def6990e483/bin/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.24-678e011 [2019-11-20 01:26:03,237 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 01:26:03,239 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 01:26:03,251 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 01:26:03,254 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 01:26:03,255 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 01:26:03,258 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 01:26:03,268 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 01:26:03,274 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 01:26:03,277 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 01:26:03,279 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 01:26:03,280 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 01:26:03,281 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 01:26:03,284 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 01:26:03,285 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 01:26:03,286 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 01:26:03,287 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 01:26:03,290 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 01:26:03,292 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 01:26:03,296 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 01:26:03,301 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 01:26:03,303 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 01:26:03,306 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 01:26:03,307 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 01:26:03,310 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 01:26:03,311 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 01:26:03,311 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 01:26:03,313 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 01:26:03,313 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 01:26:03,314 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 01:26:03,315 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 01:26:03,315 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 01:26:03,316 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 01:26:03,317 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 01:26:03,318 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 01:26:03,319 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 01:26:03,319 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 01:26:03,320 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 01:26:03,320 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 01:26:03,321 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 01:26:03,322 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 01:26:03,323 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_b08a5c49-48f8-415b-b606-4def6990e483/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2019-11-20 01:26:03,353 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 01:26:03,364 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 01:26:03,365 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-20 01:26:03,365 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2019-11-20 01:26:03,366 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 01:26:03,366 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 01:26:03,366 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 01:26:03,367 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 01:26:03,367 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 01:26:03,367 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 01:26:03,367 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 01:26:03,368 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 01:26:03,368 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 01:26:03,368 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 01:26:03,368 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 01:26:03,369 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 01:26:03,369 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 01:26:03,369 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 01:26:03,369 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2019-11-20 01:26:03,370 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2019-11-20 01:26:03,370 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 01:26:03,370 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 01:26:03,370 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2019-11-20 01:26:03,371 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 01:26:03,371 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 01:26:03,371 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 01:26:03,372 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2019-11-20 01:26:03,372 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 01:26:03,372 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 01:26:03,372 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_b08a5c49-48f8-415b-b606-4def6990e483/bin/ukojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__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 [2019-11-20 01:26:03,534 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 01:26:03,549 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 01:26:03,552 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 01:26:03,554 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 01:26:03,554 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 01:26:03,555 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_b08a5c49-48f8-415b-b606-4def6990e483/bin/ukojak/../../sv-benchmarks/c/eca-rers2012/Problem02_label13.c [2019-11-20 01:26:03,612 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b08a5c49-48f8-415b-b606-4def6990e483/bin/ukojak/data/526cd483a/205a04e3e6034fc4b24cbfb472759724/FLAG1aa77158d [2019-11-20 01:26:04,176 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 01:26:04,176 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_b08a5c49-48f8-415b-b606-4def6990e483/sv-benchmarks/c/eca-rers2012/Problem02_label13.c [2019-11-20 01:26:04,190 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b08a5c49-48f8-415b-b606-4def6990e483/bin/ukojak/data/526cd483a/205a04e3e6034fc4b24cbfb472759724/FLAG1aa77158d [2019-11-20 01:26:04,448 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_b08a5c49-48f8-415b-b606-4def6990e483/bin/ukojak/data/526cd483a/205a04e3e6034fc4b24cbfb472759724 [2019-11-20 01:26:04,452 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 01:26:04,454 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 01:26:04,455 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 01:26:04,455 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 01:26:04,458 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 01:26:04,459 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 01:26:04" (1/1) ... [2019-11-20 01:26:04,463 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67e30aaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:26:04, skipping insertion in model container [2019-11-20 01:26:04,464 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 01:26:04" (1/1) ... [2019-11-20 01:26:04,472 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 01:26:04,535 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 01:26:04,986 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 01:26:04,991 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 01:26:05,112 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 01:26:05,142 INFO L192 MainTranslator]: Completed translation [2019-11-20 01:26:05,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:26:05 WrapperNode [2019-11-20 01:26:05,143 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 01:26:05,144 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 01:26:05,144 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 01:26:05,144 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 01:26:05,153 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:26:05" (1/1) ... [2019-11-20 01:26:05,173 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:26:05" (1/1) ... [2019-11-20 01:26:05,227 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 01:26:05,227 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 01:26:05,227 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 01:26:05,228 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 01:26:05,238 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:26:05" (1/1) ... [2019-11-20 01:26:05,238 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:26:05" (1/1) ... [2019-11-20 01:26:05,243 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:26:05" (1/1) ... [2019-11-20 01:26:05,244 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:26:05" (1/1) ... [2019-11-20 01:26:05,277 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:26:05" (1/1) ... [2019-11-20 01:26:05,287 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:26:05" (1/1) ... [2019-11-20 01:26:05,307 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:26:05" (1/1) ... [2019-11-20 01:26:05,311 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 01:26:05,312 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 01:26:05,312 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 01:26:05,313 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 01:26:05,314 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:26:05" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b08a5c49-48f8-415b-b606-4def6990e483/bin/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2019-11-20 01:26:05,389 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 01:26:05,389 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 01:26:07,889 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 01:26:07,891 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-20 01:26:07,893 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:26:07 BoogieIcfgContainer [2019-11-20 01:26:07,893 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 01:26:07,894 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2019-11-20 01:26:07,894 INFO L271 PluginConnector]: Initializing CodeCheck... [2019-11-20 01:26:07,905 INFO L275 PluginConnector]: CodeCheck initialized [2019-11-20 01:26:07,909 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:26:07" (1/1) ... [2019-11-20 01:26:07,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:26:07,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:26:07,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 85 states and 162 transitions. [2019-11-20 01:26:07,974 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 162 transitions. [2019-11-20 01:26:07,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-20 01:26:07,982 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:26:08,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:26:08,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:26:09,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:26:09,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 163 states and 251 transitions. [2019-11-20 01:26:09,235 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 251 transitions. [2019-11-20 01:26:09,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-20 01:26:09,239 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:26:09,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:26:09,450 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:26:10,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:26:10,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 241 states and 341 transitions. [2019-11-20 01:26:10,351 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 341 transitions. [2019-11-20 01:26:10,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-20 01:26:10,357 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:26:10,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:26:10,469 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:26:10,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:26:10,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 245 states and 347 transitions. [2019-11-20 01:26:10,776 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 347 transitions. [2019-11-20 01:26:10,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-20 01:26:10,784 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:26:10,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:26:10,849 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:26:10,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:26:10,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 254 states and 358 transitions. [2019-11-20 01:26:10,985 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 358 transitions. [2019-11-20 01:26:10,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-20 01:26:10,988 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:26:11,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:26:11,060 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-20 01:26:11,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:26:11,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 264 states and 372 transitions. [2019-11-20 01:26:11,336 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 372 transitions. [2019-11-20 01:26:11,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-20 01:26:11,341 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:26:11,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:26:11,381 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:26:11,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:26:11,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 269 states and 377 transitions. [2019-11-20 01:26:11,447 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 377 transitions. [2019-11-20 01:26:11,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-20 01:26:11,449 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:26:11,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:26:11,603 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:26:12,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:26:12,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 286 states and 401 transitions. [2019-11-20 01:26:12,626 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 401 transitions. [2019-11-20 01:26:12,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-20 01:26:12,628 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:26:12,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:26:12,755 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:26:13,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:26:13,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 300 states and 421 transitions. [2019-11-20 01:26:13,442 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 421 transitions. [2019-11-20 01:26:13,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-20 01:26:13,444 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:26:13,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:26:13,484 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 01:26:13,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:26:13,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 304 states and 426 transitions. [2019-11-20 01:26:13,677 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 426 transitions. [2019-11-20 01:26:13,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-20 01:26:13,678 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:26:13,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:26:13,712 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-20 01:26:13,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:26:13,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 309 states and 433 transitions. [2019-11-20 01:26:13,966 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 433 transitions. [2019-11-20 01:26:13,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-20 01:26:13,968 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:26:13,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:26:14,025 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 01:26:14,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:26:14,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 312 states and 436 transitions. [2019-11-20 01:26:14,135 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 436 transitions. [2019-11-20 01:26:14,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-20 01:26:14,136 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:26:14,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:26:14,180 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:26:14,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:26:14,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 319 states and 443 transitions. [2019-11-20 01:26:14,250 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 443 transitions. [2019-11-20 01:26:14,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-20 01:26:14,253 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:26:14,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:26:14,357 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:26:15,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:26:15,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 329 states and 461 transitions. [2019-11-20 01:26:15,093 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 461 transitions. [2019-11-20 01:26:15,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-20 01:26:15,095 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:26:15,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:26:15,151 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:26:15,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:26:15,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 334 states and 467 transitions. [2019-11-20 01:26:15,384 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 467 transitions. [2019-11-20 01:26:15,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-20 01:26:15,387 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:26:15,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:26:15,420 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 01:26:15,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:26:15,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 338 states and 470 transitions. [2019-11-20 01:26:15,747 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 470 transitions. [2019-11-20 01:26:15,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-20 01:26:15,750 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:26:15,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:26:15,793 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-20 01:26:15,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:26:15,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 345 states and 477 transitions. [2019-11-20 01:26:15,906 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 477 transitions. [2019-11-20 01:26:15,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-11-20 01:26:15,908 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:26:15,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:26:15,952 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:26:16,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:26:16,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 351 states and 483 transitions. [2019-11-20 01:26:16,016 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 483 transitions. [2019-11-20 01:26:16,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-11-20 01:26:16,019 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:26:16,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:26:16,093 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:26:17,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:26:17,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 367 states and 502 transitions. [2019-11-20 01:26:17,354 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 502 transitions. [2019-11-20 01:26:17,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-11-20 01:26:17,355 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:26:17,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:26:17,571 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-20 01:26:18,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:26:18,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 385 states and 523 transitions. [2019-11-20 01:26:18,323 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 523 transitions. [2019-11-20 01:26:18,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-11-20 01:26:18,325 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:26:18,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:26:18,425 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:26:19,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:26:19,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 464 states and 611 transitions. [2019-11-20 01:26:19,730 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 611 transitions. [2019-11-20 01:26:19,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-11-20 01:26:19,732 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:26:19,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:26:20,069 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 39 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:26:22,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:26:22,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 492 states and 645 transitions. [2019-11-20 01:26:22,832 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 645 transitions. [2019-11-20 01:26:22,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-11-20 01:26:22,833 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:26:22,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:26:22,868 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-20 01:26:23,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:26:23,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 503 states and 661 transitions. [2019-11-20 01:26:23,737 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 661 transitions. [2019-11-20 01:26:23,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-11-20 01:26:23,739 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:26:23,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:26:24,105 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:26:25,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:26:25,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 516 states and 678 transitions. [2019-11-20 01:26:25,309 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 678 transitions. [2019-11-20 01:26:25,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-11-20 01:26:25,312 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:26:25,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:26:25,388 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-20 01:26:27,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:26:27,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 601 states and 767 transitions. [2019-11-20 01:26:27,377 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 767 transitions. [2019-11-20 01:26:27,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-20 01:26:27,379 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:26:27,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:26:27,470 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 01:26:28,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:26:28,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 611 states and 783 transitions. [2019-11-20 01:26:28,101 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 783 transitions. [2019-11-20 01:26:28,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-11-20 01:26:28,103 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:26:28,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:26:28,141 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:26:29,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:26:29,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 626 states and 804 transitions. [2019-11-20 01:26:29,381 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 804 transitions. [2019-11-20 01:26:29,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-11-20 01:26:29,383 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:26:29,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:26:29,418 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-20 01:26:30,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:26:30,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 634 states and 814 transitions. [2019-11-20 01:26:30,199 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 814 transitions. [2019-11-20 01:26:30,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-20 01:26:30,201 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:26:30,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:26:30,501 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 01:26:31,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:26:31,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 647 states and 838 transitions. [2019-11-20 01:26:31,587 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 838 transitions. [2019-11-20 01:26:31,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-20 01:26:31,589 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:26:31,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:26:31,636 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-20 01:26:31,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:26:31,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 656 states and 847 transitions. [2019-11-20 01:26:31,902 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 847 transitions. [2019-11-20 01:26:31,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-11-20 01:26:31,904 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:26:31,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:26:31,969 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-20 01:26:33,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:26:33,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 674 states and 870 transitions. [2019-11-20 01:26:33,905 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 870 transitions. [2019-11-20 01:26:33,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-11-20 01:26:33,907 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:26:33,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:26:34,104 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 01:26:34,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:26:34,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 680 states and 879 transitions. [2019-11-20 01:26:34,766 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 879 transitions. [2019-11-20 01:26:34,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-11-20 01:26:34,768 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:26:34,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:26:35,316 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 63 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-20 01:26:37,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:26:37,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 699 states and 907 transitions. [2019-11-20 01:26:37,591 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 907 transitions. [2019-11-20 01:26:37,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-11-20 01:26:37,592 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:26:37,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:26:37,656 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 63 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-20 01:26:39,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:26:39,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 712 states and 923 transitions. [2019-11-20 01:26:39,058 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 923 transitions. [2019-11-20 01:26:39,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-11-20 01:26:39,059 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:26:39,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:26:39,128 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 63 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-20 01:26:40,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:26:40,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 725 states and 937 transitions. [2019-11-20 01:26:40,120 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 937 transitions. [2019-11-20 01:26:40,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-11-20 01:26:40,122 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:26:40,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:26:40,185 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-20 01:26:40,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:26:40,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 727 states and 945 transitions. [2019-11-20 01:26:40,825 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 945 transitions. [2019-11-20 01:26:40,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-11-20 01:26:40,827 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:26:40,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:26:40,871 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-20 01:26:41,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:26:41,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 728 states and 946 transitions. [2019-11-20 01:26:41,202 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 946 transitions. [2019-11-20 01:26:41,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-11-20 01:26:41,203 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:26:41,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:26:41,248 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-20 01:26:41,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:26:41,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 729 states and 947 transitions. [2019-11-20 01:26:41,548 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 947 transitions. [2019-11-20 01:26:41,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-11-20 01:26:41,549 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:26:41,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:26:41,595 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-20 01:26:42,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:26:42,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 732 states and 950 transitions. [2019-11-20 01:26:42,021 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 950 transitions. [2019-11-20 01:26:42,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-11-20 01:26:42,022 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:26:42,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:26:42,068 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-20 01:26:42,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:26:42,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 954 states to 735 states and 954 transitions. [2019-11-20 01:26:42,354 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 954 transitions. [2019-11-20 01:26:42,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-11-20 01:26:42,355 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:26:42,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:26:42,400 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-20 01:26:42,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:26:42,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 738 states and 957 transitions. [2019-11-20 01:26:42,736 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 957 transitions. [2019-11-20 01:26:42,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-11-20 01:26:42,737 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:26:42,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:26:42,795 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:26:43,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:26:43,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 742 states and 963 transitions. [2019-11-20 01:26:43,230 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 963 transitions. [2019-11-20 01:26:43,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-11-20 01:26:43,231 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:26:43,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:26:43,289 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-20 01:26:44,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:26:44,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 746 states and 966 transitions. [2019-11-20 01:26:44,153 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 966 transitions. [2019-11-20 01:26:44,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-11-20 01:26:44,154 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:26:44,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:26:44,290 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 01:26:46,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:26:46,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 764 states and 990 transitions. [2019-11-20 01:26:46,199 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 990 transitions. [2019-11-20 01:26:46,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-11-20 01:26:46,200 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:26:46,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:26:46,362 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 01:26:46,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:26:46,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 767 states and 994 transitions. [2019-11-20 01:26:46,757 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 994 transitions. [2019-11-20 01:26:46,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-11-20 01:26:46,758 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:26:46,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:26:46,884 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 01:26:47,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:26:47,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 771 states and 998 transitions. [2019-11-20 01:26:47,561 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 998 transitions. [2019-11-20 01:26:47,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-11-20 01:26:47,562 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:26:47,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:26:47,600 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-20 01:26:47,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:26:47,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 784 states and 1011 transitions. [2019-11-20 01:26:47,670 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1011 transitions. [2019-11-20 01:26:47,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-11-20 01:26:47,672 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:26:47,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:26:48,010 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-20 01:26:49,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:26:49,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1038 states to 808 states and 1038 transitions. [2019-11-20 01:26:49,040 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1038 transitions. [2019-11-20 01:26:49,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-11-20 01:26:49,041 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:26:49,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:26:49,147 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 01:26:51,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:26:51,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1065 states to 828 states and 1065 transitions. [2019-11-20 01:26:51,268 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1065 transitions. [2019-11-20 01:26:51,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-11-20 01:26:51,271 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:26:51,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:26:51,389 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 01:26:52,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:26:52,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1077 states to 838 states and 1077 transitions. [2019-11-20 01:26:52,399 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1077 transitions. [2019-11-20 01:26:52,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-11-20 01:26:52,401 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:26:52,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:26:52,444 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-20 01:26:53,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:26:53,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1104 states to 860 states and 1104 transitions. [2019-11-20 01:26:53,177 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 1104 transitions. [2019-11-20 01:26:53,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-11-20 01:26:53,179 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:26:53,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:26:53,250 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-11-20 01:26:53,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:26:53,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1107 states to 864 states and 1107 transitions. [2019-11-20 01:26:53,807 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 1107 transitions. [2019-11-20 01:26:53,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-11-20 01:26:53,808 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:26:53,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:26:53,846 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-11-20 01:26:54,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:26:54,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1113 states to 870 states and 1113 transitions. [2019-11-20 01:26:54,168 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1113 transitions. [2019-11-20 01:26:54,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-11-20 01:26:54,170 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:26:54,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:26:54,449 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-11-20 01:26:57,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:26:57,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 895 states and 1150 transitions. [2019-11-20 01:26:57,204 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1150 transitions. [2019-11-20 01:26:57,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-11-20 01:26:57,206 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:26:57,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:26:57,245 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-20 01:26:58,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:26:58,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1185 states to 928 states and 1185 transitions. [2019-11-20 01:26:58,043 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 1185 transitions. [2019-11-20 01:26:58,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-11-20 01:26:58,045 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:26:58,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:26:58,100 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-20 01:26:59,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:26:59,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193 states to 933 states and 1193 transitions. [2019-11-20 01:26:59,125 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1193 transitions. [2019-11-20 01:26:59,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-11-20 01:26:59,128 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:26:59,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:26:59,172 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-20 01:26:59,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:26:59,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1197 states to 937 states and 1197 transitions. [2019-11-20 01:26:59,231 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1197 transitions. [2019-11-20 01:26:59,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-11-20 01:26:59,233 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:26:59,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:26:59,278 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-20 01:27:00,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:27:00,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1208 states to 947 states and 1208 transitions. [2019-11-20 01:27:00,370 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1208 transitions. [2019-11-20 01:27:00,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-11-20 01:27:00,371 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:27:00,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:27:00,406 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-20 01:27:00,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:27:00,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1209 states to 949 states and 1209 transitions. [2019-11-20 01:27:00,732 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 1209 transitions. [2019-11-20 01:27:00,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-11-20 01:27:00,734 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:27:00,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:27:00,781 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-20 01:27:00,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:27:00,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1209 states to 950 states and 1209 transitions. [2019-11-20 01:27:00,808 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1209 transitions. [2019-11-20 01:27:00,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-11-20 01:27:00,810 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:27:00,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:27:01,057 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 75 proven. 8 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-20 01:27:02,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:27:02,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1238 states to 973 states and 1238 transitions. [2019-11-20 01:27:02,166 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 1238 transitions. [2019-11-20 01:27:02,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-11-20 01:27:02,168 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:27:02,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:27:02,349 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 75 proven. 8 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-20 01:27:04,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:27:04,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 991 states and 1272 transitions. [2019-11-20 01:27:04,114 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 1272 transitions. [2019-11-20 01:27:04,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-11-20 01:27:04,115 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:27:04,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:27:04,324 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 75 proven. 8 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-20 01:27:04,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:27:04,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1281 states to 995 states and 1281 transitions. [2019-11-20 01:27:04,791 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1281 transitions. [2019-11-20 01:27:04,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-11-20 01:27:04,792 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:27:04,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:27:04,842 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 01:27:06,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:27:06,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1296 states to 1003 states and 1296 transitions. [2019-11-20 01:27:06,181 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1296 transitions. [2019-11-20 01:27:06,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-11-20 01:27:06,184 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:27:06,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:27:06,233 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 01:27:07,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:27:07,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1315 states to 1017 states and 1315 transitions. [2019-11-20 01:27:07,525 INFO L276 IsEmpty]: Start isEmpty. Operand 1017 states and 1315 transitions. [2019-11-20 01:27:07,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-11-20 01:27:07,527 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:27:07,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:27:07,710 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 75 proven. 8 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-20 01:27:08,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:27:08,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1323 states to 1025 states and 1323 transitions. [2019-11-20 01:27:08,219 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 1323 transitions. [2019-11-20 01:27:08,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-11-20 01:27:08,221 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:27:08,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:27:08,267 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 01:27:08,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:27:08,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1325 states to 1027 states and 1325 transitions. [2019-11-20 01:27:08,508 INFO L276 IsEmpty]: Start isEmpty. Operand 1027 states and 1325 transitions. [2019-11-20 01:27:08,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-11-20 01:27:08,509 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:27:08,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:27:08,720 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 75 proven. 8 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-20 01:27:09,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:27:09,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1031 states and 1330 transitions. [2019-11-20 01:27:09,576 INFO L276 IsEmpty]: Start isEmpty. Operand 1031 states and 1330 transitions. [2019-11-20 01:27:09,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-11-20 01:27:09,578 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:27:09,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:27:09,623 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 01:27:10,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:27:10,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1336 states to 1036 states and 1336 transitions. [2019-11-20 01:27:10,008 INFO L276 IsEmpty]: Start isEmpty. Operand 1036 states and 1336 transitions. [2019-11-20 01:27:10,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-11-20 01:27:10,009 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:27:10,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:27:10,185 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 75 proven. 8 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-20 01:27:10,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:27:10,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1344 states to 1042 states and 1344 transitions. [2019-11-20 01:27:10,963 INFO L276 IsEmpty]: Start isEmpty. Operand 1042 states and 1344 transitions. [2019-11-20 01:27:10,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-11-20 01:27:10,965 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:27:10,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:27:11,180 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 75 proven. 8 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-20 01:27:11,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:27:11,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1346 states to 1045 states and 1346 transitions. [2019-11-20 01:27:11,499 INFO L276 IsEmpty]: Start isEmpty. Operand 1045 states and 1346 transitions. [2019-11-20 01:27:11,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-11-20 01:27:11,500 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:27:11,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:27:11,715 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 73 proven. 5 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-20 01:27:14,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:27:14,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1375 states to 1069 states and 1375 transitions. [2019-11-20 01:27:14,116 INFO L276 IsEmpty]: Start isEmpty. Operand 1069 states and 1375 transitions. [2019-11-20 01:27:14,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-11-20 01:27:14,117 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:27:14,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:27:14,295 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 73 proven. 5 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-20 01:27:15,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:27:15,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1077 states and 1384 transitions. [2019-11-20 01:27:15,037 INFO L276 IsEmpty]: Start isEmpty. Operand 1077 states and 1384 transitions. [2019-11-20 01:27:15,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-11-20 01:27:15,117 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:27:15,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:27:15,284 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 73 proven. 5 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-20 01:27:16,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:27:16,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1400 states to 1090 states and 1400 transitions. [2019-11-20 01:27:16,922 INFO L276 IsEmpty]: Start isEmpty. Operand 1090 states and 1400 transitions. [2019-11-20 01:27:16,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-11-20 01:27:16,923 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:27:16,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:27:17,104 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-11-20 01:27:17,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:27:17,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1406 states to 1095 states and 1406 transitions. [2019-11-20 01:27:17,430 INFO L276 IsEmpty]: Start isEmpty. Operand 1095 states and 1406 transitions. [2019-11-20 01:27:17,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-11-20 01:27:17,432 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:27:17,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:27:17,466 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-20 01:27:20,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:27:20,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1446 states to 1128 states and 1446 transitions. [2019-11-20 01:27:20,389 INFO L276 IsEmpty]: Start isEmpty. Operand 1128 states and 1446 transitions. [2019-11-20 01:27:20,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-11-20 01:27:20,390 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:27:20,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:27:20,523 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-20 01:27:21,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:27:21,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1451 states to 1134 states and 1451 transitions. [2019-11-20 01:27:21,300 INFO L276 IsEmpty]: Start isEmpty. Operand 1134 states and 1451 transitions. [2019-11-20 01:27:21,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-11-20 01:27:21,303 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:27:21,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:27:21,495 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-20 01:27:22,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:27:22,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1456 states to 1139 states and 1456 transitions. [2019-11-20 01:27:22,060 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 1456 transitions. [2019-11-20 01:27:22,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-11-20 01:27:22,061 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:27:22,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:27:22,296 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-20 01:27:24,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:27:24,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1486 states to 1159 states and 1486 transitions. [2019-11-20 01:27:24,272 INFO L276 IsEmpty]: Start isEmpty. Operand 1159 states and 1486 transitions. [2019-11-20 01:27:24,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-11-20 01:27:24,274 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:27:24,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:27:24,358 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-20 01:27:24,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:27:24,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1489 states to 1162 states and 1489 transitions. [2019-11-20 01:27:24,848 INFO L276 IsEmpty]: Start isEmpty. Operand 1162 states and 1489 transitions. [2019-11-20 01:27:24,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-11-20 01:27:24,850 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:27:24,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:27:24,885 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 86 proven. 8 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-11-20 01:27:25,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:27:25,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1491 states to 1164 states and 1491 transitions. [2019-11-20 01:27:25,259 INFO L276 IsEmpty]: Start isEmpty. Operand 1164 states and 1491 transitions. [2019-11-20 01:27:25,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-11-20 01:27:25,261 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:27:25,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:27:25,306 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-20 01:27:26,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:27:26,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1504 states to 1177 states and 1504 transitions. [2019-11-20 01:27:26,179 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 1504 transitions. [2019-11-20 01:27:26,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-11-20 01:27:26,181 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:27:26,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:27:26,214 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-20 01:27:27,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:27:27,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1185 states and 1512 transitions. [2019-11-20 01:27:27,121 INFO L276 IsEmpty]: Start isEmpty. Operand 1185 states and 1512 transitions. [2019-11-20 01:27:27,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-11-20 01:27:27,123 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:27:27,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:27:27,165 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-20 01:27:27,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:27:27,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1521 states to 1194 states and 1521 transitions. [2019-11-20 01:27:27,323 INFO L276 IsEmpty]: Start isEmpty. Operand 1194 states and 1521 transitions. [2019-11-20 01:27:27,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-11-20 01:27:27,325 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:27:27,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:27:27,830 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:27:34,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:27:34,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1588 states to 1254 states and 1588 transitions. [2019-11-20 01:27:34,186 INFO L276 IsEmpty]: Start isEmpty. Operand 1254 states and 1588 transitions. [2019-11-20 01:27:34,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-20 01:27:34,188 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:27:34,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:27:34,369 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-20 01:27:35,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:27:35,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1606 states to 1269 states and 1606 transitions. [2019-11-20 01:27:35,923 INFO L276 IsEmpty]: Start isEmpty. Operand 1269 states and 1606 transitions. [2019-11-20 01:27:35,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-11-20 01:27:35,924 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:27:35,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:27:36,498 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:27:40,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:27:40,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1647 states to 1305 states and 1647 transitions. [2019-11-20 01:27:40,116 INFO L276 IsEmpty]: Start isEmpty. Operand 1305 states and 1647 transitions. [2019-11-20 01:27:40,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-11-20 01:27:40,117 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:27:40,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:27:40,348 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:27:41,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:27:41,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1654 states to 1313 states and 1654 transitions. [2019-11-20 01:27:41,645 INFO L276 IsEmpty]: Start isEmpty. Operand 1313 states and 1654 transitions. [2019-11-20 01:27:41,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-11-20 01:27:41,646 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:27:41,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:27:41,699 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:27:44,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:27:44,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1677 states to 1329 states and 1677 transitions. [2019-11-20 01:27:44,078 INFO L276 IsEmpty]: Start isEmpty. Operand 1329 states and 1677 transitions. [2019-11-20 01:27:44,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-11-20 01:27:44,079 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:27:44,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:27:44,129 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:27:44,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:27:44,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1682 states to 1335 states and 1682 transitions. [2019-11-20 01:27:44,675 INFO L276 IsEmpty]: Start isEmpty. Operand 1335 states and 1682 transitions. [2019-11-20 01:27:44,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-11-20 01:27:44,676 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:27:44,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:27:44,722 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-11-20 01:27:45,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:27:45,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1688 states to 1340 states and 1688 transitions. [2019-11-20 01:27:45,275 INFO L276 IsEmpty]: Start isEmpty. Operand 1340 states and 1688 transitions. [2019-11-20 01:27:45,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-11-20 01:27:45,276 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:27:45,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:27:45,313 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-20 01:27:45,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:27:45,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1697 states to 1349 states and 1697 transitions. [2019-11-20 01:27:45,656 INFO L276 IsEmpty]: Start isEmpty. Operand 1349 states and 1697 transitions. [2019-11-20 01:27:45,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-11-20 01:27:45,657 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:27:45,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:27:45,724 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-11-20 01:27:46,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:27:46,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1704 states to 1352 states and 1704 transitions. [2019-11-20 01:27:46,020 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1704 transitions. [2019-11-20 01:27:46,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-11-20 01:27:46,021 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:27:46,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:27:46,055 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:27:46,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:27:46,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1714 states to 1360 states and 1714 transitions. [2019-11-20 01:27:46,109 INFO L276 IsEmpty]: Start isEmpty. Operand 1360 states and 1714 transitions. [2019-11-20 01:27:46,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-11-20 01:27:46,111 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:27:46,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:27:46,155 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:27:46,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:27:46,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1719 states to 1367 states and 1719 transitions. [2019-11-20 01:27:46,472 INFO L276 IsEmpty]: Start isEmpty. Operand 1367 states and 1719 transitions. [2019-11-20 01:27:46,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-11-20 01:27:46,473 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:27:46,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:27:47,593 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-20 01:27:54,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:27:54,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1769 states to 1416 states and 1769 transitions. [2019-11-20 01:27:54,793 INFO L276 IsEmpty]: Start isEmpty. Operand 1416 states and 1769 transitions. [2019-11-20 01:27:54,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-11-20 01:27:54,794 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:27:54,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:27:54,980 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 115 proven. 8 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-11-20 01:27:55,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:27:55,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1788 states to 1435 states and 1788 transitions. [2019-11-20 01:27:55,074 INFO L276 IsEmpty]: Start isEmpty. Operand 1435 states and 1788 transitions. [2019-11-20 01:27:55,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-11-20 01:27:55,075 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:27:55,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:27:56,400 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 01:27:57,284 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-11-20 01:28:04,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:28:04,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1857 states to 1504 states and 1857 transitions. [2019-11-20 01:28:04,933 INFO L276 IsEmpty]: Start isEmpty. Operand 1504 states and 1857 transitions. [2019-11-20 01:28:04,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-11-20 01:28:04,934 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:28:04,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:28:05,121 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 01:28:11,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:28:11,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1889 states to 1537 states and 1889 transitions. [2019-11-20 01:28:11,868 INFO L276 IsEmpty]: Start isEmpty. Operand 1537 states and 1889 transitions. [2019-11-20 01:28:11,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-11-20 01:28:11,870 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:28:11,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:28:11,945 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-11-20 01:28:12,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:28:12,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1890 states to 1539 states and 1890 transitions. [2019-11-20 01:28:12,576 INFO L276 IsEmpty]: Start isEmpty. Operand 1539 states and 1890 transitions. [2019-11-20 01:28:12,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-11-20 01:28:12,577 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:28:12,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:28:12,645 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 01:28:13,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:28:13,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1913 states to 1559 states and 1913 transitions. [2019-11-20 01:28:13,441 INFO L276 IsEmpty]: Start isEmpty. Operand 1559 states and 1913 transitions. [2019-11-20 01:28:13,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-11-20 01:28:13,442 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:28:13,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:28:13,504 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 01:28:13,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:28:13,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1916 states to 1563 states and 1916 transitions. [2019-11-20 01:28:13,795 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 1916 transitions. [2019-11-20 01:28:13,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-11-20 01:28:13,796 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:28:13,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:28:13,842 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-11-20 01:28:14,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:28:14,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1921 states to 1568 states and 1921 transitions. [2019-11-20 01:28:14,148 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 1921 transitions. [2019-11-20 01:28:14,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-11-20 01:28:14,150 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:28:14,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 01:28:14,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 01:28:14,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 01:28:14,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 01:28:14,486 WARN L483 CodeCheckObserver]: This program is UNSAFE, Check terminated with 103 iterations. [2019-11-20 01:28:14,734 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 20.11 01:28:14 ImpRootNode [2019-11-20 01:28:14,734 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2019-11-20 01:28:14,734 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 01:28:14,735 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 01:28:14,735 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 01:28:14,735 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:26:07" (3/4) ... [2019-11-20 01:28:14,738 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-20 01:28:14,944 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_b08a5c49-48f8-415b-b606-4def6990e483/bin/ukojak/witness.graphml [2019-11-20 01:28:14,944 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 01:28:14,945 INFO L168 Benchmark]: Toolchain (without parser) took 130491.84 ms. Allocated memory was 1.0 GB in the beginning and 2.9 GB in the end (delta: 1.9 GB). Free memory was 939.3 MB in the beginning and 2.4 GB in the end (delta: -1.5 GB). Peak memory consumption was 419.4 MB. Max. memory is 11.5 GB. [2019-11-20 01:28:14,946 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 01:28:14,946 INFO L168 Benchmark]: CACSL2BoogieTranslator took 688.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -164.8 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. [2019-11-20 01:28:14,947 INFO L168 Benchmark]: Boogie Procedure Inliner took 83.06 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-20 01:28:14,947 INFO L168 Benchmark]: Boogie Preprocessor took 84.52 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-20 01:28:14,948 INFO L168 Benchmark]: RCFGBuilder took 2581.30 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 875.7 MB in the end (delta: 217.7 MB). Peak memory consumption was 217.7 MB. Max. memory is 11.5 GB. [2019-11-20 01:28:14,948 INFO L168 Benchmark]: CodeCheck took 126840.34 ms. Allocated memory was 1.2 GB in the beginning and 2.9 GB in the end (delta: 1.7 GB). Free memory was 875.7 MB in the beginning and 2.4 GB in the end (delta: -1.6 GB). Peak memory consumption was 172.1 MB. Max. memory is 11.5 GB. [2019-11-20 01:28:14,949 INFO L168 Benchmark]: Witness Printer took 209.65 ms. Allocated memory is still 2.9 GB. Free memory was 2.4 GB in the beginning and 2.4 GB in the end (delta: 51.1 MB). Peak memory consumption was 51.1 MB. Max. memory is 11.5 GB. [2019-11-20 01:28:14,951 INFO L335 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, 85 locations, 1 error locations. Result: UNSAFE, OverallTime: 126.5s, OverallIterations: 103, TraceHistogramMax: 0, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 67700736 SDtfs, -169214404 SDslu, 406863872 SDs, 0 SdLazy, 1585029502 SolverSat, -39240314 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 501.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 92584 GetRequests, 90939 SyntacticMatches, 687 SemanticMatches, 958 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 620718 ImplicationChecksByTransitivity, 107.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.4s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 10.9s InterpolantComputationTime, 13915 NumberOfCodeBlocks, 13915 NumberOfCodeBlocksAsserted, 103 NumberOfCheckSat, 13635 ConstructedInterpolants, 0 QuantifiedInterpolants, 4643132 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 102 InterpolantComputations, 85 PerfectInterpolantSequences, 8216/8339 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 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)) [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] 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] 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)) [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] 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] 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)) [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.21 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 688.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -164.8 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 83.06 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 84.52 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2581.30 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 875.7 MB in the end (delta: 217.7 MB). Peak memory consumption was 217.7 MB. Max. memory is 11.5 GB. * CodeCheck took 126840.34 ms. Allocated memory was 1.2 GB in the beginning and 2.9 GB in the end (delta: 1.7 GB). Free memory was 875.7 MB in the beginning and 2.4 GB in the end (delta: -1.6 GB). Peak memory consumption was 172.1 MB. Max. memory is 11.5 GB. * Witness Printer took 209.65 ms. Allocated memory is still 2.9 GB. Free memory was 2.4 GB in the beginning and 2.4 GB in the end (delta: 51.1 MB). Peak memory consumption was 51.1 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...