./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label38_false-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_10613ad5-978d-404b-abd6-b64ba7697fe0/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_10613ad5-978d-404b-abd6-b64ba7697fe0/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_10613ad5-978d-404b-abd6-b64ba7697fe0/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_10613ad5-978d-404b-abd6-b64ba7697fe0/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label38_false-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_10613ad5-978d-404b-abd6-b64ba7697fe0/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_10613ad5-978d-404b-abd6-b64ba7697fe0/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5d9bfdaf23db32516d1ccf8929c6af5e4a9d3bd0 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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-5842f4b [2018-11-18 17:11:50,916 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 17:11:50,917 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 17:11:50,924 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 17:11:50,924 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 17:11:50,925 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 17:11:50,925 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 17:11:50,927 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 17:11:50,927 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 17:11:50,928 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 17:11:50,929 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 17:11:50,929 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 17:11:50,930 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 17:11:50,930 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 17:11:50,931 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 17:11:50,932 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 17:11:50,932 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 17:11:50,933 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 17:11:50,934 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 17:11:50,935 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 17:11:50,936 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 17:11:50,937 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 17:11:50,938 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 17:11:50,938 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 17:11:50,939 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 17:11:50,939 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 17:11:50,940 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 17:11:50,940 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 17:11:50,941 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 17:11:50,942 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 17:11:50,942 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 17:11:50,942 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 17:11:50,942 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 17:11:50,942 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 17:11:50,943 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 17:11:50,943 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 17:11:50,944 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_10613ad5-978d-404b-abd6-b64ba7697fe0/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-18 17:11:50,952 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 17:11:50,952 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 17:11:50,953 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 17:11:50,954 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 17:11:50,954 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 17:11:50,954 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 17:11:50,954 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 17:11:50,954 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-18 17:11:50,954 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 17:11:50,954 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 17:11:50,955 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-18 17:11:50,955 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-18 17:11:50,955 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 17:11:50,955 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 17:11:50,956 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 17:11:50,956 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 17:11:50,956 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 17:11:50,956 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 17:11:50,956 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 17:11:50,956 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 17:11:50,956 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 17:11:50,957 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 17:11:50,957 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 17:11:50,957 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 17:11:50,957 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 17:11:50,957 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 17:11:50,957 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 17:11:50,957 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 17:11:50,958 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 17:11:50,958 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 17:11:50,958 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 17:11:50,958 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 17:11:50,958 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 17:11:50,958 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-18 17:11:50,958 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 17:11:50,958 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 17:11:50,959 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 17:11:50,959 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_10613ad5-978d-404b-abd6-b64ba7697fe0/bin-2019/utaipan 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 -> Taipan 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 -> 5d9bfdaf23db32516d1ccf8929c6af5e4a9d3bd0 [2018-11-18 17:11:50,982 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 17:11:50,990 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 17:11:50,992 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 17:11:50,993 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 17:11:50,994 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 17:11:50,994 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_10613ad5-978d-404b-abd6-b64ba7697fe0/bin-2019/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem01_label38_false-unreach-call_false-termination.c [2018-11-18 17:11:51,039 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_10613ad5-978d-404b-abd6-b64ba7697fe0/bin-2019/utaipan/data/1ed3aeaaf/560773870c0e4a5b9728d0a2fc77246e/FLAG035289018 [2018-11-18 17:11:51,419 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 17:11:51,419 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_10613ad5-978d-404b-abd6-b64ba7697fe0/sv-benchmarks/c/eca-rers2012/Problem01_label38_false-unreach-call_false-termination.c [2018-11-18 17:11:51,428 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_10613ad5-978d-404b-abd6-b64ba7697fe0/bin-2019/utaipan/data/1ed3aeaaf/560773870c0e4a5b9728d0a2fc77246e/FLAG035289018 [2018-11-18 17:11:51,815 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_10613ad5-978d-404b-abd6-b64ba7697fe0/bin-2019/utaipan/data/1ed3aeaaf/560773870c0e4a5b9728d0a2fc77246e [2018-11-18 17:11:51,818 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 17:11:51,819 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 17:11:51,819 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 17:11:51,820 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 17:11:51,822 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 17:11:51,823 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 05:11:51" (1/1) ... [2018-11-18 17:11:51,825 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4634de3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:11:51, skipping insertion in model container [2018-11-18 17:11:51,825 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 05:11:51" (1/1) ... [2018-11-18 17:11:51,832 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 17:11:51,871 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 17:11:52,142 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 17:11:52,146 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 17:11:52,222 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 17:11:52,233 INFO L195 MainTranslator]: Completed translation [2018-11-18 17:11:52,233 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:11:52 WrapperNode [2018-11-18 17:11:52,233 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 17:11:52,234 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 17:11:52,234 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 17:11:52,234 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 17:11:52,305 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:11:52" (1/1) ... [2018-11-18 17:11:52,318 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:11:52" (1/1) ... [2018-11-18 17:11:52,325 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 17:11:52,325 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 17:11:52,325 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 17:11:52,325 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 17:11:52,331 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:11:52" (1/1) ... [2018-11-18 17:11:52,332 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:11:52" (1/1) ... [2018-11-18 17:11:52,335 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:11:52" (1/1) ... [2018-11-18 17:11:52,335 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:11:52" (1/1) ... [2018-11-18 17:11:52,360 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:11:52" (1/1) ... [2018-11-18 17:11:52,369 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:11:52" (1/1) ... [2018-11-18 17:11:52,371 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:11:52" (1/1) ... [2018-11-18 17:11:52,375 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 17:11:52,375 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 17:11:52,375 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 17:11:52,375 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 17:11:52,376 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:11:52" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_10613ad5-978d-404b-abd6-b64ba7697fe0/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (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:2000 [2018-11-18 17:11:52,422 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-18 17:11:52,422 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 17:11:52,422 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 17:11:52,422 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-18 17:11:52,422 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-18 17:11:52,423 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 17:11:52,423 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 17:11:52,423 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 17:11:52,423 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 17:11:53,197 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 17:11:53,197 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 05:11:53 BoogieIcfgContainer [2018-11-18 17:11:53,198 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 17:11:53,198 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 17:11:53,198 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 17:11:53,201 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 17:11:53,201 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 05:11:51" (1/3) ... [2018-11-18 17:11:53,202 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61a8b44a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 05:11:53, skipping insertion in model container [2018-11-18 17:11:53,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:11:52" (2/3) ... [2018-11-18 17:11:53,202 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61a8b44a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 05:11:53, skipping insertion in model container [2018-11-18 17:11:53,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 05:11:53" (3/3) ... [2018-11-18 17:11:53,204 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label38_false-unreach-call_false-termination.c [2018-11-18 17:11:53,211 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 17:11:53,217 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 17:11:53,228 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 17:11:53,252 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 17:11:53,253 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 17:11:53,253 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 17:11:53,253 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 17:11:53,253 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 17:11:53,253 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 17:11:53,253 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 17:11:53,253 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 17:11:53,274 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states. [2018-11-18 17:11:53,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-18 17:11:53,281 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:11:53,282 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:11:53,284 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:11:53,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:11:53,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1847189963, now seen corresponding path program 1 times [2018-11-18 17:11:53,290 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:11:53,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:11:53,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:11:53,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:11:53,325 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:11:53,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:11:53,601 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-18 17:11:53,603 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:11:53,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:11:53,604 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:11:53,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:11:53,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:11:53,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:11:53,625 INFO L87 Difference]: Start difference. First operand 208 states. Second operand 3 states. [2018-11-18 17:11:54,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:11:54,277 INFO L93 Difference]: Finished difference Result 550 states and 941 transitions. [2018-11-18 17:11:54,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:11:54,279 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2018-11-18 17:11:54,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:11:54,289 INFO L225 Difference]: With dead ends: 550 [2018-11-18 17:11:54,289 INFO L226 Difference]: Without dead ends: 340 [2018-11-18 17:11:54,293 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:11:54,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-11-18 17:11:54,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2018-11-18 17:11:54,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-11-18 17:11:54,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 553 transitions. [2018-11-18 17:11:54,333 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 553 transitions. Word has length 89 [2018-11-18 17:11:54,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:11:54,334 INFO L480 AbstractCegarLoop]: Abstraction has 340 states and 553 transitions. [2018-11-18 17:11:54,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:11:54,334 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 553 transitions. [2018-11-18 17:11:54,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-18 17:11:54,337 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:11:54,338 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:11:54,338 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:11:54,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:11:54,338 INFO L82 PathProgramCache]: Analyzing trace with hash 2082280758, now seen corresponding path program 1 times [2018-11-18 17:11:54,338 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:11:54,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:11:54,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:11:54,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:11:54,339 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:11:54,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:11:54,433 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:11:54,433 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:11:54,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 17:11:54,434 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:11:54,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 17:11:54,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 17:11:54,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-18 17:11:54,436 INFO L87 Difference]: Start difference. First operand 340 states and 553 transitions. Second operand 6 states. [2018-11-18 17:11:55,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:11:55,122 INFO L93 Difference]: Finished difference Result 1075 states and 1835 transitions. [2018-11-18 17:11:55,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 17:11:55,122 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2018-11-18 17:11:55,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:11:55,127 INFO L225 Difference]: With dead ends: 1075 [2018-11-18 17:11:55,127 INFO L226 Difference]: Without dead ends: 741 [2018-11-18 17:11:55,129 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-18 17:11:55,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2018-11-18 17:11:55,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 724. [2018-11-18 17:11:55,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 724 states. [2018-11-18 17:11:55,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 1145 transitions. [2018-11-18 17:11:55,158 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 1145 transitions. Word has length 100 [2018-11-18 17:11:55,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:11:55,158 INFO L480 AbstractCegarLoop]: Abstraction has 724 states and 1145 transitions. [2018-11-18 17:11:55,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 17:11:55,158 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 1145 transitions. [2018-11-18 17:11:55,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-18 17:11:55,161 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:11:55,161 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:11:55,161 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:11:55,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:11:55,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1252519582, now seen corresponding path program 1 times [2018-11-18 17:11:55,162 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:11:55,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:11:55,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:11:55,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:11:55,163 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:11:55,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:11:55,274 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:11:55,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:11:55,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:11:55,274 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:11:55,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:11:55,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:11:55,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:11:55,275 INFO L87 Difference]: Start difference. First operand 724 states and 1145 transitions. Second operand 3 states. [2018-11-18 17:11:55,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:11:55,692 INFO L93 Difference]: Finished difference Result 2065 states and 3370 transitions. [2018-11-18 17:11:55,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:11:55,693 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2018-11-18 17:11:55,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:11:55,699 INFO L225 Difference]: With dead ends: 2065 [2018-11-18 17:11:55,699 INFO L226 Difference]: Without dead ends: 1347 [2018-11-18 17:11:55,702 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:11:55,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1347 states. [2018-11-18 17:11:55,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1347 to 1346. [2018-11-18 17:11:55,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1346 states. [2018-11-18 17:11:55,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1346 states to 1346 states and 1974 transitions. [2018-11-18 17:11:55,736 INFO L78 Accepts]: Start accepts. Automaton has 1346 states and 1974 transitions. Word has length 101 [2018-11-18 17:11:55,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:11:55,737 INFO L480 AbstractCegarLoop]: Abstraction has 1346 states and 1974 transitions. [2018-11-18 17:11:55,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:11:55,737 INFO L276 IsEmpty]: Start isEmpty. Operand 1346 states and 1974 transitions. [2018-11-18 17:11:55,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-18 17:11:55,739 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:11:55,739 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:11:55,740 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:11:55,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:11:55,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1570299834, now seen corresponding path program 1 times [2018-11-18 17:11:55,740 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:11:55,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:11:55,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:11:55,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:11:55,741 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:11:55,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:11:55,814 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-18 17:11:55,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:11:55,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:11:55,815 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:11:55,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:11:55,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:11:55,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:11:55,816 INFO L87 Difference]: Start difference. First operand 1346 states and 1974 transitions. Second operand 3 states. [2018-11-18 17:11:56,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:11:56,293 INFO L93 Difference]: Finished difference Result 3743 states and 5585 transitions. [2018-11-18 17:11:56,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:11:56,293 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2018-11-18 17:11:56,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:11:56,303 INFO L225 Difference]: With dead ends: 3743 [2018-11-18 17:11:56,303 INFO L226 Difference]: Without dead ends: 2403 [2018-11-18 17:11:56,309 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:11:56,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2403 states. [2018-11-18 17:11:56,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2403 to 2390. [2018-11-18 17:11:56,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2390 states. [2018-11-18 17:11:56,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2390 states to 2390 states and 3324 transitions. [2018-11-18 17:11:56,362 INFO L78 Accepts]: Start accepts. Automaton has 2390 states and 3324 transitions. Word has length 102 [2018-11-18 17:11:56,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:11:56,363 INFO L480 AbstractCegarLoop]: Abstraction has 2390 states and 3324 transitions. [2018-11-18 17:11:56,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:11:56,363 INFO L276 IsEmpty]: Start isEmpty. Operand 2390 states and 3324 transitions. [2018-11-18 17:11:56,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-11-18 17:11:56,367 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:11:56,368 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:11:56,368 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:11:56,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:11:56,368 INFO L82 PathProgramCache]: Analyzing trace with hash 256573878, now seen corresponding path program 1 times [2018-11-18 17:11:56,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:11:56,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:11:56,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:11:56,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:11:56,369 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:11:56,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:11:56,524 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:11:56,525 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:11:56,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 17:11:56,525 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:11:56,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 17:11:56,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 17:11:56,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-18 17:11:56,526 INFO L87 Difference]: Start difference. First operand 2390 states and 3324 transitions. Second operand 7 states. [2018-11-18 17:11:57,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:11:57,233 INFO L93 Difference]: Finished difference Result 5792 states and 8158 transitions. [2018-11-18 17:11:57,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 17:11:57,234 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 143 [2018-11-18 17:11:57,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:11:57,245 INFO L225 Difference]: With dead ends: 5792 [2018-11-18 17:11:57,246 INFO L226 Difference]: Without dead ends: 3074 [2018-11-18 17:11:57,255 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-18 17:11:57,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3074 states. [2018-11-18 17:11:57,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3074 to 3042. [2018-11-18 17:11:57,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3042 states. [2018-11-18 17:11:57,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3042 states to 3042 states and 3993 transitions. [2018-11-18 17:11:57,327 INFO L78 Accepts]: Start accepts. Automaton has 3042 states and 3993 transitions. Word has length 143 [2018-11-18 17:11:57,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:11:57,327 INFO L480 AbstractCegarLoop]: Abstraction has 3042 states and 3993 transitions. [2018-11-18 17:11:57,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 17:11:57,327 INFO L276 IsEmpty]: Start isEmpty. Operand 3042 states and 3993 transitions. [2018-11-18 17:11:57,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-11-18 17:11:57,334 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:11:57,334 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:11:57,334 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:11:57,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:11:57,335 INFO L82 PathProgramCache]: Analyzing trace with hash -457461469, now seen corresponding path program 1 times [2018-11-18 17:11:57,335 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:11:57,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:11:57,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:11:57,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:11:57,336 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:11:57,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:11:57,501 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 70 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:11:57,502 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:11:57,502 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 17:11:57,502 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 156 with the following transitions: [2018-11-18 17:11:57,504 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [17], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [185], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [349], [351], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-18 17:11:57,535 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 17:11:57,535 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 17:11:57,945 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 17:11:57,946 INFO L272 AbstractInterpreter]: Visited 93 different actions 179 times. Merged at 4 different actions 4 times. Never widened. Performed 2650 root evaluator evaluations with a maximum evaluation depth of 3. Performed 2650 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-11-18 17:11:57,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:11:57,963 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 17:11:58,310 INFO L227 lantSequenceWeakener]: Weakened 152 states. On average, predicates are now at 81.4% of their original sizes. [2018-11-18 17:11:58,310 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 17:11:58,369 INFO L415 sIntCurrentIteration]: We unified 154 AI predicates to 154 [2018-11-18 17:11:58,369 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 17:11:58,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 17:11:58,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-11-18 17:11:58,370 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:11:58,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 17:11:58,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 17:11:58,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-18 17:11:58,371 INFO L87 Difference]: Start difference. First operand 3042 states and 3993 transitions. Second operand 10 states. [2018-11-18 17:12:02,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:12:02,586 INFO L93 Difference]: Finished difference Result 8114 states and 10581 transitions. [2018-11-18 17:12:02,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-18 17:12:02,586 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 155 [2018-11-18 17:12:02,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:12:02,599 INFO L225 Difference]: With dead ends: 8114 [2018-11-18 17:12:02,599 INFO L226 Difference]: Without dead ends: 4142 [2018-11-18 17:12:02,608 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 164 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2018-11-18 17:12:02,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4142 states. [2018-11-18 17:12:02,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4142 to 4103. [2018-11-18 17:12:02,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4103 states. [2018-11-18 17:12:02,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4103 states to 4103 states and 4920 transitions. [2018-11-18 17:12:02,688 INFO L78 Accepts]: Start accepts. Automaton has 4103 states and 4920 transitions. Word has length 155 [2018-11-18 17:12:02,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:12:02,688 INFO L480 AbstractCegarLoop]: Abstraction has 4103 states and 4920 transitions. [2018-11-18 17:12:02,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 17:12:02,688 INFO L276 IsEmpty]: Start isEmpty. Operand 4103 states and 4920 transitions. [2018-11-18 17:12:02,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-11-18 17:12:02,694 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:12:02,694 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:12:02,695 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:12:02,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:12:02,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1622905761, now seen corresponding path program 1 times [2018-11-18 17:12:02,695 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:12:02,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:12:02,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:12:02,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:12:02,696 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:12:02,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:12:03,159 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 130 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:12:03,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:12:03,159 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 17:12:03,160 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 186 with the following transitions: [2018-11-18 17:12:03,160 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [185], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [349], [351], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-18 17:12:03,163 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 17:12:03,163 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 17:12:03,265 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 17:12:03,265 INFO L272 AbstractInterpreter]: Visited 93 different actions 180 times. Merged at 5 different actions 5 times. Never widened. Performed 2601 root evaluator evaluations with a maximum evaluation depth of 3. Performed 2601 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-11-18 17:12:03,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:12:03,277 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 17:12:03,432 INFO L227 lantSequenceWeakener]: Weakened 182 states. On average, predicates are now at 81.43% of their original sizes. [2018-11-18 17:12:03,432 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 17:12:03,494 INFO L415 sIntCurrentIteration]: We unified 184 AI predicates to 184 [2018-11-18 17:12:03,494 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 17:12:03,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 17:12:03,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2018-11-18 17:12:03,495 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:12:03,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 17:12:03,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 17:12:03,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-18 17:12:03,496 INFO L87 Difference]: Start difference. First operand 4103 states and 4920 transitions. Second operand 10 states. [2018-11-18 17:12:06,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:12:06,210 INFO L93 Difference]: Finished difference Result 8577 states and 10366 transitions. [2018-11-18 17:12:06,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-18 17:12:06,211 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 185 [2018-11-18 17:12:06,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:12:06,223 INFO L225 Difference]: With dead ends: 8577 [2018-11-18 17:12:06,223 INFO L226 Difference]: Without dead ends: 4616 [2018-11-18 17:12:06,230 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 193 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2018-11-18 17:12:06,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4616 states. [2018-11-18 17:12:06,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4616 to 4567. [2018-11-18 17:12:06,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4567 states. [2018-11-18 17:12:06,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4567 states to 4567 states and 5418 transitions. [2018-11-18 17:12:06,310 INFO L78 Accepts]: Start accepts. Automaton has 4567 states and 5418 transitions. Word has length 185 [2018-11-18 17:12:06,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:12:06,310 INFO L480 AbstractCegarLoop]: Abstraction has 4567 states and 5418 transitions. [2018-11-18 17:12:06,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 17:12:06,311 INFO L276 IsEmpty]: Start isEmpty. Operand 4567 states and 5418 transitions. [2018-11-18 17:12:06,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-11-18 17:12:06,317 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:12:06,317 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:12:06,317 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:12:06,317 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:12:06,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1562858276, now seen corresponding path program 1 times [2018-11-18 17:12:06,317 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:12:06,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:12:06,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:12:06,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:12:06,318 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:12:06,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:12:06,423 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 102 proven. 47 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 17:12:06,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:12:06,423 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 17:12:06,424 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 195 with the following transitions: [2018-11-18 17:12:06,424 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [185], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [349], [351], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-18 17:12:06,427 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 17:12:06,427 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 17:12:06,812 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 17:12:06,813 INFO L272 AbstractInterpreter]: Visited 95 different actions 376 times. Merged at 8 different actions 32 times. Never widened. Performed 5483 root evaluator evaluations with a maximum evaluation depth of 3. Performed 5483 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 7 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-18 17:12:06,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:12:06,822 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 17:12:06,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:12:06,822 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_10613ad5-978d-404b-abd6-b64ba7697fe0/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 17:12:06,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:12:06,828 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 17:12:06,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:12:06,916 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:12:07,007 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 102 proven. 2 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-11-18 17:12:07,007 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 17:12:07,144 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 108 proven. 41 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 17:12:07,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 17:12:07,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2018-11-18 17:12:07,170 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 17:12:07,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 17:12:07,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 17:12:07,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-11-18 17:12:07,171 INFO L87 Difference]: Start difference. First operand 4567 states and 5418 transitions. Second operand 11 states. [2018-11-18 17:12:08,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:12:08,465 INFO L93 Difference]: Finished difference Result 13452 states and 16976 transitions. [2018-11-18 17:12:08,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-18 17:12:08,465 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 194 [2018-11-18 17:12:08,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:12:08,481 INFO L225 Difference]: With dead ends: 13452 [2018-11-18 17:12:08,481 INFO L226 Difference]: Without dead ends: 9060 [2018-11-18 17:12:08,490 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 391 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2018-11-18 17:12:08,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9060 states. [2018-11-18 17:12:08,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9060 to 8749. [2018-11-18 17:12:08,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8749 states. [2018-11-18 17:12:08,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8749 states to 8749 states and 10483 transitions. [2018-11-18 17:12:08,582 INFO L78 Accepts]: Start accepts. Automaton has 8749 states and 10483 transitions. Word has length 194 [2018-11-18 17:12:08,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:12:08,582 INFO L480 AbstractCegarLoop]: Abstraction has 8749 states and 10483 transitions. [2018-11-18 17:12:08,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 17:12:08,582 INFO L276 IsEmpty]: Start isEmpty. Operand 8749 states and 10483 transitions. [2018-11-18 17:12:08,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-11-18 17:12:08,588 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:12:08,588 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:12:08,589 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:12:08,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:12:08,589 INFO L82 PathProgramCache]: Analyzing trace with hash 354852970, now seen corresponding path program 1 times [2018-11-18 17:12:08,589 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:12:08,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:12:08,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:12:08,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:12:08,590 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:12:08,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:12:09,047 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 116 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:12:09,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:12:09,047 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 17:12:09,047 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 204 with the following transitions: [2018-11-18 17:12:09,047 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [173], [174], [178], [182], [185], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [349], [351], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-18 17:12:09,049 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 17:12:09,049 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 17:12:09,174 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 17:12:09,174 INFO L272 AbstractInterpreter]: Visited 94 different actions 274 times. Merged at 7 different actions 14 times. Never widened. Performed 3889 root evaluator evaluations with a maximum evaluation depth of 3. Performed 3889 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 2 different actions. Largest state had 42 variables. [2018-11-18 17:12:09,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:12:09,181 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 17:12:09,345 INFO L227 lantSequenceWeakener]: Weakened 200 states. On average, predicates are now at 82.97% of their original sizes. [2018-11-18 17:12:09,345 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 17:12:09,393 INFO L415 sIntCurrentIteration]: We unified 202 AI predicates to 202 [2018-11-18 17:12:09,393 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 17:12:09,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 17:12:09,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [15] total 22 [2018-11-18 17:12:09,394 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:12:09,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 17:12:09,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 17:12:09,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-18 17:12:09,394 INFO L87 Difference]: Start difference. First operand 8749 states and 10483 transitions. Second operand 9 states. [2018-11-18 17:12:11,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:12:11,104 INFO L93 Difference]: Finished difference Result 17595 states and 21216 transitions. [2018-11-18 17:12:11,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 17:12:11,104 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 203 [2018-11-18 17:12:11,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:12:11,125 INFO L225 Difference]: With dead ends: 17595 [2018-11-18 17:12:11,126 INFO L226 Difference]: Without dead ends: 9452 [2018-11-18 17:12:11,139 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 208 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2018-11-18 17:12:11,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9452 states. [2018-11-18 17:12:11,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9452 to 9445. [2018-11-18 17:12:11,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9445 states. [2018-11-18 17:12:11,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9445 states to 9445 states and 11254 transitions. [2018-11-18 17:12:11,267 INFO L78 Accepts]: Start accepts. Automaton has 9445 states and 11254 transitions. Word has length 203 [2018-11-18 17:12:11,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:12:11,268 INFO L480 AbstractCegarLoop]: Abstraction has 9445 states and 11254 transitions. [2018-11-18 17:12:11,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 17:12:11,268 INFO L276 IsEmpty]: Start isEmpty. Operand 9445 states and 11254 transitions. [2018-11-18 17:12:11,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-11-18 17:12:11,280 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:12:11,280 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:12:11,280 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:12:11,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:12:11,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1863497912, now seen corresponding path program 1 times [2018-11-18 17:12:11,281 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:12:11,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:12:11,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:12:11,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:12:11,282 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:12:11,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:12:11,445 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 200 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:12:11,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:12:11,445 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 17:12:11,446 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 220 with the following transitions: [2018-11-18 17:12:11,446 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [105], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [185], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [349], [351], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-18 17:12:11,448 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 17:12:11,448 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 17:12:11,633 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 17:12:11,634 INFO L272 AbstractInterpreter]: Visited 95 different actions 373 times. Merged at 8 different actions 29 times. Never widened. Performed 5582 root evaluator evaluations with a maximum evaluation depth of 3. Performed 5582 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 6 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-18 17:12:11,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:12:11,641 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 17:12:11,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:12:11,641 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_10613ad5-978d-404b-abd6-b64ba7697fe0/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 17:12:11,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:12:11,654 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 17:12:11,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:12:11,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:12:11,818 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 198 proven. 2 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-18 17:12:11,818 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 17:12:12,100 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 198 proven. 2 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-18 17:12:12,116 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 17:12:12,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2018-11-18 17:12:12,116 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 17:12:12,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 17:12:12,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 17:12:12,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-11-18 17:12:12,117 INFO L87 Difference]: Start difference. First operand 9445 states and 11254 transitions. Second operand 12 states. [2018-11-18 17:12:14,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:12:14,155 INFO L93 Difference]: Finished difference Result 19894 states and 25805 transitions. [2018-11-18 17:12:14,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-18 17:12:14,155 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 219 [2018-11-18 17:12:14,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:12:14,174 INFO L225 Difference]: With dead ends: 19894 [2018-11-18 17:12:14,174 INFO L226 Difference]: Without dead ends: 8905 [2018-11-18 17:12:14,191 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 494 GetRequests, 455 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=330, Invalid=1230, Unknown=0, NotChecked=0, Total=1560 [2018-11-18 17:12:14,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8905 states. [2018-11-18 17:12:14,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8905 to 8267. [2018-11-18 17:12:14,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8267 states. [2018-11-18 17:12:14,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8267 states to 8267 states and 9335 transitions. [2018-11-18 17:12:14,292 INFO L78 Accepts]: Start accepts. Automaton has 8267 states and 9335 transitions. Word has length 219 [2018-11-18 17:12:14,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:12:14,292 INFO L480 AbstractCegarLoop]: Abstraction has 8267 states and 9335 transitions. [2018-11-18 17:12:14,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 17:12:14,292 INFO L276 IsEmpty]: Start isEmpty. Operand 8267 states and 9335 transitions. [2018-11-18 17:12:14,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-11-18 17:12:14,298 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:12:14,298 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:12:14,298 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:12:14,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:12:14,299 INFO L82 PathProgramCache]: Analyzing trace with hash 1349411303, now seen corresponding path program 1 times [2018-11-18 17:12:14,299 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:12:14,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:12:14,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:12:14,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:12:14,300 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:12:14,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:12:14,610 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 142 proven. 91 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 17:12:14,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:12:14,611 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 17:12:14,611 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 224 with the following transitions: [2018-11-18 17:12:14,611 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [46], [49], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [173], [174], [178], [182], [185], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [349], [351], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-18 17:12:14,613 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 17:12:14,613 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 17:12:14,840 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 17:12:14,840 INFO L272 AbstractInterpreter]: Visited 96 different actions 474 times. Merged at 9 different actions 42 times. Widened at 1 different actions 1 times. Performed 6910 root evaluator evaluations with a maximum evaluation depth of 3. Performed 6910 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 10 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-18 17:12:14,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:12:14,845 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 17:12:14,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:12:14,845 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_10613ad5-978d-404b-abd6-b64ba7697fe0/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 17:12:14,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:12:14,851 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 17:12:14,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:12:14,905 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:12:15,001 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 206 proven. 2 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-18 17:12:15,001 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 17:12:15,355 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 206 proven. 2 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-18 17:12:15,379 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 17:12:15,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 5, 5] total 20 [2018-11-18 17:12:15,379 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 17:12:15,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-18 17:12:15,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-18 17:12:15,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2018-11-18 17:12:15,383 INFO L87 Difference]: Start difference. First operand 8267 states and 9335 transitions. Second operand 18 states. [2018-11-18 17:12:18,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:12:18,028 INFO L93 Difference]: Finished difference Result 15017 states and 17033 transitions. [2018-11-18 17:12:18,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-11-18 17:12:18,028 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 223 [2018-11-18 17:12:18,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:12:18,041 INFO L225 Difference]: With dead ends: 15017 [2018-11-18 17:12:18,041 INFO L226 Difference]: Without dead ends: 6473 [2018-11-18 17:12:18,052 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 540 GetRequests, 479 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 998 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=743, Invalid=3163, Unknown=0, NotChecked=0, Total=3906 [2018-11-18 17:12:18,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6473 states. [2018-11-18 17:12:18,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6473 to 6064. [2018-11-18 17:12:18,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6064 states. [2018-11-18 17:12:18,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6064 states to 6064 states and 6604 transitions. [2018-11-18 17:12:18,137 INFO L78 Accepts]: Start accepts. Automaton has 6064 states and 6604 transitions. Word has length 223 [2018-11-18 17:12:18,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:12:18,137 INFO L480 AbstractCegarLoop]: Abstraction has 6064 states and 6604 transitions. [2018-11-18 17:12:18,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-18 17:12:18,138 INFO L276 IsEmpty]: Start isEmpty. Operand 6064 states and 6604 transitions. [2018-11-18 17:12:18,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2018-11-18 17:12:18,144 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:12:18,144 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:12:18,144 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:12:18,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:12:18,145 INFO L82 PathProgramCache]: Analyzing trace with hash 230424467, now seen corresponding path program 1 times [2018-11-18 17:12:18,145 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:12:18,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:12:18,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:12:18,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:12:18,146 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:12:18,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:12:18,246 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 155 proven. 90 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-11-18 17:12:18,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:12:18,247 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 17:12:18,247 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 246 with the following transitions: [2018-11-18 17:12:18,247 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [173], [174], [178], [182], [185], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [349], [351], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-18 17:12:18,249 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 17:12:18,249 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 17:12:18,529 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 17:12:18,529 INFO L272 AbstractInterpreter]: Visited 96 different actions 382 times. Merged at 9 different actions 34 times. Never widened. Performed 5509 root evaluator evaluations with a maximum evaluation depth of 3. Performed 5509 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 10 fixpoints after 2 different actions. Largest state had 42 variables. [2018-11-18 17:12:18,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:12:18,541 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 17:12:18,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:12:18,541 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_10613ad5-978d-404b-abd6-b64ba7697fe0/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 17:12:18,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:12:18,549 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 17:12:18,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:12:18,599 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:12:18,647 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 152 proven. 2 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2018-11-18 17:12:18,647 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 17:12:18,703 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 161 proven. 14 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2018-11-18 17:12:18,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 17:12:18,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2018-11-18 17:12:18,719 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 17:12:18,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 17:12:18,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 17:12:18,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-11-18 17:12:18,720 INFO L87 Difference]: Start difference. First operand 6064 states and 6604 transitions. Second operand 12 states. [2018-11-18 17:12:20,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:12:20,232 INFO L93 Difference]: Finished difference Result 13029 states and 14362 transitions. [2018-11-18 17:12:20,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-18 17:12:20,232 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 245 [2018-11-18 17:12:20,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:12:20,241 INFO L225 Difference]: With dead ends: 13029 [2018-11-18 17:12:20,241 INFO L226 Difference]: Without dead ends: 7109 [2018-11-18 17:12:20,247 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 547 GetRequests, 510 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=324, Invalid=1082, Unknown=0, NotChecked=0, Total=1406 [2018-11-18 17:12:20,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7109 states. [2018-11-18 17:12:20,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7109 to 6059. [2018-11-18 17:12:20,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6059 states. [2018-11-18 17:12:20,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6059 states to 6059 states and 6541 transitions. [2018-11-18 17:12:20,331 INFO L78 Accepts]: Start accepts. Automaton has 6059 states and 6541 transitions. Word has length 245 [2018-11-18 17:12:20,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:12:20,332 INFO L480 AbstractCegarLoop]: Abstraction has 6059 states and 6541 transitions. [2018-11-18 17:12:20,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 17:12:20,332 INFO L276 IsEmpty]: Start isEmpty. Operand 6059 states and 6541 transitions. [2018-11-18 17:12:20,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2018-11-18 17:12:20,338 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:12:20,339 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:12:20,339 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:12:20,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:12:20,339 INFO L82 PathProgramCache]: Analyzing trace with hash 2023257017, now seen corresponding path program 1 times [2018-11-18 17:12:20,339 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:12:20,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:12:20,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:12:20,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:12:20,340 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:12:20,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:12:20,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:12:20,481 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-18 17:12:20,579 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 05:12:20 BoogieIcfgContainer [2018-11-18 17:12:20,579 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 17:12:20,580 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 17:12:20,580 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 17:12:20,580 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 17:12:20,580 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 05:11:53" (3/4) ... [2018-11-18 17:12:20,582 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-18 17:12:20,709 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_10613ad5-978d-404b-abd6-b64ba7697fe0/bin-2019/utaipan/witness.graphml [2018-11-18 17:12:20,709 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 17:12:20,710 INFO L168 Benchmark]: Toolchain (without parser) took 28891.44 ms. Allocated memory was 1.0 GB in the beginning and 2.6 GB in the end (delta: 1.5 GB). Free memory was 950.4 MB in the beginning and 1.4 GB in the end (delta: -458.9 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2018-11-18 17:12:20,711 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 17:12:20,712 INFO L168 Benchmark]: CACSL2BoogieTranslator took 413.86 ms. Allocated memory is still 1.0 GB. Free memory was 950.4 MB in the beginning and 912.8 MB in the end (delta: 37.6 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. [2018-11-18 17:12:20,712 INFO L168 Benchmark]: Boogie Procedure Inliner took 91.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 177.2 MB). Free memory was 912.8 MB in the beginning and 1.2 GB in the end (delta: -257.9 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2018-11-18 17:12:20,712 INFO L168 Benchmark]: Boogie Preprocessor took 49.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. [2018-11-18 17:12:20,712 INFO L168 Benchmark]: RCFGBuilder took 822.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 105.8 MB). Peak memory consumption was 105.8 MB. Max. memory is 11.5 GB. [2018-11-18 17:12:20,713 INFO L168 Benchmark]: TraceAbstraction took 27381.09 ms. Allocated memory was 1.2 GB in the beginning and 2.6 GB in the end (delta: 1.4 GB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -379.2 MB). Peak memory consumption was 980.3 MB. Max. memory is 11.5 GB. [2018-11-18 17:12:20,713 INFO L168 Benchmark]: Witness Printer took 129.22 ms. Allocated memory is still 2.6 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.5 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. [2018-11-18 17:12:20,714 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 413.86 ms. Allocated memory is still 1.0 GB. Free memory was 950.4 MB in the beginning and 912.8 MB in the end (delta: 37.6 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 91.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 177.2 MB). Free memory was 912.8 MB in the beginning and 1.2 GB in the end (delta: -257.9 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 49.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 822.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 105.8 MB). Peak memory consumption was 105.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 27381.09 ms. Allocated memory was 1.2 GB in the beginning and 2.6 GB in the end (delta: 1.4 GB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -379.2 MB). Peak memory consumption was 980.3 MB. Max. memory is 11.5 GB. * Witness Printer took 129.22 ms. Allocated memory is still 2.6 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.5 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 422]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L7] int a= 1; [L8] int d= 4; [L9] int e= 5; [L10] int f= 6; [L11] int c= 3; [L12] int b= 2; [L15] int u = 21; [L16] int v = 22; [L17] int w = 23; [L18] int x = 24; [L19] int y = 25; [L20] int z = 26; [L22] int a17 = 1; [L23] int a7 = 0; [L24] int a20 = 1; [L25] int a8 = 15; [L26] int a12 = 8; [L27] int a16 = 5; [L28] int a21 = 1; VAL [\old(a)=31, \old(a12)=27, \old(a16)=24, \old(a17)=18, \old(a20)=19, \old(a21)=23, \old(a7)=26, \old(a8)=34, \old(b)=20, \old(c)=21, \old(d)=29, \old(e)=17, \old(f)=28, \old(u)=32, \old(v)=16, \old(w)=30, \old(x)=22, \old(y)=33, \old(z)=25, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L580] int output = -1; VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, output=-1, u=21, v=22, w=23, x=24, y=25, z=26] [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, output=-1, u=21, v=22, w=23, x=24, y=25, z=26] [L591] CALL, EXPR calculate_output(input) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L268] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L273] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L292] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L299] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L306] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L312] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L318] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L324] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L329] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L333] COND TRUE ((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15))) [L334] a17 = 0 [L335] a16 = 4 [L336] RET return 21; VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, \result=21, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L591] EXPR calculate_output(input) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, calculate_output(input)=21, d=4, e=5, f=6, input=3, output=-1, u=21, v=22, w=23, x=24, y=25, z=26] [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, output=21, u=21, v=22, w=23, x=24, y=25, z=26] [L591] CALL, EXPR calculate_output(input) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L268] COND TRUE (((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4)) [L269] a20 = 0 [L270] a17 = 1 [L271] a16 = 6 [L272] RET return 21; VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, \result=21, a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L591] EXPR calculate_output(input) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, calculate_output(input)=21, d=4, e=5, f=6, input=4, output=21, u=21, v=22, w=23, x=24, y=25, z=26] [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, output=21, u=21, v=22, w=23, x=24, y=25, z=26] [L591] CALL, EXPR calculate_output(input) VAL [\old(a16)=6, \old(a17)=1, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [\old(a16)=6, \old(a17)=1, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [\old(a16)=6, \old(a17)=1, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [\old(a16)=6, \old(a17)=1, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [\old(a16)=6, \old(a17)=1, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [\old(a16)=6, \old(a17)=1, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND TRUE (((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6)) [L63] a17 = 0 [L64] RET return 26; VAL [\old(a16)=6, \old(a17)=1, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, \result=26, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L591] EXPR calculate_output(input) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, calculate_output(input)=26, d=4, e=5, f=6, input=4, output=21, u=21, v=22, w=23, x=24, y=25, z=26] [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, output=26, u=21, v=22, w=23, x=24, y=25, z=26] [L591] CALL, EXPR calculate_output(input) VAL [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L268] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L273] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=6, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND TRUE (((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8)) [L279] a20 = 1 [L280] a8 = 13 [L281] a16 = 4 [L282] a7 = 0 [L283] a21 = 1 [L284] a17 = 0 [L285] RET return -1; VAL [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=6, \result=-1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] EXPR calculate_output(input) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, calculate_output(input)=-1, d=4, e=5, f=6, input=6, output=26, u=21, v=22, w=23, x=24, y=25, z=26] [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, output=-1, u=21, v=22, w=23, x=24, y=25, z=26] [L591] CALL calculate_output(input) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, \old(input)=5, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, \old(input)=5, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, \old(input)=5, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, \old(input)=5, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, \old(input)=5, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, \old(input)=5, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, \old(input)=5, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, \old(input)=5, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, \old(input)=5, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, \old(input)=5, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, \old(input)=5, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, \old(input)=5, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, \old(input)=5, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, \old(input)=5, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, \old(input)=5, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, \old(input)=5, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, \old(input)=5, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, \old(input)=5, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, \old(input)=5, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, \old(input)=5, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, \old(input)=5, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, \old(input)=5, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, \old(input)=5, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, \old(input)=5, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, \old(input)=5, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, \old(input)=5, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, \old(input)=5, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, \old(input)=5, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, \old(input)=5, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, \old(input)=5, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, \old(input)=5, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, \old(input)=5, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, \old(input)=5, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, \old(input)=5, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, \old(input)=5, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, \old(input)=5, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, \old(input)=5, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, \old(input)=5, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, \old(input)=5, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, \old(input)=5, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, \old(input)=5, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, \old(input)=5, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, \old(input)=5, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, \old(input)=5, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L268] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, \old(input)=5, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L273] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, \old(input)=5, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, \old(input)=5, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, \old(input)=5, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L292] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, \old(input)=5, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L299] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, \old(input)=5, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L306] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, \old(input)=5, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L312] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, \old(input)=5, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, \old(input)=5, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L318] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, \old(input)=5, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L324] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, \old(input)=5, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L329] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, \old(input)=5, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L333] COND FALSE !(((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, \old(input)=5, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L337] COND FALSE !((!(a21==1)&&((a20==1)&&(((a12==8)&&((a8==13)&&((((a16==5)&&!(a17==1))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==2))))&&(a7==1))))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, \old(input)=5, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L345] COND FALSE !(((a7==1)&&((a12==8)&&((((a20==1)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||((a16==4)&&!(a17==1))))&&(input==4)))&&(a8==13))&&!(a21==1))))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, \old(input)=5, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L353] COND FALSE !(((a21==1)&&((((!(a7==1)&&((a8==15)&&(!(a20==1)&&(input==4))))&&(a17==1))&&(a16==5))&&(a12==8)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, \old(input)=5, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L355] COND FALSE !((((!(a7==1)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(a16==5))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, \old(input)=5, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L361] COND FALSE !(((((!(a17==1)&&(!(a20==1)&&((a8==15)&&((input==1)&&(a16==5)))))&&(a12==8))&&(a21==1))&&!(a7==1))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, \old(input)=5, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L363] COND FALSE !(((((a21==1)&&((a8==15)&&(((a16==5)&&((a12==8)&&(input==1)))&&(a17==1))))&&!(a7==1))&&!(a20==1))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, \old(input)=5, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L365] COND FALSE !(((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, \old(input)=5, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L372] COND FALSE !((((!(a7==1)&&((a21==1)&&((((input==6)&&(a20==1))&&(a8==15))&&!(a17==1))))&&(a12==8))&&(a16==4))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, \old(input)=5, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L377] COND FALSE !(((((a20==1)&&(((!(a21==1)&&((a7==1)&&(input==1)))&&(a8==13))&&(a17==1)))&&(a12==8))&&(a16==5))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, \old(input)=5, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L382] COND FALSE !(((a12==8)&&((input==5)&&((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==15))&&(a16==6))&&(a21==1))||(!(a21==1)&&((a16==4)&&(((a20==1)&&((a7==1)&&(a17==1)))&&(a8==13)))))))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, \old(input)=5, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L391] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, \old(input)=5, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L394] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, \old(input)=5, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L397] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==4))&&(a21==1))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, \old(input)=5, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L400] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==6))&&(a21==1))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, \old(input)=5, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L403] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, \old(input)=5, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L406] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==5))&&(a21==1))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, \old(input)=5, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L409] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, \old(input)=5, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L412] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, \old(input)=5, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L415] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, \old(input)=5, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L418] COND FALSE !(((((((!(a17==1)&&(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, \old(input)=5, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L421] COND TRUE ((((((!(a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1)) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, \old(input)=5, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L422] __VERIFIER_error() VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=13, \old(input)=5, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 208 locations, 1 error locations. UNSAFE Result, 27.3s OverallTime, 13 OverallIterations, 5 TraceHistogramMax, 19.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1567 SDtfs, 16784 SDslu, 2647 SDs, 0 SdLazy, 17804 SolverSat, 3012 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.7s Time, PredicateUnifierStatistics: 6 DeclaredPredicates, 2594 GetRequests, 2364 SyntacticMatches, 9 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1859 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9445occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.8s AbstIntTime, 7 AbstIntIterations, 3 AbstIntStrong, 0.9974060077183742 AbsIntWeakeningRatio, 0.20555555555555555 AbsIntAvgWeakeningVarsNumRemoved, 27.874074074074073 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 12 MinimizatonAttempts, 2566 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 3113 NumberOfCodeBlocks, 3113 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 3701 ConstructedInterpolants, 0 QuantifiedInterpolants, 4573729 SizeOfPredicates, 12 NumberOfNonLiveVariables, 2317 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 20 InterpolantComputations, 5 PerfectInterpolantSequences, 2867/3255 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...