./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem10_label29_false-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_7b55be6c-a592-42d1-825f-dfb80a3f88f1/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_7b55be6c-a592-42d1-825f-dfb80a3f88f1/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_7b55be6c-a592-42d1-825f-dfb80a3f88f1/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_7b55be6c-a592-42d1-825f-dfb80a3f88f1/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem10_label29_false-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_7b55be6c-a592-42d1-825f-dfb80a3f88f1/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_7b55be6c-a592-42d1-825f-dfb80a3f88f1/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 0fc5590477f6549e81dc2878d34d88f93c806480 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-27 00:55:06,006 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 00:55:06,007 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 00:55:06,016 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 00:55:06,016 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 00:55:06,017 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 00:55:06,018 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 00:55:06,019 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 00:55:06,020 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 00:55:06,021 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 00:55:06,022 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 00:55:06,022 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 00:55:06,023 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 00:55:06,024 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 00:55:06,025 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 00:55:06,025 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 00:55:06,026 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 00:55:06,028 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 00:55:06,029 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 00:55:06,030 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 00:55:06,031 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 00:55:06,032 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 00:55:06,034 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 00:55:06,034 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 00:55:06,034 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 00:55:06,035 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 00:55:06,036 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 00:55:06,036 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 00:55:06,037 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 00:55:06,038 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 00:55:06,039 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 00:55:06,039 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 00:55:06,039 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 00:55:06,040 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 00:55:06,040 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 00:55:06,041 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 00:55:06,041 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_7b55be6c-a592-42d1-825f-dfb80a3f88f1/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-10-27 00:55:06,062 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 00:55:06,062 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 00:55:06,063 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-27 00:55:06,063 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-27 00:55:06,063 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-27 00:55:06,063 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-27 00:55:06,063 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-27 00:55:06,063 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-27 00:55:06,063 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-27 00:55:06,063 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-27 00:55:06,063 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-27 00:55:06,064 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 00:55:06,064 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-27 00:55:06,064 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 00:55:06,064 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-27 00:55:06,064 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 00:55:06,064 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-27 00:55:06,065 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-27 00:55:06,065 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-27 00:55:06,065 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-27 00:55:06,065 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 00:55:06,065 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-27 00:55:06,065 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 00:55:06,065 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 00:55:06,065 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-27 00:55:06,066 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-27 00:55:06,066 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 00:55:06,066 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 00:55:06,066 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-27 00:55:06,066 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-27 00:55:06,066 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-27 00:55:06,066 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-27 00:55:06,066 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-27 00:55:06,066 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-27 00:55:06,067 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_7b55be6c-a592-42d1-825f-dfb80a3f88f1/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 -> 0fc5590477f6549e81dc2878d34d88f93c806480 [2018-10-27 00:55:06,091 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 00:55:06,100 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 00:55:06,102 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 00:55:06,104 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 00:55:06,104 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 00:55:06,105 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_7b55be6c-a592-42d1-825f-dfb80a3f88f1/bin-2019/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem10_label29_false-unreach-call.c [2018-10-27 00:55:06,146 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7b55be6c-a592-42d1-825f-dfb80a3f88f1/bin-2019/utaipan/data/62db56339/11f7eab7b6454ccc8a85d02e080170a2/FLAGa0b9292b0 [2018-10-27 00:55:06,604 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 00:55:06,605 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_7b55be6c-a592-42d1-825f-dfb80a3f88f1/sv-benchmarks/c/eca-rers2012/Problem10_label29_false-unreach-call.c [2018-10-27 00:55:06,613 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7b55be6c-a592-42d1-825f-dfb80a3f88f1/bin-2019/utaipan/data/62db56339/11f7eab7b6454ccc8a85d02e080170a2/FLAGa0b9292b0 [2018-10-27 00:55:06,627 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_7b55be6c-a592-42d1-825f-dfb80a3f88f1/bin-2019/utaipan/data/62db56339/11f7eab7b6454ccc8a85d02e080170a2 [2018-10-27 00:55:06,629 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 00:55:06,629 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 00:55:06,630 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 00:55:06,630 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 00:55:06,633 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 00:55:06,634 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 12:55:06" (1/1) ... [2018-10-27 00:55:06,636 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2998634a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:55:06, skipping insertion in model container [2018-10-27 00:55:06,636 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 12:55:06" (1/1) ... [2018-10-27 00:55:06,644 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 00:55:06,683 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 00:55:06,978 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 00:55:06,982 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 00:55:07,078 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 00:55:07,091 INFO L193 MainTranslator]: Completed translation [2018-10-27 00:55:07,091 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:55:07 WrapperNode [2018-10-27 00:55:07,091 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 00:55:07,092 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 00:55:07,092 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 00:55:07,092 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 00:55:07,098 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:55:07" (1/1) ... [2018-10-27 00:55:07,113 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:55:07" (1/1) ... [2018-10-27 00:55:07,160 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 00:55:07,160 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 00:55:07,160 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 00:55:07,160 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 00:55:07,263 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:55:07" (1/1) ... [2018-10-27 00:55:07,263 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:55:07" (1/1) ... [2018-10-27 00:55:07,267 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:55:07" (1/1) ... [2018-10-27 00:55:07,268 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:55:07" (1/1) ... [2018-10-27 00:55:07,283 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:55:07" (1/1) ... [2018-10-27 00:55:07,308 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:55:07" (1/1) ... [2018-10-27 00:55:07,312 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:55:07" (1/1) ... [2018-10-27 00:55:07,324 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 00:55:07,325 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 00:55:07,325 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 00:55:07,325 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 00:55:07,326 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:55:07" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7b55be6c-a592-42d1-825f-dfb80a3f88f1/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-10-27 00:55:07,368 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-27 00:55:07,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-27 00:55:07,369 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-27 00:55:07,369 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-27 00:55:07,369 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 00:55:07,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 00:55:07,369 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-27 00:55:07,369 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-27 00:55:10,140 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 00:55:10,140 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 12:55:10 BoogieIcfgContainer [2018-10-27 00:55:10,140 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 00:55:10,141 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-27 00:55:10,141 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-27 00:55:10,144 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-27 00:55:10,148 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 12:55:06" (1/3) ... [2018-10-27 00:55:10,149 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1783406e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 12:55:10, skipping insertion in model container [2018-10-27 00:55:10,149 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:55:07" (2/3) ... [2018-10-27 00:55:10,149 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1783406e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 12:55:10, skipping insertion in model container [2018-10-27 00:55:10,149 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 12:55:10" (3/3) ... [2018-10-27 00:55:10,150 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label29_false-unreach-call.c [2018-10-27 00:55:10,160 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-27 00:55:10,174 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-27 00:55:10,188 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-27 00:55:10,221 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-27 00:55:10,221 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-27 00:55:10,222 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-27 00:55:10,222 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 00:55:10,222 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 00:55:10,222 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-27 00:55:10,222 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 00:55:10,222 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-27 00:55:10,252 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states. [2018-10-27 00:55:10,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-27 00:55:10,261 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:55:10,262 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 00:55:10,264 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:55:10,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:55:10,270 INFO L82 PathProgramCache]: Analyzing trace with hash -246853596, now seen corresponding path program 1 times [2018-10-27 00:55:10,272 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:55:10,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:55:10,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:55:10,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:55:10,315 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:55:10,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:55:10,636 WARN L179 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-27 00:55:10,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:55:10,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:55:10,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 00:55:10,690 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:55:10,695 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 00:55:10,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 00:55:10,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 00:55:10,705 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 3 states. [2018-10-27 00:55:12,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:55:12,248 INFO L93 Difference]: Finished difference Result 574 states and 992 transitions. [2018-10-27 00:55:12,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 00:55:12,251 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-10-27 00:55:12,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:55:12,264 INFO L225 Difference]: With dead ends: 574 [2018-10-27 00:55:12,265 INFO L226 Difference]: Without dead ends: 356 [2018-10-27 00:55:12,271 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 00:55:12,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2018-10-27 00:55:12,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2018-10-27 00:55:12,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-10-27 00:55:12,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 609 transitions. [2018-10-27 00:55:12,325 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 609 transitions. Word has length 22 [2018-10-27 00:55:12,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:55:12,326 INFO L481 AbstractCegarLoop]: Abstraction has 356 states and 609 transitions. [2018-10-27 00:55:12,326 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 00:55:12,326 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 609 transitions. [2018-10-27 00:55:12,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-10-27 00:55:12,329 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:55:12,330 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 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-10-27 00:55:12,330 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:55:12,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:55:12,333 INFO L82 PathProgramCache]: Analyzing trace with hash -409159749, now seen corresponding path program 1 times [2018-10-27 00:55:12,333 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:55:12,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:55:12,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:55:12,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:55:12,334 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:55:12,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:55:12,650 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:55:12,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:55:12,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 00:55:12,651 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:55:12,652 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 00:55:12,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 00:55:12,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 00:55:12,653 INFO L87 Difference]: Start difference. First operand 356 states and 609 transitions. Second operand 5 states. [2018-10-27 00:55:14,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:55:14,701 INFO L93 Difference]: Finished difference Result 1289 states and 2315 transitions. [2018-10-27 00:55:14,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-27 00:55:14,702 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2018-10-27 00:55:14,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:55:14,705 INFO L225 Difference]: With dead ends: 1289 [2018-10-27 00:55:14,705 INFO L226 Difference]: Without dead ends: 939 [2018-10-27 00:55:14,709 INFO L605 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-10-27 00:55:14,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2018-10-27 00:55:14,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 926. [2018-10-27 00:55:14,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 926 states. [2018-10-27 00:55:14,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1444 transitions. [2018-10-27 00:55:14,757 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1444 transitions. Word has length 105 [2018-10-27 00:55:14,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:55:14,757 INFO L481 AbstractCegarLoop]: Abstraction has 926 states and 1444 transitions. [2018-10-27 00:55:14,757 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 00:55:14,758 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1444 transitions. [2018-10-27 00:55:14,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-27 00:55:14,762 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:55:14,762 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 00:55:14,762 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:55:14,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:55:14,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1170323611, now seen corresponding path program 1 times [2018-10-27 00:55:14,763 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:55:14,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:55:14,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:55:14,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:55:14,764 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:55:14,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:55:15,014 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:55:15,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:55:15,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-27 00:55:15,014 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:55:15,015 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 00:55:15,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 00:55:15,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-27 00:55:15,015 INFO L87 Difference]: Start difference. First operand 926 states and 1444 transitions. Second operand 6 states. [2018-10-27 00:55:17,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:55:17,432 INFO L93 Difference]: Finished difference Result 2537 states and 4091 transitions. [2018-10-27 00:55:17,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 00:55:17,434 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 121 [2018-10-27 00:55:17,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:55:17,442 INFO L225 Difference]: With dead ends: 2537 [2018-10-27 00:55:17,443 INFO L226 Difference]: Without dead ends: 1617 [2018-10-27 00:55:17,448 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-27 00:55:17,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1617 states. [2018-10-27 00:55:17,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1617 to 1586. [2018-10-27 00:55:17,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1586 states. [2018-10-27 00:55:17,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1586 states to 1586 states and 2321 transitions. [2018-10-27 00:55:17,491 INFO L78 Accepts]: Start accepts. Automaton has 1586 states and 2321 transitions. Word has length 121 [2018-10-27 00:55:17,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:55:17,491 INFO L481 AbstractCegarLoop]: Abstraction has 1586 states and 2321 transitions. [2018-10-27 00:55:17,492 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 00:55:17,492 INFO L276 IsEmpty]: Start isEmpty. Operand 1586 states and 2321 transitions. [2018-10-27 00:55:17,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-10-27 00:55:17,497 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:55:17,497 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-27 00:55:17,497 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:55:17,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:55:17,499 INFO L82 PathProgramCache]: Analyzing trace with hash -367068693, now seen corresponding path program 1 times [2018-10-27 00:55:17,499 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:55:17,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:55:17,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:55:17,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:55:17,500 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:55:17,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:55:17,826 WARN L179 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-27 00:55:18,159 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:55:18,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:55:18,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-27 00:55:18,161 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:55:18,162 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 00:55:18,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 00:55:18,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-27 00:55:18,162 INFO L87 Difference]: Start difference. First operand 1586 states and 2321 transitions. Second operand 6 states. [2018-10-27 00:55:18,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:55:18,837 INFO L93 Difference]: Finished difference Result 3508 states and 5316 transitions. [2018-10-27 00:55:18,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 00:55:18,838 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 145 [2018-10-27 00:55:18,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:55:18,848 INFO L225 Difference]: With dead ends: 3508 [2018-10-27 00:55:18,848 INFO L226 Difference]: Without dead ends: 1928 [2018-10-27 00:55:18,853 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-27 00:55:18,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1928 states. [2018-10-27 00:55:18,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1928 to 1889. [2018-10-27 00:55:18,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1889 states. [2018-10-27 00:55:18,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1889 states to 1889 states and 2675 transitions. [2018-10-27 00:55:18,902 INFO L78 Accepts]: Start accepts. Automaton has 1889 states and 2675 transitions. Word has length 145 [2018-10-27 00:55:18,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:55:18,903 INFO L481 AbstractCegarLoop]: Abstraction has 1889 states and 2675 transitions. [2018-10-27 00:55:18,903 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 00:55:18,903 INFO L276 IsEmpty]: Start isEmpty. Operand 1889 states and 2675 transitions. [2018-10-27 00:55:18,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-10-27 00:55:18,906 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:55:18,907 INFO L375 BasicCegarLoop]: trace histogram [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, 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-10-27 00:55:18,907 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:55:18,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:55:18,907 INFO L82 PathProgramCache]: Analyzing trace with hash -531546105, now seen corresponding path program 1 times [2018-10-27 00:55:18,907 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:55:18,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:55:18,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:55:18,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:55:18,908 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:55:18,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:55:19,423 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 108 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:55:19,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 00:55:19,423 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 00:55:19,424 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 186 with the following transitions: [2018-10-27 00:55:19,426 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [77], [79], [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], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-10-27 00:55:19,475 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 00:55:19,475 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 00:55:21,098 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 00:55:29,078 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 00:55:29,080 INFO L272 AbstractInterpreter]: Visited 91 different actions 516 times. Merged at 5 different actions 25 times. Widened at 1 different actions 1 times. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-10-27 00:55:29,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:55:29,120 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 00:55:31,246 INFO L227 lantSequenceWeakener]: Weakened 16 states. On average, predicates are now at 77.19% of their original sizes. [2018-10-27 00:55:31,247 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 00:55:48,603 INFO L415 sIntCurrentIteration]: We unified 184 AI predicates to 184 [2018-10-27 00:55:48,603 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 00:55:48,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 00:55:48,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [12] total 29 [2018-10-27 00:55:48,604 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:55:48,604 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-27 00:55:48,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-27 00:55:48,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2018-10-27 00:55:48,605 INFO L87 Difference]: Start difference. First operand 1889 states and 2675 transitions. Second operand 19 states. [2018-10-27 00:57:23,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:57:23,408 INFO L93 Difference]: Finished difference Result 4765 states and 6874 transitions. [2018-10-27 00:57:23,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-27 00:57:23,408 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 185 [2018-10-27 00:57:23,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:57:23,421 INFO L225 Difference]: With dead ends: 4765 [2018-10-27 00:57:23,422 INFO L226 Difference]: Without dead ends: 2882 [2018-10-27 00:57:23,429 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 190 GetRequests, 143 SyntacticMatches, 24 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 17.9s TimeCoverageRelationStatistics Valid=136, Invalid=464, Unknown=0, NotChecked=0, Total=600 [2018-10-27 00:57:23,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2882 states. [2018-10-27 00:57:23,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2882 to 2671. [2018-10-27 00:57:23,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2671 states. [2018-10-27 00:57:23,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2671 states to 2671 states and 3539 transitions. [2018-10-27 00:57:23,548 INFO L78 Accepts]: Start accepts. Automaton has 2671 states and 3539 transitions. Word has length 185 [2018-10-27 00:57:23,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:57:23,549 INFO L481 AbstractCegarLoop]: Abstraction has 2671 states and 3539 transitions. [2018-10-27 00:57:23,549 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-27 00:57:23,549 INFO L276 IsEmpty]: Start isEmpty. Operand 2671 states and 3539 transitions. [2018-10-27 00:57:23,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-10-27 00:57:23,553 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:57:23,554 INFO L375 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 00:57:23,554 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:57:23,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:57:23,555 INFO L82 PathProgramCache]: Analyzing trace with hash -344008049, now seen corresponding path program 1 times [2018-10-27 00:57:23,555 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:57:23,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:57:23,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:57:23,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:57:23,556 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:57:23,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:57:23,746 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 111 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:57:23,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 00:57:23,747 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 00:57:23,747 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 222 with the following transitions: [2018-10-27 00:57:23,747 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [77], [79], [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], [535], [539], [543], [546], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [678], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-10-27 00:57:23,753 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 00:57:23,753 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 00:57:25,358 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 00:57:30,349 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 00:57:30,350 INFO L272 AbstractInterpreter]: Visited 124 different actions 359 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-10-27 00:57:30,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:57:30,362 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 00:57:32,179 INFO L227 lantSequenceWeakener]: Weakened 18 states. On average, predicates are now at 76.7% of their original sizes. [2018-10-27 00:57:32,180 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 00:57:45,165 INFO L415 sIntCurrentIteration]: We unified 220 AI predicates to 220 [2018-10-27 00:57:45,165 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 00:57:45,165 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 00:57:45,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [6] total 22 [2018-10-27 00:57:45,166 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:57:45,166 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-27 00:57:45,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-27 00:57:45,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2018-10-27 00:57:45,167 INFO L87 Difference]: Start difference. First operand 2671 states and 3539 transitions. Second operand 18 states. [2018-10-27 00:58:57,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:58:57,761 INFO L93 Difference]: Finished difference Result 5377 states and 7314 transitions. [2018-10-27 00:58:57,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-27 00:58:57,761 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 221 [2018-10-27 00:58:57,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:58:57,768 INFO L225 Difference]: With dead ends: 5377 [2018-10-27 00:58:57,768 INFO L226 Difference]: Without dead ends: 3123 [2018-10-27 00:58:57,775 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 229 GetRequests, 190 SyntacticMatches, 14 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=154, Invalid=548, Unknown=0, NotChecked=0, Total=702 [2018-10-27 00:58:57,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3123 states. [2018-10-27 00:58:57,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3123 to 3113. [2018-10-27 00:58:57,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3113 states. [2018-10-27 00:58:57,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3113 states to 3113 states and 4066 transitions. [2018-10-27 00:58:57,943 INFO L78 Accepts]: Start accepts. Automaton has 3113 states and 4066 transitions. Word has length 221 [2018-10-27 00:58:57,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:58:57,943 INFO L481 AbstractCegarLoop]: Abstraction has 3113 states and 4066 transitions. [2018-10-27 00:58:57,943 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-27 00:58:57,943 INFO L276 IsEmpty]: Start isEmpty. Operand 3113 states and 4066 transitions. [2018-10-27 00:58:57,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-10-27 00:58:57,949 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:58:57,950 INFO L375 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 00:58:57,950 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:58:57,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:58:57,950 INFO L82 PathProgramCache]: Analyzing trace with hash 2100291820, now seen corresponding path program 1 times [2018-10-27 00:58:57,950 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:58:57,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:58:57,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:58:57,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:58:57,951 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:58:57,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:58:58,145 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 31 proven. 76 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-27 00:58:58,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 00:58:58,145 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 00:58:58,146 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 241 with the following transitions: [2018-10-27 00:58:58,146 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [77], [79], [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], [535], [539], [543], [546], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [754], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-10-27 00:58:58,150 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 00:58:58,150 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 00:59:05,032 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 00:59:05,032 INFO L272 AbstractInterpreter]: Visited 143 different actions 417 times. Merged at 5 different actions 10 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-10-27 00:59:05,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:59:05,046 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 00:59:06,079 INFO L227 lantSequenceWeakener]: Weakened 24 states. On average, predicates are now at 76.14% of their original sizes. [2018-10-27 00:59:06,079 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 00:59:15,926 INFO L415 sIntCurrentIteration]: We unified 239 AI predicates to 239 [2018-10-27 00:59:15,926 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 00:59:15,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 00:59:15,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [6] total 27 [2018-10-27 00:59:15,927 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:59:15,927 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-27 00:59:15,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-27 00:59:15,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=396, Unknown=0, NotChecked=0, Total=506 [2018-10-27 00:59:15,928 INFO L87 Difference]: Start difference. First operand 3113 states and 4066 transitions. Second operand 23 states. [2018-10-27 00:59:25,080 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 01:00:06,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 01:00:06,581 INFO L93 Difference]: Finished difference Result 6113 states and 8188 transitions. [2018-10-27 01:00:06,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-27 01:00:06,581 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 240 [2018-10-27 01:00:06,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 01:00:06,590 INFO L225 Difference]: With dead ends: 6113 [2018-10-27 01:00:06,590 INFO L226 Difference]: Without dead ends: 3563 [2018-10-27 01:00:06,595 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 248 GetRequests, 207 SyntacticMatches, 11 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=190, Invalid=802, Unknown=0, NotChecked=0, Total=992 [2018-10-27 01:00:06,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3563 states. [2018-10-27 01:00:06,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3563 to 3551. [2018-10-27 01:00:06,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3551 states. [2018-10-27 01:00:06,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3551 states to 3551 states and 4562 transitions. [2018-10-27 01:00:06,800 INFO L78 Accepts]: Start accepts. Automaton has 3551 states and 4562 transitions. Word has length 240 [2018-10-27 01:00:06,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 01:00:06,801 INFO L481 AbstractCegarLoop]: Abstraction has 3551 states and 4562 transitions. [2018-10-27 01:00:06,801 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-27 01:00:06,801 INFO L276 IsEmpty]: Start isEmpty. Operand 3551 states and 4562 transitions. [2018-10-27 01:00:06,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2018-10-27 01:00:06,808 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 01:00:06,808 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 01:00:06,808 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 01:00:06,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 01:00:06,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1132486607, now seen corresponding path program 1 times [2018-10-27 01:00:06,809 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 01:00:06,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 01:00:06,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 01:00:06,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 01:00:06,811 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 01:00:06,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:00:07,098 WARN L179 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-27 01:00:07,190 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 126 proven. 136 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-27 01:00:07,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 01:00:07,191 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 01:00:07,191 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 258 with the following transitions: [2018-10-27 01:00:07,191 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [77], [79], [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], [527], [531], [535], [538], [539], [543], [546], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-10-27 01:00:07,193 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 01:00:07,193 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 01:00:08,005 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 01:00:13,819 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 01:00:13,819 INFO L272 AbstractInterpreter]: Visited 92 different actions 435 times. Merged at 5 different actions 19 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-10-27 01:00:13,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 01:00:13,821 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 01:00:15,017 INFO L227 lantSequenceWeakener]: Weakened 47 states. On average, predicates are now at 74.52% of their original sizes. [2018-10-27 01:00:15,018 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 01:00:20,434 INFO L415 sIntCurrentIteration]: We unified 256 AI predicates to 256 [2018-10-27 01:00:20,434 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 01:00:20,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 01:00:20,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [9] total 28 [2018-10-27 01:00:20,435 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 01:00:20,435 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-27 01:00:20,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-27 01:00:20,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=334, Unknown=0, NotChecked=0, Total=420 [2018-10-27 01:00:20,435 INFO L87 Difference]: Start difference. First operand 3551 states and 4562 transitions. Second operand 21 states. [2018-10-27 01:01:30,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 01:01:30,757 INFO L93 Difference]: Finished difference Result 6925 states and 9118 transitions. [2018-10-27 01:01:30,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-27 01:01:30,757 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 257 [2018-10-27 01:01:30,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 01:01:30,767 INFO L225 Difference]: With dead ends: 6925 [2018-10-27 01:01:30,767 INFO L226 Difference]: Without dead ends: 4083 [2018-10-27 01:01:30,772 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 274 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=273, Invalid=1209, Unknown=0, NotChecked=0, Total=1482 [2018-10-27 01:01:30,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4083 states. [2018-10-27 01:01:31,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4083 to 4074. [2018-10-27 01:01:31,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4074 states. [2018-10-27 01:01:31,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4074 states to 4074 states and 5169 transitions. [2018-10-27 01:01:31,029 INFO L78 Accepts]: Start accepts. Automaton has 4074 states and 5169 transitions. Word has length 257 [2018-10-27 01:01:31,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 01:01:31,030 INFO L481 AbstractCegarLoop]: Abstraction has 4074 states and 5169 transitions. [2018-10-27 01:01:31,030 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-27 01:01:31,030 INFO L276 IsEmpty]: Start isEmpty. Operand 4074 states and 5169 transitions. [2018-10-27 01:01:31,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2018-10-27 01:01:31,038 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 01:01:31,038 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 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-10-27 01:01:31,038 INFO L424 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 01:01:31,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 01:01:31,039 INFO L82 PathProgramCache]: Analyzing trace with hash -646706161, now seen corresponding path program 1 times [2018-10-27 01:01:31,039 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 01:01:31,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 01:01:31,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 01:01:31,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 01:01:31,039 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 01:01:31,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:01:31,310 WARN L179 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-27 01:01:31,380 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 51 proven. 154 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-10-27 01:01:31,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 01:01:31,380 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 01:01:31,380 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 280 with the following transitions: [2018-10-27 01:01:31,381 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [77], [79], [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], [534], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [610], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-10-27 01:01:31,383 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 01:01:31,383 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 01:01:32,358 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 01:01:50,102 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 01:01:50,103 INFO L272 AbstractInterpreter]: Visited 109 different actions 853 times. Merged at 8 different actions 64 times. Widened at 1 different actions 3 times. Found 14 fixpoints after 2 different actions. Largest state had 24 variables. [2018-10-27 01:01:50,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 01:01:50,111 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 01:01:50,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 01:01:50,111 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7b55be6c-a592-42d1-825f-dfb80a3f88f1/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-10-27 01:01:50,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 01:01:50,120 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 01:01:50,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:01:50,219 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 01:01:50,724 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 263 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-10-27 01:01:50,724 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 01:01:50,954 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-10-27 01:01:51,058 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-10-27 01:01:51,554 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 126 proven. 77 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-10-27 01:01:51,573 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 01:01:51,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2018-10-27 01:01:51,573 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 01:01:51,574 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-27 01:01:51,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-27 01:01:51,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-10-27 01:01:51,574 INFO L87 Difference]: Start difference. First operand 4074 states and 5169 transitions. Second operand 11 states. [2018-10-27 01:01:54,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 01:01:54,981 INFO L93 Difference]: Finished difference Result 9129 states and 12164 transitions. [2018-10-27 01:01:54,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-27 01:01:54,982 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 279 [2018-10-27 01:01:54,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 01:01:54,992 INFO L225 Difference]: With dead ends: 9129 [2018-10-27 01:01:54,992 INFO L226 Difference]: Without dead ends: 3317 [2018-10-27 01:01:55,014 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 592 GetRequests, 565 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2018-10-27 01:01:55,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3317 states. [2018-10-27 01:01:55,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3317 to 2949. [2018-10-27 01:01:55,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2949 states. [2018-10-27 01:01:55,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2949 states to 2949 states and 3434 transitions. [2018-10-27 01:01:55,278 INFO L78 Accepts]: Start accepts. Automaton has 2949 states and 3434 transitions. Word has length 279 [2018-10-27 01:01:55,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 01:01:55,279 INFO L481 AbstractCegarLoop]: Abstraction has 2949 states and 3434 transitions. [2018-10-27 01:01:55,279 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-27 01:01:55,279 INFO L276 IsEmpty]: Start isEmpty. Operand 2949 states and 3434 transitions. [2018-10-27 01:01:55,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2018-10-27 01:01:55,286 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 01:01:55,286 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-10-27 01:01:55,286 INFO L424 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 01:01:55,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 01:01:55,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1747302249, now seen corresponding path program 1 times [2018-10-27 01:01:55,287 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 01:01:55,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 01:01:55,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 01:01:55,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 01:01:55,289 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 01:01:55,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:01:55,786 WARN L179 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 8 [2018-10-27 01:01:56,162 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-27 01:01:56,466 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 51 proven. 241 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-27 01:01:56,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 01:01:56,466 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 01:01:56,467 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 316 with the following transitions: [2018-10-27 01:01:56,467 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [77], [79], [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], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-10-27 01:01:56,469 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 01:01:56,470 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 01:01:57,757 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 01:02:17,667 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 01:02:17,667 INFO L272 AbstractInterpreter]: Visited 126 different actions 865 times. Merged at 8 different actions 54 times. Widened at 1 different actions 2 times. Found 12 fixpoints after 2 different actions. Largest state had 24 variables. [2018-10-27 01:02:17,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 01:02:17,674 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 01:02:17,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 01:02:17,674 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7b55be6c-a592-42d1-825f-dfb80a3f88f1/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-10-27 01:02:17,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 01:02:17,682 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 01:02:17,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:02:17,751 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 01:02:20,966 WARN L179 SmtUtils]: Spent 2.99 s on a formula simplification. DAG size of input: 179 DAG size of output: 32 [2018-10-27 01:02:21,309 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 282 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-10-27 01:02:21,309 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 01:02:21,903 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:22,151 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 118 [2018-10-27 01:02:22,988 WARN L177 XnfTransformerHelper]: Simplifying conjuction of 5613 disjunctions. This might take some time... [2018-10-27 01:02:23,045 INFO L193 XnfTransformerHelper]: Simplified to conjuction of 22 disjunctions. [2018-10-27 01:02:23,256 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 50 [2018-10-27 01:02:23,259 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:23,264 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:23,268 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:23,272 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:23,275 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:23,279 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:23,283 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:23,287 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:23,290 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:23,294 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:23,297 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:23,301 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:23,304 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:23,308 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:23,311 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:23,315 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:23,318 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:23,321 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:23,325 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:23,328 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:23,332 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:23,335 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:23,338 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:23,341 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:23,345 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:23,348 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:23,351 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:23,354 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:23,357 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:23,361 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:23,365 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:23,368 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:23,372 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:23,375 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:23,378 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:23,382 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:23,385 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:23,388 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:23,392 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:23,395 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:23,398 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:23,402 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:23,405 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:23,408 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:23,411 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:23,415 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:23,417 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:23,421 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:23,424 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:23,428 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:23,431 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:23,434 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:23,437 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:23,441 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:23,444 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:23,448 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:23,451 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:23,455 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:23,458 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:23,461 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:23,465 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:23,468 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:23,471 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:23,474 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:23,477 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:23,481 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:23,484 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:23,487 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:23,490 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:23,493 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:23,497 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:23,500 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:23,503 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:23,506 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:23,509 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:23,513 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:23,516 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:23,520 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:23,523 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:23,526 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:23,529 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:23,533 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:23,536 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:23,539 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:23,542 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:23,545 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:23,549 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:23,552 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:23,555 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:23,558 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:23,561 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:23,565 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:23,568 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:23,571 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:23,574 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:23,577 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:23,580 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:23,583 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:23,587 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:23,589 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:23,593 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:23,596 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:23,599 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:23,603 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:23,606 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:23,608 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:23,612 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:23,615 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-10-27 01:02:24,354 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 51 proven. 244 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-27 01:02:24,371 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 01:02:24,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 21 [2018-10-27 01:02:24,371 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 01:02:24,372 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-27 01:02:24,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-27 01:02:24,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2018-10-27 01:02:24,373 INFO L87 Difference]: Start difference. First operand 2949 states and 3434 transitions. Second operand 16 states. [2018-10-27 01:02:32,632 WARN L179 SmtUtils]: Spent 2.14 s on a formula simplification. DAG size of input: 56 DAG size of output: 36 [2018-10-27 01:02:55,659 WARN L179 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 27 [2018-10-27 01:03:56,442 WARN L179 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 49 DAG size of output: 32 [2018-10-27 01:03:58,766 WARN L179 SmtUtils]: Spent 2.11 s on a formula simplification. DAG size of input: 52 DAG size of output: 34 [2018-10-27 01:04:08,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 01:04:08,098 INFO L93 Difference]: Finished difference Result 8670 states and 11799 transitions. [2018-10-27 01:04:08,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-27 01:04:08,099 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 315 [2018-10-27 01:04:08,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 01:04:08,125 INFO L225 Difference]: With dead ends: 8670 [2018-10-27 01:04:08,126 INFO L226 Difference]: Without dead ends: 6019 [2018-10-27 01:04:08,140 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 709 GetRequests, 644 SyntacticMatches, 4 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 942 ImplicationChecksByTransitivity, 16.2s TimeCoverageRelationStatistics Valid=838, Invalid=3068, Unknown=0, NotChecked=0, Total=3906 [2018-10-27 01:04:08,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6019 states. [2018-10-27 01:04:08,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6019 to 5625. [2018-10-27 01:04:08,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5625 states. [2018-10-27 01:04:08,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5625 states to 5625 states and 7164 transitions. [2018-10-27 01:04:08,562 INFO L78 Accepts]: Start accepts. Automaton has 5625 states and 7164 transitions. Word has length 315 [2018-10-27 01:04:08,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 01:04:08,563 INFO L481 AbstractCegarLoop]: Abstraction has 5625 states and 7164 transitions. [2018-10-27 01:04:08,563 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-27 01:04:08,563 INFO L276 IsEmpty]: Start isEmpty. Operand 5625 states and 7164 transitions. [2018-10-27 01:04:08,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2018-10-27 01:04:08,577 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 01:04:08,578 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 01:04:08,578 INFO L424 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 01:04:08,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 01:04:08,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1059525067, now seen corresponding path program 1 times [2018-10-27 01:04:08,578 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 01:04:08,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 01:04:08,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 01:04:08,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 01:04:08,579 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 01:04:08,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:04:08,918 WARN L179 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-27 01:04:09,250 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 220 proven. 206 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-10-27 01:04:09,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 01:04:09,251 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 01:04:09,251 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 334 with the following transitions: [2018-10-27 01:04:09,251 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [77], [79], [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], [518], [519], [523], [527], [531], [535], [538], [539], [543], [546], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-10-27 01:04:09,253 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 01:04:09,253 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 01:04:10,029 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 01:04:14,112 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 01:04:14,112 INFO L272 AbstractInterpreter]: Visited 93 different actions 360 times. Merged at 7 different actions 21 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 24 variables. [2018-10-27 01:04:14,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 01:04:14,118 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 01:04:16,384 INFO L227 lantSequenceWeakener]: Weakened 34 states. On average, predicates are now at 75.14% of their original sizes. [2018-10-27 01:04:16,384 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 01:04:28,125 INFO L415 sIntCurrentIteration]: We unified 332 AI predicates to 332 [2018-10-27 01:04:28,126 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 01:04:28,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 01:04:28,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [9] total 28 [2018-10-27 01:04:28,126 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 01:04:28,126 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-27 01:04:28,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-27 01:04:28,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=334, Unknown=0, NotChecked=0, Total=420 [2018-10-27 01:04:28,127 INFO L87 Difference]: Start difference. First operand 5625 states and 7164 transitions. Second operand 21 states. [2018-10-27 01:06:05,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 01:06:05,421 INFO L93 Difference]: Finished difference Result 11458 states and 14733 transitions. [2018-10-27 01:06:05,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-27 01:06:05,422 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 333 [2018-10-27 01:06:05,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 01:06:05,442 INFO L225 Difference]: With dead ends: 11458 [2018-10-27 01:06:05,443 INFO L226 Difference]: Without dead ends: 6499 [2018-10-27 01:06:05,454 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 344 GetRequests, 301 SyntacticMatches, 12 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=197, Invalid=859, Unknown=0, NotChecked=0, Total=1056 [2018-10-27 01:06:05,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6499 states. [2018-10-27 01:06:05,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6499 to 6295. [2018-10-27 01:06:05,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6295 states. [2018-10-27 01:06:05,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6295 states to 6295 states and 7918 transitions. [2018-10-27 01:06:05,874 INFO L78 Accepts]: Start accepts. Automaton has 6295 states and 7918 transitions. Word has length 333 [2018-10-27 01:06:05,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 01:06:05,874 INFO L481 AbstractCegarLoop]: Abstraction has 6295 states and 7918 transitions. [2018-10-27 01:06:05,874 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-27 01:06:05,875 INFO L276 IsEmpty]: Start isEmpty. Operand 6295 states and 7918 transitions. [2018-10-27 01:06:05,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2018-10-27 01:06:05,887 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 01:06:05,888 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-10-27 01:06:05,888 INFO L424 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 01:06:05,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 01:06:05,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1322528308, now seen corresponding path program 1 times [2018-10-27 01:06:05,888 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 01:06:05,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 01:06:05,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 01:06:05,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 01:06:05,891 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 01:06:05,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 01:06:05,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 01:06:06,038 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-10-27 01:06:06,144 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.10 01:06:06 BoogieIcfgContainer [2018-10-27 01:06:06,144 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-27 01:06:06,144 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 01:06:06,145 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 01:06:06,145 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 01:06:06,145 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 12:55:10" (3/4) ... [2018-10-27 01:06:06,149 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-10-27 01:06:06,297 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_7b55be6c-a592-42d1-825f-dfb80a3f88f1/bin-2019/utaipan/witness.graphml [2018-10-27 01:06:06,297 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 01:06:06,298 INFO L168 Benchmark]: Toolchain (without parser) took 659668.52 ms. Allocated memory was 1.0 GB in the beginning and 5.1 GB in the end (delta: 4.1 GB). Free memory was 956.4 MB in the beginning and 1.5 GB in the end (delta: -582.6 MB). Peak memory consumption was 3.5 GB. Max. memory is 11.5 GB. [2018-10-27 01:06:06,299 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 01:06:06,299 INFO L168 Benchmark]: CACSL2BoogieTranslator took 460.99 ms. Allocated memory is still 1.0 GB. Free memory was 956.4 MB in the beginning and 926.9 MB in the end (delta: 29.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 11.5 GB. [2018-10-27 01:06:06,299 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.18 ms. Allocated memory is still 1.0 GB. Free memory was 926.9 MB in the beginning and 918.9 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. [2018-10-27 01:06:06,299 INFO L168 Benchmark]: Boogie Preprocessor took 164.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 918.9 MB in the beginning and 1.1 GB in the end (delta: -224.9 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2018-10-27 01:06:06,300 INFO L168 Benchmark]: RCFGBuilder took 2815.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 109.3 MB). Peak memory consumption was 109.3 MB. Max. memory is 11.5 GB. [2018-10-27 01:06:06,300 INFO L168 Benchmark]: TraceAbstraction took 656003.15 ms. Allocated memory was 1.2 GB in the beginning and 5.1 GB in the end (delta: 3.9 GB). Free memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: -588.7 MB). Peak memory consumption was 3.4 GB. Max. memory is 11.5 GB. [2018-10-27 01:06:06,300 INFO L168 Benchmark]: Witness Printer took 152.40 ms. Allocated memory is still 5.1 GB. Free memory was 1.6 GB in the beginning and 1.5 GB in the end (delta: 84.2 MB). Peak memory consumption was 84.2 MB. Max. memory is 11.5 GB. [2018-10-27 01:06:06,304 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 460.99 ms. Allocated memory is still 1.0 GB. Free memory was 956.4 MB in the beginning and 926.9 MB in the end (delta: 29.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 68.18 ms. Allocated memory is still 1.0 GB. Free memory was 926.9 MB in the beginning and 918.9 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 164.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 918.9 MB in the beginning and 1.1 GB in the end (delta: -224.9 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2815.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 109.3 MB). Peak memory consumption was 109.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 656003.15 ms. Allocated memory was 1.2 GB in the beginning and 5.1 GB in the end (delta: 3.9 GB). Free memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: -588.7 MB). Peak memory consumption was 3.4 GB. Max. memory is 11.5 GB. * Witness Printer took 152.40 ms. Allocated memory is still 5.1 GB. Free memory was 1.6 GB in the beginning and 1.5 GB in the end (delta: 84.2 MB). Peak memory consumption was 84.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 49]: 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)=518106, \old(a10)=518110, \old(a12)=518114, \old(a19)=518107, \old(a4)=518111, \old(inputB)=518113, \old(inputC)=518112, \old(inputD)=518108, \old(inputE)=518105, \old(inputF)=518109, 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=2, 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, 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, a1=23, a10=0, a12=0, a19=9, a4=14, 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, a1=23, a10=0, a12=0, a19=9, a4=14, 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, a1=23, a10=0, a12=0, a19=9, a4=14, 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, a1=23, a10=0, a12=0, a19=9, a4=14, 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, a1=23, a10=0, a12=0, a19=9, a4=14, 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, a1=23, a10=0, a12=0, a19=9, a4=14, 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, a1=23, a10=0, a12=0, a19=9, a4=14, 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, a1=23, a10=0, a12=0, a19=9, a4=14, 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, a1=23, a10=0, a12=0, a19=9, a4=14, 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, a1=23, a10=0, a12=0, a19=9, a4=14, 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, a1=23, a10=0, a12=0, a19=9, a4=14, 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, a1=23, a10=0, a12=0, a19=9, a4=14, 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, a1=23, a10=0, a12=0, a19=9, a4=14, 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, a1=23, a10=0, a12=0, a19=9, a4=14, 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, a1=23, a10=0, a12=0, a19=9, a4=14, 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, a1=23, a10=0, a12=0, a19=9, a4=14, 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, a1=23, a10=0, a12=0, a19=9, a4=14, 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, a1=23, a10=0, a12=0, a19=9, a4=14, 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, a1=23, a10=0, a12=0, a19=9, a4=14, 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, a1=23, a10=0, a12=0, a19=9, a4=14, 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, a1=23, a10=0, a12=0, a19=9, a4=14, 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, a1=23, a10=0, a12=0, a19=9, a4=14, 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, a1=23, a10=0, a12=0, a19=9, a4=14, 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, a1=23, a10=0, a12=0, a19=9, a4=14, 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, a1=23, a10=0, a12=0, a19=9, a4=14, 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, a1=23, a10=0, a12=0, a19=9, a4=14, 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, a1=23, a10=0, a12=0, a19=9, a4=14, 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, a1=23, a10=0, a12=0, a19=9, a4=14, 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, a1=23, a10=0, a12=0, a19=9, a4=14, 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, a1=23, a10=0, a12=0, a19=9, a4=14, 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, a1=23, a10=0, a12=0, a19=9, a4=14, 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, a1=23, a10=0, a12=0, a19=9, a4=14, 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, a1=23, a10=0, a12=0, a19=9, a4=14, 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, a1=23, a10=0, a12=0, a19=9, a4=14, 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, a1=23, a10=0, a12=0, a19=9, a4=14, 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, a1=23, a10=0, a12=0, a19=9, a4=14, 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, a1=23, a10=0, a12=0, a19=9, a4=14, 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, a1=23, a10=0, a12=0, a19=9, a4=14, 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, a1=23, a10=0, a12=0, a19=9, a4=14, 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, a1=23, a10=0, a12=0, a19=9, a4=14, 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, a1=23, a10=0, a12=0, a19=9, a4=14, 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, a1=23, a10=0, a12=0, a19=9, a4=14, 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, a1=23, a10=0, a12=0, a19=9, a4=14, 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, a1=23, a10=0, a12=0, a19=9, a4=14, 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, a1=23, a10=0, a12=0, a19=9, a4=14, 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, a1=23, a10=0, a12=0, a19=9, a4=14, 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, a1=23, a10=0, a12=0, a19=9, a4=14, 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, a1=23, a10=0, a12=0, a19=9, a4=14, 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, a1=23, a10=0, a12=0, a19=9, a4=14, 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, a1=23, a10=0, a12=0, a19=9, a4=14, 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, a1=23, a10=0, a12=0, a19=9, a4=14, 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, a1=23, a10=0, a12=0, a19=9, a4=14, 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, a1=23, a10=0, a12=0, a19=9, a4=14, 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, a1=23, a10=0, a12=0, a19=9, a4=14, 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, a1=23, a10=0, a12=0, a19=9, a4=14, 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, a1=23, a10=0, a12=0, a19=9, a4=14, 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, a1=23, a10=0, a12=0, a19=9, a4=14, 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, a1=23, a10=0, a12=0, a19=9, a4=14, 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, a1=23, a10=0, a12=0, a19=9, a4=14, 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, a1=23, a10=0, a12=0, a19=9, a4=14, 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, a1=23, a10=0, a12=0, a19=9, a4=14, 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, a1=23, a10=0, a12=0, a19=9, a4=14, 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, a1=23, a10=0, a12=0, a19=9, a4=14, 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, a1=23, a10=0, a12=0, a19=9, a4=14, 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, a1=23, a10=0, a12=0, a19=9, a4=14, 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, a1=23, a10=0, a12=0, a19=9, a4=14, 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, a1=23, a10=0, a12=0, a19=9, a4=14, 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, a1=23, a10=0, a12=0, a19=9, a4=14, 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, a1=23, a10=0, a12=0, a19=9, a4=14, 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, a1=23, a10=0, a12=0, a19=9, a4=14, 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, a1=23, a10=0, a12=0, a19=9, a4=14, 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, a1=23, a10=0, a12=0, a19=9, a4=14, 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, a1=23, a10=0, a12=0, a19=9, a4=14, 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, a1=23, a10=0, a12=0, a19=9, a4=14, 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, a1=23, a10=0, a12=0, a19=9, a4=14, 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, a1=23, a10=0, a12=0, a19=9, a4=14, 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, a1=23, a10=0, a12=0, a19=9, a4=14, 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, a1=23, a10=0, a12=0, a19=9, a4=14, 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, a1=23, a10=0, a12=0, a19=9, a4=14, 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, a1=23, a10=0, a12=0, a19=9, a4=14, 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, a1=23, a10=0, a12=0, a19=9, a4=14, 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, a1=23, a10=0, a12=0, a19=9, a4=14, 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, a1=23, a10=0, a12=0, a19=9, a4=14, 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, a1=23, a10=0, a12=0, a19=9, a4=14, 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, a1=23, a10=0, a12=0, a19=9, a4=14, 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, a1=23, a10=0, a12=0, a19=9, a4=14, 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, a1=23, a10=0, a12=0, a19=9, a4=14, 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, a1=23, a10=0, a12=0, a19=9, a4=14, 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, a1=23, a10=0, a12=0, a19=9, a4=14, 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, a1=23, a10=0, a12=0, a19=9, a4=14, 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, a1=23, a10=0, a12=0, a19=9, a4=14, 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, a1=23, a10=0, a12=0, a19=9, a4=14, 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, a1=23, a10=0, a12=0, a19=9, a4=14, 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, a1=23, a10=0, a12=0, a19=9, a4=14, 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, a1=23, a10=0, a12=0, a19=9, a4=14, 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, a1=23, a10=0, a12=0, a19=9, a4=14, 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, a1=23, a10=0, a12=0, a19=9, a4=14, 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, a1=23, a10=0, a12=0, a19=9, a4=14, 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, a1=23, a10=0, a12=0, a19=9, a4=14, 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, a1=23, a10=0, a12=0, a19=9, a4=14, 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, a1=23, a10=0, a12=0, a19=9, a4=14, 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, a1=23, a10=0, a12=0, a19=9, a4=14, 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, a1=23, a10=0, a12=0, a19=9, a4=14, 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, a1=23, a10=0, a12=0, a19=9, a4=14, 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, a1=23, a10=0, a12=0, a19=9, a4=14, 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, a1=23, a10=0, a12=0, a19=9, a4=14, 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, a1=23, a10=0, a12=0, a19=9, a4=14, 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)=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] [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)=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] [L436] COND FALSE !(((a19==9) && ((((input == 4) && (( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 ))) && (a12==0)) && (a4==14)))) 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] [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)=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] [L448] COND FALSE !(((a19==9) && (((a4==14) && ((((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4))) && (input == 5))) && (a12==0)))) 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] [L454] COND FALSE !((((a12==0) && ((((input == 5) && (a19==10)) && ((38 < a1) && (218 >= a1)) ) && (a4==14))) && (a10==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] [L460] COND FALSE !(((a19==9) && ((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3)) && (a10==1)) && (a12==0))))) 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] [L465] COND FALSE !(((a10==0) && ((a12==0) && ((((input == 5) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a4==14))))) 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] [L471] COND FALSE !(( 218 < a1 && (((((input == 3) && (a10==1)) && (a12==0)) && (a4==14)) && (a19==10)))) 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] [L476] COND FALSE !((((a12==0) && ((a19==9) && (((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a4==14)))) && (a10==3))) 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] [L481] COND FALSE !((((((a4==14) && ( ((38 < a1) && (218 >= a1)) && (input == 2))) && (a12==0)) && (a10==1)) && (a19==10))) 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] [L487] COND FALSE !((((a19==10) && ((a10==1) && ((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (input == 5))))) && (a4==14))) 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] [L493] COND FALSE !(((((a10==1) && (((input == 5) && 218 < a1 ) && (a4==14))) && (a19==10)) && (a12==0))) 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] [L499] COND FALSE !((((a4==14) && ((a19==9) && ((input == 2) && (((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 ))))) && (a12==0))) 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] [L504] COND FALSE !((((a4==14) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 2))) && (a12==0))) && (a10==4))) 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] [L509] COND FALSE !(((a4==14) && (((a19==9) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 6)) && (a10==3))) && (a12==0)))) 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] [L514] COND FALSE !((((a4==14) && ((((input == 6) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a12==0))) && (a10==0))) 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] [L517] COND FALSE !(((a12==0) && ((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 2)) && (a19==10))))) 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] [L523] COND FALSE !((((a12==0) && ((a19==9) && ((a10==2) && ((input == 6) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))))) && (a4==14))) 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] [L526] COND TRUE ((a4==14) && ((a19==9) && ((a12==0) && (((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0))))) [L527] a1 = (((a1 * 5) + 278443) - -239546) [L528] RET return 26; VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L590] EXPR calculate_output(input) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, calculate_output(input)=26, input=2, 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=518104, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=26] [L590] CALL, EXPR calculate_output(input) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, a1=518104, 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)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, 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)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, 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)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, 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)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, 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)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, 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)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, 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)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, 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)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, 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)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, 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)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, 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)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, 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)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, 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)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, 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)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, 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)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, 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)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, 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)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, 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)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, 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)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, 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)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, 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)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, 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)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, 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)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, 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)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, 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)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, 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)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, 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)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, 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)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, 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)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, 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)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, 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)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, 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)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, 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)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, 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)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, 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)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, 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)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, 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)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, 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)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, 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)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, 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)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, 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)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, 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)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, 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)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, 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)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, 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)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, 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)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, 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)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, 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)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, 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)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, 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)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, 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)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, 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)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, 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)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, 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)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, 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)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, 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)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, 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)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, 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)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, 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)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, 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)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, 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)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, 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)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, 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)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, 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)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, 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)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, 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)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, 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)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, 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)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, 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)=518104, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L244] COND TRUE (((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0)) [L245] a1 = (((((a1 % 25)- -13) - 42605) / 5) - -8517) [L246] a10 = 3 [L248] RET return 26; VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L590] EXPR calculate_output(input) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, calculate_output(input)=26, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=26] [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=0, a10=3, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=26] [L590] CALL, EXPR calculate_output(input) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, 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)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, 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)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, 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)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, 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)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, 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)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, 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)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, 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)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, 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)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, 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)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, 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)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, 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)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, 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)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, 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)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, 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)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, 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)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, 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)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, 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)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, 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)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, 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)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, 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)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, 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)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, 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)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, 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)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, 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)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, 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)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, 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)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, 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)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, 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)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, 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)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, 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)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, 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)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, 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)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, 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)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, 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)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, 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)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, 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)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, 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)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, 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)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, 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)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, 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)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, 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)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, 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)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, 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)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, 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)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, 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)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, 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)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, 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)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, 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)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, 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)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, 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)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, 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)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, 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)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, 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)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, 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)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, 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)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, 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)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, 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)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, 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)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, 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)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, 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)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, 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)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, 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)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, 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)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, 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)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, 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)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, 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)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, 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)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, 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)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, 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)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, 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)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, 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)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, 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)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, 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)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, 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)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, 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)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, 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)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, 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)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, 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)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, 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)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, 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)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, 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)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, 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)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, 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)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, 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)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, 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)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, 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)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, 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)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, 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)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, 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)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, 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)=0, \old(a10)=3, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L345] COND TRUE (((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14)) [L346] a1 = ((((a1 - 287698) - 189392) % 89)+ 206) [L347] a10 = 2 [L348] a19 = 7 [L350] RET return -1; VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, a1=156, a10=2, a12=0, a19=7, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L590] EXPR calculate_output(input) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=156, 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=26] [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=156, a10=2, a12=0, a19=7, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=-1] [L590] CALL calculate_output(input) VAL [\old(a1)=156, \old(a10)=2, \old(a19)=7, a1=156, 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)=156, \old(a10)=2, \old(a19)=7, a1=156, a10=2, a12=0, a19=7, a4=14, 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)=156, \old(a10)=2, \old(a19)=7, a1=156, a10=2, a12=0, a19=7, a4=14, 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)=156, \old(a10)=2, \old(a19)=7, a1=156, a10=2, a12=0, a19=7, a4=14, 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)=156, \old(a10)=2, \old(a19)=7, a1=156, a10=2, a12=0, a19=7, a4=14, 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)=156, \old(a10)=2, \old(a19)=7, a1=156, a10=2, a12=0, a19=7, a4=14, 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)=156, \old(a10)=2, \old(a19)=7, a1=156, a10=2, a12=0, a19=7, a4=14, 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)=156, \old(a10)=2, \old(a19)=7, a1=156, a10=2, a12=0, a19=7, a4=14, 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)=156, \old(a10)=2, \old(a19)=7, a1=156, a10=2, a12=0, a19=7, a4=14, 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)=156, \old(a10)=2, \old(a19)=7, a1=156, a10=2, a12=0, a19=7, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L48] COND TRUE (((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7)) VAL [\old(a1)=156, \old(a10)=2, \old(a19)=7, a1=156, a10=2, a12=0, a19=7, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L49] __VERIFIER_error() VAL [\old(a1)=156, \old(a10)=2, \old(a19)=7, a1=156, a10=2, a12=0, a19=7, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 216 locations, 1 error locations. UNSAFE Result, 655.9s OverallTime, 12 OverallIterations, 5 TraceHistogramMax, 499.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1443 SDtfs, 16623 SDslu, 1794 SDs, 0 SdLazy, 20533 SolverSat, 3431 SolverUnsat, 40 SolverUnknown, 0 SolverNotchecked, 259.6s Time, PredicateUnifierStatistics: 10 DeclaredPredicates, 2620 GetRequests, 2296 SyntacticMatches, 73 SemanticMatches, 251 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2281 ImplicationChecksByTransitivity, 85.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6295occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 74.6s AbstIntTime, 7 AbstIntIterations, 5 AbstIntStrong, 0.994587292056652 AbsIntWeakeningRatio, 0.12022745735174654 AbsIntAvgWeakeningVarsNumRemoved, 550.8415922014623 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 2.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 1291 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 12.1s InterpolantComputationTime, 3151 NumberOfCodeBlocks, 3151 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 3396 ConstructedInterpolants, 126 QuantifiedInterpolants, 7532518 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1018 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 15 InterpolantComputations, 4 PerfectInterpolantSequences, 1756/2898 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...