./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem10_label28_false-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_0502e38b-a7ae-4ae2-ae2c-e693750f9cca/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_0502e38b-a7ae-4ae2-ae2c-e693750f9cca/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_0502e38b-a7ae-4ae2-ae2c-e693750f9cca/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_0502e38b-a7ae-4ae2-ae2c-e693750f9cca/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem10_label28_false-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_0502e38b-a7ae-4ae2-ae2c-e693750f9cca/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_0502e38b-a7ae-4ae2-ae2c-e693750f9cca/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 842b1d955d5d034fb473369e35dc57ba15dfee95 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-635dfa2 [2018-12-09 13:17:12,077 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 13:17:12,078 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 13:17:12,084 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 13:17:12,084 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 13:17:12,085 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 13:17:12,085 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 13:17:12,086 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 13:17:12,087 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 13:17:12,088 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 13:17:12,088 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 13:17:12,088 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 13:17:12,089 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 13:17:12,089 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 13:17:12,090 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 13:17:12,090 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 13:17:12,091 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 13:17:12,092 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 13:17:12,093 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 13:17:12,094 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 13:17:12,095 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 13:17:12,095 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 13:17:12,096 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 13:17:12,097 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 13:17:12,097 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 13:17:12,097 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 13:17:12,098 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 13:17:12,098 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 13:17:12,099 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 13:17:12,099 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 13:17:12,099 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 13:17:12,100 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 13:17:12,100 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 13:17:12,100 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 13:17:12,100 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 13:17:12,101 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 13:17:12,101 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_0502e38b-a7ae-4ae2-ae2c-e693750f9cca/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 13:17:12,108 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 13:17:12,109 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 13:17:12,109 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 13:17:12,109 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 13:17:12,109 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 13:17:12,110 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 13:17:12,110 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 13:17:12,110 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 13:17:12,110 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 13:17:12,110 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 13:17:12,110 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 13:17:12,110 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 13:17:12,110 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 13:17:12,111 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 13:17:12,111 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 13:17:12,111 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 13:17:12,111 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 13:17:12,111 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 13:17:12,111 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 13:17:12,112 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 13:17:12,112 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 13:17:12,112 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 13:17:12,112 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 13:17:12,112 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 13:17:12,112 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 13:17:12,112 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 13:17:12,112 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 13:17:12,112 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 13:17:12,112 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 13:17:12,112 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 13:17:12,113 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 13:17:12,113 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 13:17:12,113 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 13:17:12,113 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 13:17:12,113 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 13:17:12,113 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 13:17:12,113 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_0502e38b-a7ae-4ae2-ae2c-e693750f9cca/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 -> 842b1d955d5d034fb473369e35dc57ba15dfee95 [2018-12-09 13:17:12,130 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 13:17:12,137 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 13:17:12,139 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 13:17:12,140 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 13:17:12,140 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 13:17:12,141 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_0502e38b-a7ae-4ae2-ae2c-e693750f9cca/bin-2019/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem10_label28_false-unreach-call.c [2018-12-09 13:17:12,175 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0502e38b-a7ae-4ae2-ae2c-e693750f9cca/bin-2019/utaipan/data/37cf40a74/322060d515a848989e09a0780c80becc/FLAG265f086e4 [2018-12-09 13:17:12,640 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 13:17:12,640 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_0502e38b-a7ae-4ae2-ae2c-e693750f9cca/sv-benchmarks/c/eca-rers2012/Problem10_label28_false-unreach-call.c [2018-12-09 13:17:12,648 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0502e38b-a7ae-4ae2-ae2c-e693750f9cca/bin-2019/utaipan/data/37cf40a74/322060d515a848989e09a0780c80becc/FLAG265f086e4 [2018-12-09 13:17:12,660 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_0502e38b-a7ae-4ae2-ae2c-e693750f9cca/bin-2019/utaipan/data/37cf40a74/322060d515a848989e09a0780c80becc [2018-12-09 13:17:12,662 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 13:17:12,663 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 13:17:12,664 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 13:17:12,664 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 13:17:12,667 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 13:17:12,668 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 01:17:12" (1/1) ... [2018-12-09 13:17:12,670 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56acabfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:17:12, skipping insertion in model container [2018-12-09 13:17:12,670 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 01:17:12" (1/1) ... [2018-12-09 13:17:12,676 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 13:17:12,705 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 13:17:12,896 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 13:17:12,899 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 13:17:12,997 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 13:17:13,007 INFO L195 MainTranslator]: Completed translation [2018-12-09 13:17:13,007 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:17:13 WrapperNode [2018-12-09 13:17:13,007 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 13:17:13,008 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 13:17:13,008 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 13:17:13,008 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 13:17:13,013 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:17:13" (1/1) ... [2018-12-09 13:17:13,022 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:17:13" (1/1) ... [2018-12-09 13:17:13,027 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 13:17:13,027 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 13:17:13,027 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 13:17:13,027 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 13:17:13,033 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:17:13" (1/1) ... [2018-12-09 13:17:13,034 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:17:13" (1/1) ... [2018-12-09 13:17:13,036 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:17:13" (1/1) ... [2018-12-09 13:17:13,036 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:17:13" (1/1) ... [2018-12-09 13:17:13,051 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:17:13" (1/1) ... [2018-12-09 13:17:13,058 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:17:13" (1/1) ... [2018-12-09 13:17:13,061 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:17:13" (1/1) ... [2018-12-09 13:17:13,065 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 13:17:13,065 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 13:17:13,065 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 13:17:13,065 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 13:17:13,066 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:17:13" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0502e38b-a7ae-4ae2-ae2c-e693750f9cca/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-12-09 13:17:13,105 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 13:17:13,105 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 13:17:13,106 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-12-09 13:17:13,106 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-12-09 13:17:13,106 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 13:17:13,106 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 13:17:13,106 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 13:17:13,106 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 13:17:13,706 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 13:17:13,706 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-09 13:17:13,706 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:17:13 BoogieIcfgContainer [2018-12-09 13:17:13,707 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 13:17:13,707 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 13:17:13,707 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 13:17:13,710 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 13:17:13,710 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 01:17:12" (1/3) ... [2018-12-09 13:17:13,710 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@322ad09d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 01:17:13, skipping insertion in model container [2018-12-09 13:17:13,711 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:17:13" (2/3) ... [2018-12-09 13:17:13,711 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@322ad09d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 01:17:13, skipping insertion in model container [2018-12-09 13:17:13,711 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:17:13" (3/3) ... [2018-12-09 13:17:13,712 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label28_false-unreach-call.c [2018-12-09 13:17:13,720 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 13:17:13,727 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-09 13:17:13,740 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-09 13:17:13,768 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 13:17:13,768 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 13:17:13,768 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 13:17:13,769 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 13:17:13,769 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 13:17:13,769 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 13:17:13,769 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 13:17:13,769 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 13:17:13,786 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states. [2018-12-09 13:17:13,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-09 13:17:13,791 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:17:13,791 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 13:17:13,793 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 13:17:13,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:17:13,798 INFO L82 PathProgramCache]: Analyzing trace with hash 7815070, now seen corresponding path program 1 times [2018-12-09 13:17:13,799 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 13:17:13,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:17:13,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:17:13,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:17:13,829 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 13:17:13,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:17:13,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 13:17:13,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 13:17:13,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 13:17:13,946 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 13:17:13,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 13:17:13,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 13:17:13,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 13:17:13,959 INFO L87 Difference]: Start difference. First operand 215 states. Second operand 3 states. [2018-12-09 13:17:14,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:17:14,445 INFO L93 Difference]: Finished difference Result 571 states and 989 transitions. [2018-12-09 13:17:14,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 13:17:14,447 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-12-09 13:17:14,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:17:14,457 INFO L225 Difference]: With dead ends: 571 [2018-12-09 13:17:14,457 INFO L226 Difference]: Without dead ends: 294 [2018-12-09 13:17:14,461 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-12-09 13:17:14,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-12-09 13:17:14,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2018-12-09 13:17:14,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-12-09 13:17:14,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 446 transitions. [2018-12-09 13:17:14,506 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 446 transitions. Word has length 17 [2018-12-09 13:17:14,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:17:14,507 INFO L480 AbstractCegarLoop]: Abstraction has 294 states and 446 transitions. [2018-12-09 13:17:14,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 13:17:14,507 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 446 transitions. [2018-12-09 13:17:14,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-09 13:17:14,509 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:17:14,509 INFO L402 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] [2018-12-09 13:17:14,510 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 13:17:14,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:17:14,510 INFO L82 PathProgramCache]: Analyzing trace with hash -640492430, now seen corresponding path program 1 times [2018-12-09 13:17:14,510 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 13:17:14,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:17:14,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:17:14,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:17:14,511 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 13:17:14,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:17:14,618 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 13:17:14,618 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 13:17:14,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 13:17:14,618 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 13:17:14,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 13:17:14,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 13:17:14,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 13:17:14,620 INFO L87 Difference]: Start difference. First operand 294 states and 446 transitions. Second operand 5 states. [2018-12-09 13:17:15,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:17:15,256 INFO L93 Difference]: Finished difference Result 890 states and 1368 transitions. [2018-12-09 13:17:15,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 13:17:15,256 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2018-12-09 13:17:15,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:17:15,259 INFO L225 Difference]: With dead ends: 890 [2018-12-09 13:17:15,259 INFO L226 Difference]: Without dead ends: 602 [2018-12-09 13:17:15,260 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 13:17:15,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2018-12-09 13:17:15,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 592. [2018-12-09 13:17:15,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2018-12-09 13:17:15,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 867 transitions. [2018-12-09 13:17:15,279 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 867 transitions. Word has length 99 [2018-12-09 13:17:15,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:17:15,279 INFO L480 AbstractCegarLoop]: Abstraction has 592 states and 867 transitions. [2018-12-09 13:17:15,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 13:17:15,279 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 867 transitions. [2018-12-09 13:17:15,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-09 13:17:15,281 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:17:15,281 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 13:17:15,281 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 13:17:15,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:17:15,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1663927406, now seen corresponding path program 1 times [2018-12-09 13:17:15,282 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 13:17:15,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:17:15,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:17:15,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:17:15,283 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 13:17:15,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:17:15,375 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 13:17:15,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 13:17:15,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 13:17:15,375 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 13:17:15,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 13:17:15,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 13:17:15,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 13:17:15,376 INFO L87 Difference]: Start difference. First operand 592 states and 867 transitions. Second operand 6 states. [2018-12-09 13:17:15,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:17:15,768 INFO L93 Difference]: Finished difference Result 1490 states and 2245 transitions. [2018-12-09 13:17:15,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 13:17:15,769 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 115 [2018-12-09 13:17:15,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:17:15,772 INFO L225 Difference]: With dead ends: 1490 [2018-12-09 13:17:15,772 INFO L226 Difference]: Without dead ends: 904 [2018-12-09 13:17:15,773 INFO L631 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-12-09 13:17:15,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states. [2018-12-09 13:17:15,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 890. [2018-12-09 13:17:15,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 890 states. [2018-12-09 13:17:15,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 1300 transitions. [2018-12-09 13:17:15,790 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 1300 transitions. Word has length 115 [2018-12-09 13:17:15,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:17:15,790 INFO L480 AbstractCegarLoop]: Abstraction has 890 states and 1300 transitions. [2018-12-09 13:17:15,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 13:17:15,791 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1300 transitions. [2018-12-09 13:17:15,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-12-09 13:17:15,792 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:17:15,792 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-09 13:17:15,792 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 13:17:15,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:17:15,793 INFO L82 PathProgramCache]: Analyzing trace with hash -520148414, now seen corresponding path program 1 times [2018-12-09 13:17:15,793 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 13:17:15,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:17:15,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:17:15,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:17:15,794 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 13:17:15,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:17:15,884 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 13:17:15,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 13:17:15,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 13:17:15,884 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 13:17:15,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 13:17:15,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 13:17:15,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 13:17:15,885 INFO L87 Difference]: Start difference. First operand 890 states and 1300 transitions. Second operand 6 states. [2018-12-09 13:17:16,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:17:16,344 INFO L93 Difference]: Finished difference Result 2104 states and 3183 transitions. [2018-12-09 13:17:16,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 13:17:16,344 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 139 [2018-12-09 13:17:16,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:17:16,348 INFO L225 Difference]: With dead ends: 2104 [2018-12-09 13:17:16,348 INFO L226 Difference]: Without dead ends: 1220 [2018-12-09 13:17:16,349 INFO L631 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-12-09 13:17:16,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1220 states. [2018-12-09 13:17:16,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1220 to 1192. [2018-12-09 13:17:16,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1192 states. [2018-12-09 13:17:16,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1192 states to 1192 states and 1616 transitions. [2018-12-09 13:17:16,368 INFO L78 Accepts]: Start accepts. Automaton has 1192 states and 1616 transitions. Word has length 139 [2018-12-09 13:17:16,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:17:16,369 INFO L480 AbstractCegarLoop]: Abstraction has 1192 states and 1616 transitions. [2018-12-09 13:17:16,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 13:17:16,369 INFO L276 IsEmpty]: Start isEmpty. Operand 1192 states and 1616 transitions. [2018-12-09 13:17:16,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-12-09 13:17:16,371 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:17:16,371 INFO L402 BasicCegarLoop]: trace histogram [3, 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, 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] [2018-12-09 13:17:16,371 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 13:17:16,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:17:16,372 INFO L82 PathProgramCache]: Analyzing trace with hash 542580725, now seen corresponding path program 1 times [2018-12-09 13:17:16,372 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 13:17:16,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:17:16,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:17:16,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:17:16,373 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 13:17:16,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:17:16,614 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 97 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 13:17:16,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 13:17:16,614 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 13:17:16,615 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 179 with the following transitions: [2018-12-09 13:17:16,616 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [45], [47], [50], [58], [66], [74], [82], [90], [98], [106], [114], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [543], [546], [792], [796], [805], [809], [811], [816], [817], [818], [820], [821] [2018-12-09 13:17:16,640 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 13:17:16,641 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 13:17:16,952 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 13:17:16,953 INFO L272 AbstractInterpreter]: Visited 91 different actions 179 times. Merged at 6 different actions 8 times. Never widened. Performed 1693 root evaluator evaluations with a maximum evaluation depth of 16. Performed 1693 inverse root evaluator evaluations with a maximum inverse evaluation depth of 16. Found 2 fixpoints after 2 different actions. Largest state had 24 variables. [2018-12-09 13:17:16,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:17:16,963 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 13:17:16,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 13:17:16,963 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0502e38b-a7ae-4ae2-ae2c-e693750f9cca/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-12-09 13:17:16,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:17:16,970 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 13:17:17,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:17:17,019 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 13:17:17,085 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 97 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 13:17:17,085 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 13:17:17,173 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 97 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 13:17:17,198 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 13:17:17,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5, 5] total 17 [2018-12-09 13:17:17,199 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 13:17:17,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-09 13:17:17,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-09 13:17:17,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2018-12-09 13:17:17,200 INFO L87 Difference]: Start difference. First operand 1192 states and 1616 transitions. Second operand 15 states. [2018-12-09 13:17:19,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:17:19,514 INFO L93 Difference]: Finished difference Result 3369 states and 4995 transitions. [2018-12-09 13:17:19,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-09 13:17:19,514 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 178 [2018-12-09 13:17:19,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:17:19,520 INFO L225 Difference]: With dead ends: 3369 [2018-12-09 13:17:19,521 INFO L226 Difference]: Without dead ends: 2013 [2018-12-09 13:17:19,523 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 366 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=517, Invalid=1553, Unknown=0, NotChecked=0, Total=2070 [2018-12-09 13:17:19,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2013 states. [2018-12-09 13:17:19,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2013 to 1647. [2018-12-09 13:17:19,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1647 states. [2018-12-09 13:17:19,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1647 states to 1647 states and 2140 transitions. [2018-12-09 13:17:19,562 INFO L78 Accepts]: Start accepts. Automaton has 1647 states and 2140 transitions. Word has length 178 [2018-12-09 13:17:19,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:17:19,563 INFO L480 AbstractCegarLoop]: Abstraction has 1647 states and 2140 transitions. [2018-12-09 13:17:19,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-09 13:17:19,563 INFO L276 IsEmpty]: Start isEmpty. Operand 1647 states and 2140 transitions. [2018-12-09 13:17:19,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-12-09 13:17:19,565 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:17:19,565 INFO L402 BasicCegarLoop]: trace histogram [3, 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, 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] [2018-12-09 13:17:19,566 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 13:17:19,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:17:19,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1276300145, now seen corresponding path program 1 times [2018-12-09 13:17:19,566 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 13:17:19,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:17:19,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:17:19,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:17:19,567 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 13:17:19,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:17:19,641 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 20 proven. 73 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-09 13:17:19,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 13:17:19,641 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 13:17:19,642 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 193 with the following transitions: [2018-12-09 13:17:19,642 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [45], [47], [50], [58], [66], [74], [82], [90], [98], [106], [114], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [526], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [610], [792], [796], [805], [809], [811], [816], [817], [818], [820], [821] [2018-12-09 13:17:19,646 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 13:17:19,646 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 13:17:19,797 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 13:17:19,797 INFO L272 AbstractInterpreter]: Visited 103 different actions 103 times. Never merged. Never widened. Performed 962 root evaluator evaluations with a maximum evaluation depth of 14. Performed 962 inverse root evaluator evaluations with a maximum inverse evaluation depth of 14. Never found a fixpoint. Largest state had 24 variables. [2018-12-09 13:17:19,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:17:19,802 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 13:17:20,070 INFO L227 lantSequenceWeakener]: Weakened 183 states. On average, predicates are now at 72.61% of their original sizes. [2018-12-09 13:17:20,070 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 13:17:20,088 INFO L418 sIntCurrentIteration]: We unified 191 AI predicates to 191 [2018-12-09 13:17:20,088 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 13:17:20,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 13:17:20,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2018-12-09 13:17:20,089 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 13:17:20,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 13:17:20,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 13:17:20,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 13:17:20,090 INFO L87 Difference]: Start difference. First operand 1647 states and 2140 transitions. Second operand 6 states. [2018-12-09 13:17:23,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:17:23,260 INFO L93 Difference]: Finished difference Result 3283 states and 4249 transitions. [2018-12-09 13:17:23,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 13:17:23,260 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 192 [2018-12-09 13:17:23,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:17:23,265 INFO L225 Difference]: With dead ends: 3283 [2018-12-09 13:17:23,265 INFO L226 Difference]: Without dead ends: 1787 [2018-12-09 13:17:23,268 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 192 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-09 13:17:23,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1787 states. [2018-12-09 13:17:23,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1787 to 1786. [2018-12-09 13:17:23,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1786 states. [2018-12-09 13:17:23,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1786 states to 1786 states and 2279 transitions. [2018-12-09 13:17:23,299 INFO L78 Accepts]: Start accepts. Automaton has 1786 states and 2279 transitions. Word has length 192 [2018-12-09 13:17:23,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:17:23,300 INFO L480 AbstractCegarLoop]: Abstraction has 1786 states and 2279 transitions. [2018-12-09 13:17:23,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 13:17:23,300 INFO L276 IsEmpty]: Start isEmpty. Operand 1786 states and 2279 transitions. [2018-12-09 13:17:23,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-12-09 13:17:23,302 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:17:23,302 INFO L402 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-09 13:17:23,303 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 13:17:23,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:17:23,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1435042187, now seen corresponding path program 1 times [2018-12-09 13:17:23,303 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 13:17:23,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:17:23,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:17:23,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:17:23,304 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 13:17:23,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:17:23,498 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 95 proven. 144 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 13:17:23,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 13:17:23,499 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 13:17:23,499 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 263 with the following transitions: [2018-12-09 13:17:23,499 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [45], [47], [50], [58], [66], [74], [82], [90], [98], [106], [114], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [526], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [610], [792], [796], [805], [809], [811], [816], [817], [818], [820], [821] [2018-12-09 13:17:23,501 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 13:17:23,501 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 13:17:23,764 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 13:17:23,765 INFO L272 AbstractInterpreter]: Visited 108 different actions 526 times. Merged at 7 different actions 30 times. Widened at 1 different actions 1 times. Performed 5339 root evaluator evaluations with a maximum evaluation depth of 14. Performed 5339 inverse root evaluator evaluations with a maximum inverse evaluation depth of 14. Found 7 fixpoints after 2 different actions. Largest state had 24 variables. [2018-12-09 13:17:23,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:17:23,766 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 13:17:23,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 13:17:23,767 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0502e38b-a7ae-4ae2-ae2c-e693750f9cca/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-12-09 13:17:23,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:17:23,773 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 13:17:23,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:17:23,819 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 13:17:23,881 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 234 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-09 13:17:23,881 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 13:17:23,994 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 102 proven. 77 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-12-09 13:17:24,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 13:17:24,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 13 [2018-12-09 13:17:24,009 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 13:17:24,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 13:17:24,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 13:17:24,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-12-09 13:17:24,010 INFO L87 Difference]: Start difference. First operand 1786 states and 2279 transitions. Second operand 12 states. [2018-12-09 13:17:25,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:17:25,105 INFO L93 Difference]: Finished difference Result 4045 states and 5400 transitions. [2018-12-09 13:17:25,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-09 13:17:25,106 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 262 [2018-12-09 13:17:25,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:17:25,114 INFO L225 Difference]: With dead ends: 4045 [2018-12-09 13:17:25,114 INFO L226 Difference]: Without dead ends: 2549 [2018-12-09 13:17:25,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 558 GetRequests, 532 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=169, Invalid=431, Unknown=0, NotChecked=0, Total=600 [2018-12-09 13:17:25,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2549 states. [2018-12-09 13:17:25,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2549 to 1796. [2018-12-09 13:17:25,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1796 states. [2018-12-09 13:17:25,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1796 states to 1796 states and 2101 transitions. [2018-12-09 13:17:25,156 INFO L78 Accepts]: Start accepts. Automaton has 1796 states and 2101 transitions. Word has length 262 [2018-12-09 13:17:25,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:17:25,157 INFO L480 AbstractCegarLoop]: Abstraction has 1796 states and 2101 transitions. [2018-12-09 13:17:25,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 13:17:25,157 INFO L276 IsEmpty]: Start isEmpty. Operand 1796 states and 2101 transitions. [2018-12-09 13:17:25,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2018-12-09 13:17:25,160 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:17:25,160 INFO L402 BasicCegarLoop]: trace histogram [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, 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, 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] [2018-12-09 13:17:25,160 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 13:17:25,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:17:25,160 INFO L82 PathProgramCache]: Analyzing trace with hash 332571206, now seen corresponding path program 1 times [2018-12-09 13:17:25,161 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 13:17:25,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:17:25,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:17:25,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:17:25,161 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 13:17:25,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:17:25,402 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 35 proven. 240 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-09 13:17:25,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 13:17:25,402 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 13:17:25,402 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 308 with the following transitions: [2018-12-09 13:17:25,403 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [45], [47], [50], [58], [66], [74], [82], [90], [98], [106], [114], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [526], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [610], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [678], [792], [796], [805], [809], [811], [816], [817], [818], [820], [821] [2018-12-09 13:17:25,405 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 13:17:25,405 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 13:17:25,656 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 13:17:25,656 INFO L272 AbstractInterpreter]: Visited 125 different actions 371 times. Merged at 7 different actions 18 times. Never widened. Performed 3904 root evaluator evaluations with a maximum evaluation depth of 14. Performed 3904 inverse root evaluator evaluations with a maximum inverse evaluation depth of 14. Found 5 fixpoints after 2 different actions. Largest state had 24 variables. [2018-12-09 13:17:25,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:17:25,658 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 13:17:25,658 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 13:17:25,658 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0502e38b-a7ae-4ae2-ae2c-e693750f9cca/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-12-09 13:17:25,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:17:25,678 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 13:17:25,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:17:25,721 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 13:17:37,894 WARN L180 SmtUtils]: Spent 12.07 s on a formula simplification. DAG size of input: 179 DAG size of output: 50 [2018-12-09 13:17:38,007 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 269 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-09 13:17:38,007 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 13:17:38,289 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:17:38,393 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 304 [2018-12-09 13:17:59,991 WARN L177 XnfTransformerHelper]: Simplifying conjuction of 24738 disjunctions. This might take some time... [2018-12-09 13:18:00,170 INFO L193 XnfTransformerHelper]: Simplified to conjuction of 22 disjunctions. [2018-12-09 13:18:00,311 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:18:00,312 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:18:00,315 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:18:00,318 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:18:00,321 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:18:00,324 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:18:00,327 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:18:00,329 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:18:00,332 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:18:00,335 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:18:00,338 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:18:00,341 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:18:00,344 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:18:00,347 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:18:00,349 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:18:00,351 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:18:00,353 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:18:00,356 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:18:00,359 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:18:00,362 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:18:00,365 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:18:00,368 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:18:00,370 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:18:00,373 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:18:00,376 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:18:00,378 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:18:00,380 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:18:00,382 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:18:00,384 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:18:00,385 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:18:00,388 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:18:00,391 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:18:00,393 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:18:00,396 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:18:00,399 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:18:00,402 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:18:00,404 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:18:00,407 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:18:00,410 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:18:00,413 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:18:00,415 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:18:00,418 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:18:00,420 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:18:00,421 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:18:00,423 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:18:00,425 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:18:00,427 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:18:00,428 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:18:00,430 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:18:00,432 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:18:00,433 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:18:00,435 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:18:00,437 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:18:00,438 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:18:00,440 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:18:00,442 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:18:00,443 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:18:00,445 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:18:00,447 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:18:00,448 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:18:00,450 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:18:00,452 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:18:00,453 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:18:00,455 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:18:00,456 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:18:00,458 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:18:00,460 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:18:00,461 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:18:00,463 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:18:00,464 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:18:00,466 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:18:00,468 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:18:00,469 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:18:00,471 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:18:00,473 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:18:00,474 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:18:00,476 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:18:00,478 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:18:00,479 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:18:00,481 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:18:00,482 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:18:00,484 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:18:00,486 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:18:00,487 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:18:00,489 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:18:00,491 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:18:00,492 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:18:00,494 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:18:00,495 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:18:00,497 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:18:00,499 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:18:00,500 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:18:00,502 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:18:00,503 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:18:00,505 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:18:00,507 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:18:00,508 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:18:00,510 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:18:00,512 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:18:00,513 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:18:00,515 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:18:00,516 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:18:00,518 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:18:00,520 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:18:00,521 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:18:00,523 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:18:00,524 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:18:00,526 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-09 13:18:01,072 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 35 proven. 243 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-09 13:18:01,087 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 13:18:01,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 21 [2018-12-09 13:18:01,087 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 13:18:01,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-09 13:18:01,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-09 13:18:01,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2018-12-09 13:18:01,088 INFO L87 Difference]: Start difference. First operand 1796 states and 2101 transitions. Second operand 16 states. [2018-12-09 13:18:11,960 WARN L180 SmtUtils]: Spent 6.07 s on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2018-12-09 13:18:19,006 WARN L180 SmtUtils]: Spent 611.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 30 [2018-12-09 13:18:27,147 WARN L180 SmtUtils]: Spent 442.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 35 [2018-12-09 13:18:27,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:18:27,246 INFO L93 Difference]: Finished difference Result 5520 states and 7397 transitions. [2018-12-09 13:18:27,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-09 13:18:27,247 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 307 [2018-12-09 13:18:27,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:18:27,263 INFO L225 Difference]: With dead ends: 5520 [2018-12-09 13:18:27,264 INFO L226 Difference]: Without dead ends: 3873 [2018-12-09 13:18:27,269 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 688 GetRequests, 628 SyntacticMatches, 4 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 740 ImplicationChecksByTransitivity, 20.5s TimeCoverageRelationStatistics Valid=716, Invalid=2590, Unknown=0, NotChecked=0, Total=3306 [2018-12-09 13:18:27,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3873 states. [2018-12-09 13:18:27,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3873 to 3278. [2018-12-09 13:18:27,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3278 states. [2018-12-09 13:18:27,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3278 states to 3278 states and 3860 transitions. [2018-12-09 13:18:27,338 INFO L78 Accepts]: Start accepts. Automaton has 3278 states and 3860 transitions. Word has length 307 [2018-12-09 13:18:27,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:18:27,338 INFO L480 AbstractCegarLoop]: Abstraction has 3278 states and 3860 transitions. [2018-12-09 13:18:27,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-09 13:18:27,338 INFO L276 IsEmpty]: Start isEmpty. Operand 3278 states and 3860 transitions. [2018-12-09 13:18:27,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2018-12-09 13:18:27,342 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:18:27,342 INFO L402 BasicCegarLoop]: trace histogram [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, 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, 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] [2018-12-09 13:18:27,342 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 13:18:27,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:18:27,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1830285813, now seen corresponding path program 1 times [2018-12-09 13:18:27,342 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 13:18:27,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:18:27,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:18:27,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:18:27,343 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 13:18:27,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:18:27,432 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2018-12-09 13:18:27,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 13:18:27,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 13:18:27,433 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 13:18:27,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 13:18:27,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 13:18:27,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 13:18:27,433 INFO L87 Difference]: Start difference. First operand 3278 states and 3860 transitions. Second operand 4 states. [2018-12-09 13:18:27,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:18:27,959 INFO L93 Difference]: Finished difference Result 6981 states and 8275 transitions. [2018-12-09 13:18:27,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 13:18:27,960 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 326 [2018-12-09 13:18:27,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:18:27,965 INFO L225 Difference]: With dead ends: 6981 [2018-12-09 13:18:27,965 INFO L226 Difference]: Without dead ends: 3852 [2018-12-09 13:18:27,968 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 13:18:27,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3852 states. [2018-12-09 13:18:28,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3852 to 2990. [2018-12-09 13:18:28,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2990 states. [2018-12-09 13:18:28,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2990 states to 2990 states and 3528 transitions. [2018-12-09 13:18:28,012 INFO L78 Accepts]: Start accepts. Automaton has 2990 states and 3528 transitions. Word has length 326 [2018-12-09 13:18:28,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:18:28,012 INFO L480 AbstractCegarLoop]: Abstraction has 2990 states and 3528 transitions. [2018-12-09 13:18:28,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 13:18:28,012 INFO L276 IsEmpty]: Start isEmpty. Operand 2990 states and 3528 transitions. [2018-12-09 13:18:28,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2018-12-09 13:18:28,016 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:18:28,017 INFO L402 BasicCegarLoop]: trace histogram [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, 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, 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] [2018-12-09 13:18:28,017 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 13:18:28,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:18:28,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1654194082, now seen corresponding path program 1 times [2018-12-09 13:18:28,017 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 13:18:28,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:18:28,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:18:28,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:18:28,018 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 13:18:28,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 13:18:28,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 13:18:28,112 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 13:18:28,183 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 01:18:28 BoogieIcfgContainer [2018-12-09 13:18:28,183 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 13:18:28,183 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 13:18:28,183 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 13:18:28,184 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 13:18:28,184 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:17:13" (3/4) ... [2018-12-09 13:18:28,185 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 13:18:28,271 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_0502e38b-a7ae-4ae2-ae2c-e693750f9cca/bin-2019/utaipan/witness.graphml [2018-12-09 13:18:28,272 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 13:18:28,272 INFO L168 Benchmark]: Toolchain (without parser) took 75609.61 ms. Allocated memory was 1.0 GB in the beginning and 5.8 GB in the end (delta: 4.8 GB). Free memory was 952.4 MB in the beginning and 2.6 GB in the end (delta: -1.7 GB). Peak memory consumption was 3.1 GB. Max. memory is 11.5 GB. [2018-12-09 13:18:28,273 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 13:18:28,273 INFO L168 Benchmark]: CACSL2BoogieTranslator took 343.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -157.7 MB). Peak memory consumption was 37.8 MB. Max. memory is 11.5 GB. [2018-12-09 13:18:28,273 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.07 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 13:18:28,273 INFO L168 Benchmark]: Boogie Preprocessor took 37.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-12-09 13:18:28,273 INFO L168 Benchmark]: RCFGBuilder took 641.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 998.9 MB in the end (delta: 104.5 MB). Peak memory consumption was 104.5 MB. Max. memory is 11.5 GB. [2018-12-09 13:18:28,273 INFO L168 Benchmark]: TraceAbstraction took 74476.01 ms. Allocated memory was 1.2 GB in the beginning and 5.8 GB in the end (delta: 4.6 GB). Free memory was 998.9 MB in the beginning and 2.6 GB in the end (delta: -1.7 GB). Peak memory consumption was 3.0 GB. Max. memory is 11.5 GB. [2018-12-09 13:18:28,273 INFO L168 Benchmark]: Witness Printer took 88.18 ms. Allocated memory is still 5.8 GB. Free memory was 2.6 GB in the beginning and 2.6 GB in the end (delta: 40.4 MB). Peak memory consumption was 40.4 MB. Max. memory is 11.5 GB. [2018-12-09 13:18:28,274 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 343.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -157.7 MB). Peak memory consumption was 37.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 19.07 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 37.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 641.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 998.9 MB in the end (delta: 104.5 MB). Peak memory consumption was 104.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 74476.01 ms. Allocated memory was 1.2 GB in the beginning and 5.8 GB in the end (delta: 4.6 GB). Free memory was 998.9 MB in the beginning and 2.6 GB in the end (delta: -1.7 GB). Peak memory consumption was 3.0 GB. Max. memory is 11.5 GB. * Witness Printer took 88.18 ms. Allocated memory is still 5.8 GB. Free memory was 2.6 GB in the beginning and 2.6 GB in the end (delta: 40.4 MB). Peak memory consumption was 40.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 37]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L7] int inputC = 3; [L8] int inputD = 4; [L9] int inputE = 5; [L10] int inputF = 6; [L11] int inputB = 2; [L14] int a1 = 23; [L15] int a19 = 9; [L16] int a10 = 0; [L17] int a12 = 0; [L18] int a4 = 14; VAL [\old(a1)=505234, \old(a10)=505238, \old(a12)=505242, \old(a19)=505235, \old(a4)=505239, \old(inputB)=505241, \old(inputC)=505240, \old(inputD)=505236, \old(inputE)=505233, \old(inputF)=505237, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L579] int output = -1; VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=-1] [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=-1] [L590] CALL, EXPR calculate_output(input) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L210] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L220] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L225] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L231] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L236] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L239] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L244] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L249] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L254] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L260] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L265] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L271] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L277] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L283] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L286] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L291] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L296] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L301] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L306] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L312] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L317] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L320] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L323] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L326] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L329] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L335] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L340] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L345] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L351] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L354] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L357] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L360] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4))))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L365] COND FALSE !(((a4==14) && ((a19==9) && (((( a1 <= -13 && (a10==3)) || (( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 ))) && (input == 3)) && (a12==0))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L370] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L375] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L378] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L383] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L388] COND FALSE !(((a19==9) && ((a4==14) && (((input == 5) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ((a10==3) && a1 <= -13 ))) && (a12==0))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L393] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L398] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L403] COND FALSE !((((a12==0) && ((a19==9) && ((((a10==3) && a1 <= -13 ) || (((a10==2) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==2)))) && (input == 6)))) && (a4==14))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L408] COND FALSE !(((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L414] COND FALSE !((((a10==1) && (((a12==0) && ((a19==10) && (input == 4))) && ((-13 < a1) && (38 >= a1)) )) && (a4==14))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L419] COND FALSE !(((a12==0) && ((a4==14) && ( 218 < a1 && (((a10==1) && (input == 4)) && (a19==10)))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a1=23, a10=0, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L425] COND TRUE ((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0)) [L426] a1 = ((((a1 / 5) * 5) / 5) + 505228) [L427] a10 = 1 [L429] return 25; VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, \result=25, a1=505232, a10=1, a12=0, a19=9, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L590] RET, EXPR calculate_output(input) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=505232, a10=1, a12=0, a19=9, a4=14, calculate_output(input)=25, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=-1] [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=25] [L590] CALL, EXPR calculate_output(input) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L210] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L220] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L225] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L231] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L236] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L239] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L244] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L249] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L254] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L260] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L265] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L271] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L277] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L283] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=2, a1=505232, a10=1, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L286] COND TRUE ((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 ))) [L287] a1 = ((((((a1 % 89)+ 74) - -21) * 5) % 89)- -118) [L288] a19 = 10 [L290] return 25; VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=2, \result=25, a1=132, a10=1, a12=0, a19=10, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L590] RET, EXPR calculate_output(input) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=132, a10=1, a12=0, a19=10, a4=14, calculate_output(input)=25, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=25] [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=25] [L590] CALL, EXPR calculate_output(input) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L210] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L220] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L225] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L231] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L236] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L239] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L244] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L249] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L254] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L260] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L265] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L271] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L277] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L283] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L286] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L291] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L296] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L301] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L306] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L312] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L317] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L320] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L323] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L326] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L329] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L335] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L340] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L345] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L351] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L354] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L357] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L360] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4))))))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L365] COND FALSE !(((a4==14) && ((a19==9) && (((( a1 <= -13 && (a10==3)) || (( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 ))) && (input == 3)) && (a12==0))))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L370] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L375] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4)))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L378] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L383] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L388] COND FALSE !(((a19==9) && ((a4==14) && (((input == 5) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ((a10==3) && a1 <= -13 ))) && (a12==0))))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L393] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14)))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L398] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14)))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L403] COND FALSE !((((a12==0) && ((a19==9) && ((((a10==3) && a1 <= -13 ) || (((a10==2) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==2)))) && (input == 6)))) && (a4==14))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L408] COND FALSE !(((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2))))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L414] COND FALSE !((((a10==1) && (((a12==0) && ((a19==10) && (input == 4))) && ((-13 < a1) && (38 >= a1)) )) && (a4==14))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L419] COND FALSE !(((a12==0) && ((a4==14) && ( 218 < a1 && (((a10==1) && (input == 4)) && (a19==10)))))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L425] COND FALSE !(((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L430] COND FALSE !((((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 6)) && (a19==10))) && (a12==0))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L436] COND FALSE !(((a19==9) && ((((input == 4) && (( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 ))) && (a12==0)) && (a4==14)))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L442] COND FALSE !((((a19==10) && ((a12==0) && ((((a10==1) && a1 <= -13 ) || (( ((38 < a1) && (218 >= a1)) && (a10==0)) || ((a10==0) && 218 < a1 ))) && (input == 3)))) && (a4==14))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L448] COND FALSE !(((a19==9) && (((a4==14) && ((((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4))) && (input == 5))) && (a12==0)))) VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, a1=132, a10=1, a12=0, a19=10, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L454] COND TRUE (((a12==0) && ((((input == 5) && (a19==10)) && ((38 < a1) && (218 >= a1)) ) && (a4==14))) && (a10==1)) [L455] a1 = ((((a1 + 381077) % 25)- -1) / 5) [L456] a10 = 2 [L457] a19 = 7 [L459] return -1; VAL [\old(a1)=132, \old(a10)=1, \old(a19)=10, \old(input)=5, \result=-1, a1=2, a10=2, a12=0, a19=7, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L590] RET, EXPR calculate_output(input) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=2, a10=2, a12=0, a19=7, a4=14, calculate_output(input)=-1, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=25] [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=2, a10=2, a12=0, a19=7, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=-1] [L590] CALL calculate_output(input) VAL [\old(a1)=2, \old(a10)=2, \old(a19)=7, \old(input)=3, a1=2, a10=2, a12=0, a19=7, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=2, \old(a10)=2, \old(a19)=7, \old(input)=3, a1=2, a10=2, a12=0, a19=7, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=2, \old(a10)=2, \old(a19)=7, \old(input)=3, a1=2, a10=2, a12=0, a19=7, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=2, \old(a10)=2, \old(a19)=7, \old(input)=3, a1=2, a10=2, a12=0, a19=7, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=2, \old(a10)=2, \old(a19)=7, \old(input)=3, a1=2, a10=2, a12=0, a19=7, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=2, \old(a10)=2, \old(a19)=7, \old(input)=3, a1=2, a10=2, a12=0, a19=7, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L36] COND TRUE (((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7)) VAL [\old(a1)=2, \old(a10)=2, \old(a19)=7, \old(input)=3, a1=2, a10=2, a12=0, a19=7, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] __VERIFIER_error() VAL [\old(a1)=2, \old(a10)=2, \old(a19)=7, \old(input)=3, a1=2, a10=2, a12=0, a19=7, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 215 locations, 1 error locations. UNSAFE Result, 74.4s OverallTime, 10 OverallIterations, 4 TraceHistogramMax, 35.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 548 SDtfs, 6115 SDslu, 731 SDs, 0 SdLazy, 13289 SolverSat, 2504 SolverUnsat, 5 SolverUnknown, 0 SolverNotchecked, 23.8s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 1888 GetRequests, 1725 SyntacticMatches, 12 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1343 ImplicationChecksByTransitivity, 21.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3278occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.0s AbstIntTime, 4 AbstIntIterations, 1 AbstIntStrong, 0.9970524240157749 AbsIntWeakeningRatio, 0.13612565445026178 AbsIntAvgWeakeningVarsNumRemoved, 15.167539267015707 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 2629 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 36.4s InterpolantComputationTime, 2719 NumberOfCodeBlocks, 2719 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 3114 ConstructedInterpolants, 124 QuantifiedInterpolants, 6893069 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1347 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 15 InterpolantComputations, 5 PerfectInterpolantSequences, 1506/2293 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...