./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label16_false-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_2608273b-3f29-44dc-90ca-577bce8c40f1/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_2608273b-3f29-44dc-90ca-577bce8c40f1/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_2608273b-3f29-44dc-90ca-577bce8c40f1/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_2608273b-3f29-44dc-90ca-577bce8c40f1/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label16_false-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_2608273b-3f29-44dc-90ca-577bce8c40f1/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_2608273b-3f29-44dc-90ca-577bce8c40f1/bin-2019/ukojak --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b5d27e813284518a11dcc3cc5ae3d66f549ea677 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 11:33:06,914 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 11:33:06,915 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 11:33:06,923 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 11:33:06,923 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 11:33:06,924 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 11:33:06,925 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 11:33:06,927 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 11:33:06,928 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 11:33:06,929 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 11:33:06,930 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 11:33:06,930 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 11:33:06,931 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 11:33:06,931 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 11:33:06,932 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 11:33:06,933 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 11:33:06,934 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 11:33:06,935 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 11:33:06,937 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 11:33:06,938 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 11:33:06,939 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 11:33:06,940 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 11:33:06,942 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 11:33:06,943 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 11:33:06,943 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 11:33:06,944 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 11:33:06,944 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 11:33:06,945 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 11:33:06,945 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 11:33:06,946 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 11:33:06,946 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 11:33:06,947 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 11:33:06,947 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 11:33:06,947 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 11:33:06,947 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 11:33:06,948 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 11:33:06,948 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_2608273b-3f29-44dc-90ca-577bce8c40f1/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-10 11:33:06,956 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 11:33:06,957 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 11:33:06,957 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 11:33:06,958 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 11:33:06,958 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 11:33:06,958 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 11:33:06,958 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 11:33:06,959 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 11:33:06,959 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 11:33:06,959 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 11:33:06,959 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 11:33:06,959 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 11:33:06,959 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 11:33:06,960 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 11:33:06,960 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 11:33:06,960 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 11:33:06,960 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 11:33:06,960 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-10 11:33:06,960 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-10 11:33:06,961 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 11:33:06,961 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 11:33:06,961 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-10 11:33:06,961 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 11:33:06,961 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 11:33:06,961 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 11:33:06,962 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-10 11:33:06,962 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 11:33:06,962 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 11:33:06,962 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_2608273b-3f29-44dc-90ca-577bce8c40f1/bin-2019/ukojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b5d27e813284518a11dcc3cc5ae3d66f549ea677 [2018-11-10 11:33:06,989 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 11:33:06,999 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 11:33:07,003 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 11:33:07,004 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 11:33:07,004 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 11:33:07,005 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_2608273b-3f29-44dc-90ca-577bce8c40f1/bin-2019/ukojak/../../sv-benchmarks/c/eca-rers2012/Problem02_label16_false-unreach-call_false-termination.c [2018-11-10 11:33:07,062 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2608273b-3f29-44dc-90ca-577bce8c40f1/bin-2019/ukojak/data/4417d2865/fac7cf4c28994c82be14aca2f58514f4/FLAGb3b345fb6 [2018-11-10 11:33:07,464 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 11:33:07,465 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_2608273b-3f29-44dc-90ca-577bce8c40f1/sv-benchmarks/c/eca-rers2012/Problem02_label16_false-unreach-call_false-termination.c [2018-11-10 11:33:07,475 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2608273b-3f29-44dc-90ca-577bce8c40f1/bin-2019/ukojak/data/4417d2865/fac7cf4c28994c82be14aca2f58514f4/FLAGb3b345fb6 [2018-11-10 11:33:07,488 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_2608273b-3f29-44dc-90ca-577bce8c40f1/bin-2019/ukojak/data/4417d2865/fac7cf4c28994c82be14aca2f58514f4 [2018-11-10 11:33:07,492 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 11:33:07,493 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 11:33:07,494 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 11:33:07,494 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 11:33:07,497 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 11:33:07,497 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:33:07" (1/1) ... [2018-11-10 11:33:07,499 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79e7f328 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:33:07, skipping insertion in model container [2018-11-10 11:33:07,500 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:33:07" (1/1) ... [2018-11-10 11:33:07,507 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 11:33:07,547 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 11:33:07,816 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 11:33:07,820 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 11:33:07,896 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 11:33:07,909 INFO L193 MainTranslator]: Completed translation [2018-11-10 11:33:07,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:33:07 WrapperNode [2018-11-10 11:33:07,909 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 11:33:07,910 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 11:33:07,910 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 11:33:07,910 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 11:33:07,917 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:33:07" (1/1) ... [2018-11-10 11:33:07,998 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:33:07" (1/1) ... [2018-11-10 11:33:08,034 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 11:33:08,034 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 11:33:08,034 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 11:33:08,034 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 11:33:08,044 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:33:07" (1/1) ... [2018-11-10 11:33:08,044 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:33:07" (1/1) ... [2018-11-10 11:33:08,047 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:33:07" (1/1) ... [2018-11-10 11:33:08,048 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:33:07" (1/1) ... [2018-11-10 11:33:08,063 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:33:07" (1/1) ... [2018-11-10 11:33:08,072 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:33:07" (1/1) ... [2018-11-10 11:33:08,078 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:33:07" (1/1) ... [2018-11-10 11:33:08,084 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 11:33:08,084 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 11:33:08,084 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 11:33:08,085 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 11:33:08,086 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:33:07" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2608273b-3f29-44dc-90ca-577bce8c40f1/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-10 11:33:08,147 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-10 11:33:08,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 11:33:08,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 11:33:09,652 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 11:33:09,653 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:33:09 BoogieIcfgContainer [2018-11-10 11:33:09,653 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 11:33:09,653 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-10 11:33:09,654 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-10 11:33:09,686 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-10 11:33:09,686 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:33:09" (1/1) ... [2018-11-10 11:33:09,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:33:09,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 11:33:09,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 86 states and 164 transitions. [2018-11-10 11:33:09,749 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 164 transitions. [2018-11-10 11:33:09,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-10 11:33:09,754 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 11:33:09,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:33:10,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:33:10,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 11:33:10,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 165 states and 248 transitions. [2018-11-10 11:33:10,599 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 248 transitions. [2018-11-10 11:33:10,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-10 11:33:10,601 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 11:33:10,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:33:10,697 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 11:33:11,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 11:33:11,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 250 states and 340 transitions. [2018-11-10 11:33:11,154 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 340 transitions. [2018-11-10 11:33:11,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-10 11:33:11,156 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 11:33:11,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:33:11,182 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:33:11,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 11:33:11,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 255 states and 345 transitions. [2018-11-10 11:33:11,262 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 345 transitions. [2018-11-10 11:33:11,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-10 11:33:11,264 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 11:33:11,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:33:11,308 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:33:11,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 11:33:11,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 258 states and 348 transitions. [2018-11-10 11:33:11,335 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 348 transitions. [2018-11-10 11:33:11,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-10 11:33:11,337 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 11:33:11,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:33:11,365 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:33:11,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 11:33:11,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 260 states and 350 transitions. [2018-11-10 11:33:11,390 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 350 transitions. [2018-11-10 11:33:11,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-10 11:33:11,391 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 11:33:11,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:33:11,465 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:33:11,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 11:33:11,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 278 states and 375 transitions. [2018-11-10 11:33:11,692 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 375 transitions. [2018-11-10 11:33:11,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-10 11:33:11,695 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 11:33:11,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:33:11,758 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:33:12,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 11:33:12,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 297 states and 401 transitions. [2018-11-10 11:33:12,157 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 401 transitions. [2018-11-10 11:33:12,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-10 11:33:12,158 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 11:33:12,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:33:12,188 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:33:12,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 11:33:12,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 306 states and 416 transitions. [2018-11-10 11:33:12,444 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 416 transitions. [2018-11-10 11:33:12,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-10 11:33:12,445 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 11:33:12,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:33:12,477 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:33:12,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 11:33:12,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 310 states and 420 transitions. [2018-11-10 11:33:12,543 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 420 transitions. [2018-11-10 11:33:12,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-10 11:33:12,545 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 11:33:12,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:33:12,608 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:33:12,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 11:33:12,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 326 states and 441 transitions. [2018-11-10 11:33:12,992 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 441 transitions. [2018-11-10 11:33:12,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-10 11:33:12,994 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 11:33:13,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:33:13,024 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:33:13,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 11:33:13,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 331 states and 449 transitions. [2018-11-10 11:33:13,331 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 449 transitions. [2018-11-10 11:33:13,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-10 11:33:13,333 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 11:33:13,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:33:13,365 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:33:13,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 11:33:13,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 335 states and 453 transitions. [2018-11-10 11:33:13,456 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 453 transitions. [2018-11-10 11:33:13,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-10 11:33:13,457 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 11:33:13,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:33:13,486 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:33:13,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 11:33:13,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 343 states and 462 transitions. [2018-11-10 11:33:13,692 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 462 transitions. [2018-11-10 11:33:13,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-10 11:33:13,693 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 11:33:13,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:33:13,722 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:33:14,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 11:33:14,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 354 states and 477 transitions. [2018-11-10 11:33:14,047 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 477 transitions. [2018-11-10 11:33:14,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-10 11:33:14,048 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 11:33:14,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:33:14,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:33:14,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:33:14,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:33:14,188 WARN L496 CodeCheckObserver]: This program is UNSAFE, Check terminated with 15 iterations. [2018-11-10 11:33:14,287 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 10.11 11:33:14 ImpRootNode [2018-11-10 11:33:14,287 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-10 11:33:14,287 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 11:33:14,287 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 11:33:14,288 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 11:33:14,288 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:33:09" (3/4) ... [2018-11-10 11:33:14,291 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-10 11:33:14,415 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_2608273b-3f29-44dc-90ca-577bce8c40f1/bin-2019/ukojak/witness.graphml [2018-11-10 11:33:14,415 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 11:33:14,416 INFO L168 Benchmark]: Toolchain (without parser) took 6923.91 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 262.1 MB). Free memory was 957.6 MB in the beginning and 1.1 GB in the end (delta: -149.9 MB). Peak memory consumption was 112.2 MB. Max. memory is 11.5 GB. [2018-11-10 11:33:14,417 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 11:33:14,417 INFO L168 Benchmark]: CACSL2BoogieTranslator took 415.89 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 925.4 MB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. [2018-11-10 11:33:14,417 INFO L168 Benchmark]: Boogie Procedure Inliner took 123.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 925.4 MB in the beginning and 1.1 GB in the end (delta: -206.9 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2018-11-10 11:33:14,418 INFO L168 Benchmark]: Boogie Preprocessor took 49.93 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. [2018-11-10 11:33:14,418 INFO L168 Benchmark]: RCFGBuilder took 1568.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 878.4 MB in the end (delta: 248.6 MB). Peak memory consumption was 248.6 MB. Max. memory is 11.5 GB. [2018-11-10 11:33:14,418 INFO L168 Benchmark]: CodeCheck took 4633.62 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 121.6 MB). Free memory was 878.4 MB in the beginning and 1.1 GB in the end (delta: -244.0 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 11:33:14,419 INFO L168 Benchmark]: Witness Printer took 128.11 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. [2018-11-10 11:33:14,420 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 228 locations, 1 error locations. UNSAFE Result, 4.4s OverallTime, 15 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 108472 SDtfs, 2799512 SDslu, 342392 SDs, 0 SdLazy, 6764556 SolverSat, 1372576 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 9864 GetRequests, 9734 SyntacticMatches, 12 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6971 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 1510 NumberOfCodeBlocks, 1510 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1386 ConstructedInterpolants, 0 QuantifiedInterpolants, 230360 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 278/278 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 433]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L7] int a= 1; [L8] int e= 5; [L9] int d= 4; [L10] int f= 6; [L11] int c= 3; [L14] int u = 21; [L15] int v = 22; [L16] int w = 23; [L17] int x = 24; [L18] int y = 25; [L19] int z = 26; [L22] int a25 = 0; [L23] int a11 = 0; [L24] int a28 = 7; [L25] int a19 = 1; [L26] int a21 = 1; [L27] int a17 = 8; [L603] int output = -1; VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L614] CALL, EXPR calculate_output(input) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L50] COND TRUE ((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7))))) [L51] a28 = 11 [L52] a25 = 1 [L53] RET return 26; VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L614] EXPR calculate_output(input) [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L614] CALL, EXPR calculate_output(input) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, 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=11, 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=11, 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=11, 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=11, 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=11, 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=11, 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=11, 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=11, 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=11, 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=11, 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=11, 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=11, 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=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L99] COND TRUE ((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1)) [L100] a17 = 7 [L101] a25 = 0 [L102] a11 = 1 [L103] a28 = 10 [L104] a19 = 0 [L105] RET return -1; VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L614] EXPR calculate_output(input) [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L614] CALL calculate_output(input) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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=0, a28=10, 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=0, a28=10, 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=0, a28=10, 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=0, a28=10, 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=0, a28=10, 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=0, a28=10, 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=0, a28=10, 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=0, a28=10, 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=0, a28=10, 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=0, a28=10, 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=0, a28=10, 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=0, a28=10, 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=0, a28=10, 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=0, a28=10, 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=0, a28=10, 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=0, a28=10, 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=0, a28=10, 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=0, a28=10, 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=0, a28=10, 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=0, a28=10, 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=0, a28=10, 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=0, a28=10, 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=0, a28=10, 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=0, a28=10, 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=0, a28=10, 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=0, a28=10, 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=0, a28=10, 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=0, a28=10, 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=0, a28=10, 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=0, a28=10, 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=0, a28=10, 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=0, a28=10, 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=0, a28=10, 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=0, a28=10, 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=0, a28=10, 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=0, a28=10, 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=0, a28=10, 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=0, a28=10, 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=0, a28=10, 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=0, a28=10, 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=0, a28=10, 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=0, a28=10, 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=0, a28=10, 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=0, a28=10, 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=0, a28=10, 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=0, a28=10, 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=0, a28=10, 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=0, a28=10, 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=0, a28=10, 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=0, a28=10, 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=0, a28=10, 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=0, a28=10, 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=0, a28=10, 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=0, a28=10, 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=0, a28=10, 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=0, a28=10, 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=0, a28=10, 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=0, a28=10, 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=0, a28=10, 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=0, a28=10, 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=0, a28=10, 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=0, a28=10, 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=0, a28=10, 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=0, a28=10, 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=0, a28=10, 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=0, a28=10, 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=0, a28=10, 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=0, a28=10, 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=0, a28=10, 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=0, a28=10, 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=0, a28=10, 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=0, a28=10, 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=0, a28=10, 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))) [L429] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==9))&&!(a19==1))&&(a21==1))&&(a17==7))) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L432] COND TRUE (((((!(a25==1)&&(a11==1))&&(a28==10))&&!(a19==1))&&(a21==1))&&(a17==7)) VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L433] __VERIFIER_error() VAL [a=1, a11=1, a17=7, a19=0, a21=1, a25=0, a28=10, 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 415.89 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 925.4 MB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 123.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 925.4 MB in the beginning and 1.1 GB in the end (delta: -206.9 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 49.93 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 1568.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 878.4 MB in the end (delta: 248.6 MB). Peak memory consumption was 248.6 MB. Max. memory is 11.5 GB. * CodeCheck took 4633.62 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 121.6 MB). Free memory was 878.4 MB in the beginning and 1.1 GB in the end (delta: -244.0 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 128.11 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...