./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label43.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_228b9c7a-a906-4f16-b6c4-239ffb035886/bin/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_228b9c7a-a906-4f16-b6c4-239ffb035886/bin/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_228b9c7a-a906-4f16-b6c4-239ffb035886/bin/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_228b9c7a-a906-4f16-b6c4-239ffb035886/bin/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label43.c -s /tmp/vcloud-vcloud-master/worker/run_dir_228b9c7a-a906-4f16-b6c4-239ffb035886/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_228b9c7a-a906-4f16-b6c4-239ffb035886/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 3aae675ead2f575cce05887b769a7a66f133447b ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-02 00:34:55,871 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-02 00:34:55,872 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-02 00:34:55,879 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-02 00:34:55,880 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-02 00:34:55,880 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-02 00:34:55,881 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-02 00:34:55,883 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-02 00:34:55,885 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-02 00:34:55,886 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-02 00:34:55,887 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-02 00:34:55,888 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-02 00:34:55,888 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-02 00:34:55,889 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-02 00:34:55,890 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-02 00:34:55,891 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-02 00:34:55,891 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-02 00:34:55,892 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-02 00:34:55,894 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-02 00:34:55,896 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-02 00:34:55,897 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-02 00:34:55,898 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-02 00:34:55,899 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-02 00:34:55,900 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-02 00:34:55,902 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-02 00:34:55,902 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-02 00:34:55,902 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-02 00:34:55,903 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-02 00:34:55,903 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-02 00:34:55,904 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-02 00:34:55,904 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-02 00:34:55,905 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-02 00:34:55,905 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-02 00:34:55,905 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-02 00:34:55,906 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-02 00:34:55,906 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-02 00:34:55,907 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-02 00:34:55,907 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-02 00:34:55,907 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-02 00:34:55,908 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-02 00:34:55,909 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-02 00:34:55,909 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_228b9c7a-a906-4f16-b6c4-239ffb035886/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2019-12-02 00:34:55,921 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-02 00:34:55,921 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-02 00:34:55,921 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-02 00:34:55,922 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2019-12-02 00:34:55,922 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-02 00:34:55,922 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-02 00:34:55,922 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-02 00:34:55,922 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-02 00:34:55,922 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-02 00:34:55,923 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-02 00:34:55,923 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-02 00:34:55,923 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-02 00:34:55,923 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-02 00:34:55,923 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-02 00:34:55,923 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-02 00:34:55,924 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-02 00:34:55,924 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-02 00:34:55,924 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-02 00:34:55,924 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2019-12-02 00:34:55,924 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2019-12-02 00:34:55,924 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-02 00:34:55,924 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-02 00:34:55,925 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2019-12-02 00:34:55,925 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-02 00:34:55,925 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-02 00:34:55,925 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-02 00:34:55,925 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2019-12-02 00:34:55,925 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-02 00:34:55,925 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-02 00:34:55,926 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_228b9c7a-a906-4f16-b6c4-239ffb035886/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 -> 3aae675ead2f575cce05887b769a7a66f133447b [2019-12-02 00:34:56,033 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-02 00:34:56,044 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-02 00:34:56,047 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-02 00:34:56,048 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-02 00:34:56,048 INFO L275 PluginConnector]: CDTParser initialized [2019-12-02 00:34:56,049 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_228b9c7a-a906-4f16-b6c4-239ffb035886/bin/ukojak/../../sv-benchmarks/c/eca-rers2012/Problem02_label43.c [2019-12-02 00:34:56,092 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_228b9c7a-a906-4f16-b6c4-239ffb035886/bin/ukojak/data/87c766275/9c8fc39e4af544919ec57b2a2cdff720/FLAG165bc1f73 [2019-12-02 00:34:56,461 INFO L306 CDTParser]: Found 1 translation units. [2019-12-02 00:34:56,462 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_228b9c7a-a906-4f16-b6c4-239ffb035886/sv-benchmarks/c/eca-rers2012/Problem02_label43.c [2019-12-02 00:34:56,469 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_228b9c7a-a906-4f16-b6c4-239ffb035886/bin/ukojak/data/87c766275/9c8fc39e4af544919ec57b2a2cdff720/FLAG165bc1f73 [2019-12-02 00:34:56,478 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_228b9c7a-a906-4f16-b6c4-239ffb035886/bin/ukojak/data/87c766275/9c8fc39e4af544919ec57b2a2cdff720 [2019-12-02 00:34:56,480 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-02 00:34:56,481 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-02 00:34:56,482 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-02 00:34:56,482 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-02 00:34:56,484 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-02 00:34:56,485 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:34:56" (1/1) ... [2019-12-02 00:34:56,486 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20cc73ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:34:56, skipping insertion in model container [2019-12-02 00:34:56,487 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:34:56" (1/1) ... [2019-12-02 00:34:56,491 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-02 00:34:56,528 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-02 00:34:56,819 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-02 00:34:56,822 INFO L203 MainTranslator]: Completed pre-run [2019-12-02 00:34:56,899 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-02 00:34:56,912 INFO L208 MainTranslator]: Completed translation [2019-12-02 00:34:56,912 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:34:56 WrapperNode [2019-12-02 00:34:56,913 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-02 00:34:56,913 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-02 00:34:56,913 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-02 00:34:56,913 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-02 00:34:56,919 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:34:56" (1/1) ... [2019-12-02 00:34:56,935 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:34:56" (1/1) ... [2019-12-02 00:34:56,978 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-02 00:34:56,978 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-02 00:34:56,978 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-02 00:34:56,978 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-02 00:34:56,985 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:34:56" (1/1) ... [2019-12-02 00:34:56,985 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:34:56" (1/1) ... [2019-12-02 00:34:56,989 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:34:56" (1/1) ... [2019-12-02 00:34:56,989 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:34:56" (1/1) ... [2019-12-02 00:34:57,012 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:34:56" (1/1) ... [2019-12-02 00:34:57,022 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:34:56" (1/1) ... [2019-12-02 00:34:57,027 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:34:56" (1/1) ... [2019-12-02 00:34:57,033 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-02 00:34:57,034 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-02 00:34:57,034 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-02 00:34:57,034 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-02 00:34:57,035 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:34:56" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_228b9c7a-a906-4f16-b6c4-239ffb035886/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-12-02 00:34:57,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-02 00:34:57,085 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-02 00:34:58,169 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-02 00:34:58,169 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-02 00:34:58,170 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:34:58 BoogieIcfgContainer [2019-12-02 00:34:58,170 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-02 00:34:58,170 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2019-12-02 00:34:58,170 INFO L271 PluginConnector]: Initializing CodeCheck... [2019-12-02 00:34:58,177 INFO L275 PluginConnector]: CodeCheck initialized [2019-12-02 00:34:58,177 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:34:58" (1/1) ... [2019-12-02 00:34:58,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-02 00:34:58,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 00:34:58,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 85 states and 162 transitions. [2019-12-02 00:34:58,210 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 162 transitions. [2019-12-02 00:34:58,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-02 00:34:58,213 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 00:34:58,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 00:34:58,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 00:34:58,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 00:34:58,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 163 states and 276 transitions. [2019-12-02 00:34:58,724 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 276 transitions. [2019-12-02 00:34:58,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-02 00:34:58,727 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 00:34:58,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 00:34:58,774 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 00:34:58,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 00:34:58,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 166 states and 281 transitions. [2019-12-02 00:34:58,825 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 281 transitions. [2019-12-02 00:34:58,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-02 00:34:58,827 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 00:34:58,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 00:34:58,892 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 00:34:59,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 00:34:59,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 170 states and 287 transitions. [2019-12-02 00:34:59,059 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 287 transitions. [2019-12-02 00:34:59,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-02 00:34:59,062 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 00:34:59,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 00:34:59,110 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 00:34:59,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 00:34:59,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 175 states and 296 transitions. [2019-12-02 00:34:59,227 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 296 transitions. [2019-12-02 00:34:59,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-02 00:34:59,231 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 00:34:59,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 00:34:59,262 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 00:34:59,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 00:34:59,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 181 states and 308 transitions. [2019-12-02 00:34:59,448 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 308 transitions. [2019-12-02 00:34:59,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-12-02 00:34:59,450 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 00:34:59,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 00:34:59,499 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 00:34:59,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 00:34:59,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 185 states and 316 transitions. [2019-12-02 00:34:59,672 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 316 transitions. [2019-12-02 00:34:59,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-12-02 00:34:59,672 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 00:34:59,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 00:34:59,701 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 00:34:59,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 00:34:59,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 188 states and 321 transitions. [2019-12-02 00:34:59,770 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 321 transitions. [2019-12-02 00:34:59,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-12-02 00:34:59,770 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 00:34:59,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 00:34:59,837 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 00:35:00,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 00:35:00,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 267 states and 403 transitions. [2019-12-02 00:35:00,300 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 403 transitions. [2019-12-02 00:35:00,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-02 00:35:00,301 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 00:35:00,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 00:35:00,327 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-02 00:35:00,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 00:35:00,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 271 states and 409 transitions. [2019-12-02 00:35:00,503 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 409 transitions. [2019-12-02 00:35:00,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-02 00:35:00,504 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 00:35:00,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 00:35:00,522 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-02 00:35:00,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 00:35:00,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 274 states and 412 transitions. [2019-12-02 00:35:00,606 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 412 transitions. [2019-12-02 00:35:00,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-02 00:35:00,607 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 00:35:00,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 00:35:00,620 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-02 00:35:00,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 00:35:00,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 277 states and 415 transitions. [2019-12-02 00:35:00,641 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 415 transitions. [2019-12-02 00:35:00,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-02 00:35:00,642 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 00:35:00,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 00:35:00,655 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-02 00:35:00,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 00:35:00,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 280 states and 418 transitions. [2019-12-02 00:35:00,678 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 418 transitions. [2019-12-02 00:35:00,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-02 00:35:00,679 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 00:35:00,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 00:35:00,694 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-02 00:35:00,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 00:35:00,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 282 states and 420 transitions. [2019-12-02 00:35:00,710 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 420 transitions. [2019-12-02 00:35:00,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-02 00:35:00,711 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 00:35:00,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 00:35:00,727 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 00:35:00,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 00:35:00,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 287 states and 425 transitions. [2019-12-02 00:35:00,754 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 425 transitions. [2019-12-02 00:35:00,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-12-02 00:35:00,755 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 00:35:00,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 00:35:00,772 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 00:35:00,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 00:35:00,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 289 states and 427 transitions. [2019-12-02 00:35:00,790 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 427 transitions. [2019-12-02 00:35:00,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-02 00:35:00,791 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 00:35:00,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 00:35:00,813 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-02 00:35:00,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 00:35:00,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 299 states and 440 transitions. [2019-12-02 00:35:00,989 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 440 transitions. [2019-12-02 00:35:00,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-02 00:35:00,990 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 00:35:00,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 00:35:01,063 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 00:35:01,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 00:35:01,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 309 states and 453 transitions. [2019-12-02 00:35:01,418 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 453 transitions. [2019-12-02 00:35:01,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-12-02 00:35:01,419 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 00:35:01,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 00:35:01,499 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-02 00:35:01,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 00:35:01,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 327 states and 480 transitions. [2019-12-02 00:35:01,891 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 480 transitions. [2019-12-02 00:35:01,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-12-02 00:35:01,891 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 00:35:01,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 00:35:01,908 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 00:35:01,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 00:35:01,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 331 states and 484 transitions. [2019-12-02 00:35:01,935 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 484 transitions. [2019-12-02 00:35:01,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-12-02 00:35:01,936 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 00:35:01,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 00:35:01,953 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 00:35:01,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 00:35:01,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 332 states and 485 transitions. [2019-12-02 00:35:01,966 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 485 transitions. [2019-12-02 00:35:01,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-12-02 00:35:01,967 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 00:35:01,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 00:35:01,984 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-02 00:35:02,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 00:35:02,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 337 states and 491 transitions. [2019-12-02 00:35:02,050 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 491 transitions. [2019-12-02 00:35:02,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-12-02 00:35:02,052 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 00:35:02,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 00:35:02,110 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-02 00:35:02,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 00:35:02,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 357 states and 514 transitions. [2019-12-02 00:35:02,552 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 514 transitions. [2019-12-02 00:35:02,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-12-02 00:35:02,553 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 00:35:02,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 00:35:02,582 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 00:35:02,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 00:35:02,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 358 states and 515 transitions. [2019-12-02 00:35:02,595 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 515 transitions. [2019-12-02 00:35:02,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-12-02 00:35:02,596 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 00:35:02,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 00:35:02,616 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-02 00:35:02,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 00:35:02,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 364 states and 522 transitions. [2019-12-02 00:35:02,697 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 522 transitions. [2019-12-02 00:35:02,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-12-02 00:35:02,698 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 00:35:02,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 00:35:02,782 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 00:35:03,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 00:35:03,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 377 states and 538 transitions. [2019-12-02 00:35:03,231 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 538 transitions. [2019-12-02 00:35:03,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-12-02 00:35:03,232 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 00:35:03,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 00:35:03,302 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 00:35:03,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 00:35:03,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 456 states and 622 transitions. [2019-12-02 00:35:03,747 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 622 transitions. [2019-12-02 00:35:03,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-12-02 00:35:03,748 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 00:35:03,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 00:35:03,802 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-02 00:35:04,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 00:35:04,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 460 states and 628 transitions. [2019-12-02 00:35:04,061 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 628 transitions. [2019-12-02 00:35:04,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-12-02 00:35:04,062 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 00:35:04,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 00:35:04,114 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-02 00:35:04,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 00:35:04,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 463 states and 631 transitions. [2019-12-02 00:35:04,238 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 631 transitions. [2019-12-02 00:35:04,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-12-02 00:35:04,239 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 00:35:04,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 00:35:04,258 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-02 00:35:04,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 00:35:04,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 470 states and 638 transitions. [2019-12-02 00:35:04,293 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 638 transitions. [2019-12-02 00:35:04,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-12-02 00:35:04,293 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 00:35:04,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 00:35:04,346 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 00:35:04,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 00:35:04,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 477 states and 647 transitions. [2019-12-02 00:35:04,653 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 647 transitions. [2019-12-02 00:35:04,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-12-02 00:35:04,653 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 00:35:04,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 00:35:04,728 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-02 00:35:05,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 00:35:05,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 493 states and 667 transitions. [2019-12-02 00:35:05,359 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 667 transitions. [2019-12-02 00:35:05,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-12-02 00:35:05,359 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 00:35:05,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 00:35:05,429 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-02 00:35:05,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 00:35:05,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 496 states and 670 transitions. [2019-12-02 00:35:05,562 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 670 transitions. [2019-12-02 00:35:05,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-12-02 00:35:05,563 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 00:35:05,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 00:35:05,687 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-02 00:35:06,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 00:35:06,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 503 states and 687 transitions. [2019-12-02 00:35:06,268 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 687 transitions. [2019-12-02 00:35:06,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-12-02 00:35:06,269 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 00:35:06,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 00:35:06,290 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-02 00:35:06,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 00:35:06,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 506 states and 691 transitions. [2019-12-02 00:35:06,421 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 691 transitions. [2019-12-02 00:35:06,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-12-02 00:35:06,422 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 00:35:06,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-02 00:35:06,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-02 00:35:06,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-02 00:35:06,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-02 00:35:06,577 WARN L483 CodeCheckObserver]: This program is UNSAFE, Check terminated with 35 iterations. [2019-12-02 00:35:06,686 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 02.12 12:35:06 ImpRootNode [2019-12-02 00:35:06,687 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2019-12-02 00:35:06,687 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-02 00:35:06,687 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-02 00:35:06,687 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-02 00:35:06,687 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:34:58" (3/4) ... [2019-12-02 00:35:06,689 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-02 00:35:06,774 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_228b9c7a-a906-4f16-b6c4-239ffb035886/bin/ukojak/witness.graphml [2019-12-02 00:35:06,774 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-02 00:35:06,775 INFO L168 Benchmark]: Toolchain (without parser) took 10293.92 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 295.2 MB). Free memory was 941.4 MB in the beginning and 819.9 MB in the end (delta: 121.5 MB). Peak memory consumption was 416.7 MB. Max. memory is 11.5 GB. [2019-12-02 00:35:06,776 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-02 00:35:06,776 INFO L168 Benchmark]: CACSL2BoogieTranslator took 431.18 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 96.5 MB). Free memory was 941.4 MB in the beginning and 1.1 GB in the end (delta: -128.0 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-12-02 00:35:06,776 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.97 ms. Allocated memory is still 1.1 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-12-02 00:35:06,776 INFO L168 Benchmark]: Boogie Preprocessor took 55.26 ms. Allocated memory is still 1.1 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-12-02 00:35:06,777 INFO L168 Benchmark]: RCFGBuilder took 1136.10 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 838.9 MB in the end (delta: 219.8 MB). Peak memory consumption was 219.8 MB. Max. memory is 11.5 GB. [2019-12-02 00:35:06,777 INFO L168 Benchmark]: CodeCheck took 8516.46 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 198.7 MB). Free memory was 838.9 MB in the beginning and 842.5 MB in the end (delta: -3.7 MB). Peak memory consumption was 195.0 MB. Max. memory is 11.5 GB. [2019-12-02 00:35:06,777 INFO L168 Benchmark]: Witness Printer took 87.11 ms. Allocated memory is still 1.3 GB. Free memory was 842.5 MB in the beginning and 819.9 MB in the end (delta: 22.7 MB). Peak memory consumption was 22.7 MB. Max. memory is 11.5 GB. [2019-12-02 00:35:06,779 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: 8.3s, OverallIterations: 35, TraceHistogramMax: 0, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: -65796292 SDtfs, 1286419482 SDslu, -327930756 SDs, 0 SdLazy, 184390170 SolverSat, -1650435664 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 29.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 26248 GetRequests, 25977 SyntacticMatches, 57 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26318 ImplicationChecksByTransitivity, 5.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 3554 NumberOfCodeBlocks, 3554 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 3406 ConstructedInterpolants, 0 QuantifiedInterpolants, 555161 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 PerfectInterpolantSequences, 862/862 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: 427]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L7] int a= 1; [L8] int e= 5; [L9] int d= 4; [L10] int f= 6; [L11] int c= 3; [L14] int u = 21; [L15] int v = 22; [L16] int w = 23; [L17] int x = 24; [L18] int y = 25; [L19] int z = 26; [L22] int a25 = 0; [L23] int a11 = 0; [L24] int a28 = 7; [L25] int a19 = 1; [L26] int a21 = 1; [L27] int a17 = 8; [L603] int output = -1; VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [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 TRUE (((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8)) [L31] a28 = 9 [L32] a11 = 1 [L33] a25 = 1 [L34] return -1; VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L614] 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=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L50] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L74] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L91] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L95] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L99] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L106] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L113] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L130] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L143] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L159] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !((((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L169] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L179] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L185] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L187] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L191] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L198] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L202] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L212] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L215] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L225] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L232] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L234] COND FALSE !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L237] COND FALSE !((!(a11==1)&&(((a17==8)&&((((!(a25==1)&&(a28==11))||((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1))))&&(input==3))&&(a21==1)))&&!(a19==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((((!(a11==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==5)))&&(a21==1))&&!(a19==1))&&(a17==8))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L253] COND FALSE !((((a17==9)&&(((((input==1)&&((a25==1)||!(a25==1)))&&(a11==1))&&(a21==1))&&(a19==1)))&&(a28==9))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L259] COND FALSE !((!(a11==1)&&((a19==1)&&(((((a28==9)&&(input==6))&&(a21==1))&&(a17==8))&&!(a25==1))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((a17==9)&&((a21==1)&&((a11==1)&&(((input==3)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a19==1)))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L276] COND FALSE !(((a28==7)&&((a17==8)&&(!(a25==1)&&((a21==1)&&((a19==1)&&((input==5)&&!(a11==1)))))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L280] COND FALSE !(((a28==8)&&((a21==1)&&((!(a11==1)&&(((input==1)&&(a17==8))&&(a19==1)))&&(a25==1))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !((((((a17==8)&&(((input==6)&&((a25==1)||!(a25==1)))&&(a21==1)))&&(a28==10))&&!(a11==1))&&(a19==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((!(a11==1)&&((!(a19==1)&&(((!(a25==1)&&(a28==11))||(((a28==10)&&!(a25==1))||((a25==1)&&(a28==11))))&&(input==5)))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L291] COND FALSE !(((a17==8)&&(((a21==1)&&(!(a11==1)&&((a25==1)&&((a28==8)&&(input==6)))))&&(a19==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L293] COND FALSE !((((a19==1)&&((a17==8)&&(((!(a25==1)&&(input==5))&&(a21==1))&&!(a11==1))))&&(a28==11))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L297] COND FALSE !(((a11==1)&&(((a17==9)&&((a28==9)&&((a19==1)&&(((a25==1)||!(a25==1))&&(input==5)))))&&(a21==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((((((input==3)&&(a19==1))&&(a21==1))&&(a17==8))&&!(a25==1))&&(a28==11))&&!(a11==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L314] COND FALSE !(((a19==1)&&((a21==1)&&((((input==5)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a11==1))&&(a17==9))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((((a19==1)&&(((!(a11==1)&&(((a25==1)||!(a25==1))&&(input==3)))&&(a28==10))&&(a21==1)))&&(a17==8))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L331] COND FALSE !(((!(a11==1)&&(((((input==4)&&(a17==8))&&!(a25==1))&&(a21==1))&&(a28==11)))&&(a19==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L337] COND FALSE !((((!(a19==1)&&(((input==4)&&(((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1)))||(!(a25==1)&&(a28==11))))&&(a21==1)))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L349] COND FALSE !((!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L354] COND FALSE !((((((a21==1)&&((((a28==8)&&!(a25==1))||((a28==9)&&(a25==1)))&&(input==6)))&&!(a11==1))&&!(a19==1))&&(a17==8))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L361] COND FALSE !(((a19==1)&&((((a21==1)&&((!(a25==1)&&(input==3))&&(a17==9)))&&(a28==8))&&(a11==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L368] COND FALSE !(((a17==8)&&(((a21==1)&&(((input==5)&&((!(a25==1)&&(a28==8))||((a28==9)&&(a25==1))))&&(a19==1)))&&!(a11==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L375] COND FALSE !(((a19==1)&&(((((a17==8)&&((input==5)&&!(a11==1)))&&(a21==1))&&(a25==1))&&(a28==8)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L378] COND FALSE !((((!(a11==1)&&((((a21==1)&&(input==4))&&(a28==10))&&(a17==8)))&&!(a19==1))&&(a25==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L380] COND FALSE !(((a28==8)&&(((a19==1)&&((a11==1)&&(!(a25==1)&&((a17==9)&&(input==6)))))&&(a21==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L389] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==6)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))&&(a17==8))&&!(a19==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L394] COND FALSE !((((((!(a25==1)&&((a19==1)&&(input==3)))&&(a28==9))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L398] COND FALSE !((((a17==8)&&((((input==4)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9))))&&(a21==1))&&!(a19==1)))&&!(a11==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L402] COND FALSE !((((!(a11==1)&&((((a19==1)&&(input==5))&&(a17==8))&&(a21==1)))&&(a28==9))&&!(a25==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L404] COND FALSE !((((a11==1)&&((a19==1)&&((a21==1)&&(((a17==9)&&(input==5))&&!(a25==1)))))&&(a28==8))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L407] COND FALSE !((!(a11==1)&&((a21==1)&&(((a19==1)&&((a17==8)&&((a25==1)&&(input==5))))&&(a28==11))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L409] COND FALSE !(((a19==1)&&((a17==8)&&(((((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))&&!(a11==1))&&(a21==1))))) [L414] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==7))&&!(a19==1))&&(a21==1))&&(a17==8))) [L417] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==10))&&(a19==1))&&(a21==1))&&(a17==8))) [L420] COND FALSE !(((((((a25==1)&&!(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==8))) [L423] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==7))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L426] COND TRUE ((((((a25==1)&&(a11==1))&&(a28==9))&&(a19==1))&&(a21==1))&&(a17==8)) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L427] __VERIFIER_error() VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 431.18 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 96.5 MB). Free memory was 941.4 MB in the beginning and 1.1 GB in the end (delta: -128.0 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 64.97 ms. Allocated memory is still 1.1 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 55.26 ms. Allocated memory is still 1.1 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 1136.10 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 838.9 MB in the end (delta: 219.8 MB). Peak memory consumption was 219.8 MB. Max. memory is 11.5 GB. * CodeCheck took 8516.46 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 198.7 MB). Free memory was 838.9 MB in the beginning and 842.5 MB in the end (delta: -3.7 MB). Peak memory consumption was 195.0 MB. Max. memory is 11.5 GB. * Witness Printer took 87.11 ms. Allocated memory is still 1.3 GB. Free memory was 842.5 MB in the beginning and 819.9 MB in the end (delta: 22.7 MB). Peak memory consumption was 22.7 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...