./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem10_label41_false-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_4750d52d-dd24-4612-ae19-45391c9fd615/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4750d52d-dd24-4612-ae19-45391c9fd615/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4750d52d-dd24-4612-ae19-45391c9fd615/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4750d52d-dd24-4612-ae19-45391c9fd615/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem10_label41_false-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_4750d52d-dd24-4612-ae19-45391c9fd615/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4750d52d-dd24-4612-ae19-45391c9fd615/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 54414f3686907f9338cea16d244952a57889399b ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 22:25:09,289 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 22:25:09,290 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 22:25:09,296 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 22:25:09,297 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 22:25:09,297 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 22:25:09,298 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 22:25:09,299 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 22:25:09,300 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 22:25:09,300 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 22:25:09,300 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 22:25:09,301 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 22:25:09,301 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 22:25:09,302 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 22:25:09,302 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 22:25:09,303 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 22:25:09,303 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 22:25:09,304 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 22:25:09,305 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 22:25:09,306 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 22:25:09,306 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 22:25:09,307 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 22:25:09,308 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 22:25:09,308 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 22:25:09,308 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 22:25:09,309 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 22:25:09,310 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 22:25:09,310 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 22:25:09,310 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 22:25:09,311 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 22:25:09,311 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 22:25:09,312 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 22:25:09,312 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 22:25:09,312 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 22:25:09,313 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 22:25:09,313 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 22:25:09,313 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4750d52d-dd24-4612-ae19-45391c9fd615/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 22:25:09,321 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 22:25:09,321 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 22:25:09,322 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 22:25:09,322 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 22:25:09,322 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 22:25:09,322 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 22:25:09,322 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 22:25:09,322 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 22:25:09,323 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 22:25:09,323 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 22:25:09,323 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 22:25:09,323 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 22:25:09,323 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 22:25:09,324 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 22:25:09,324 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 22:25:09,324 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 22:25:09,324 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 22:25:09,324 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 22:25:09,324 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 22:25:09,324 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 22:25:09,324 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 22:25:09,324 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 22:25:09,325 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 22:25:09,325 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 22:25:09,325 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 22:25:09,325 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 22:25:09,325 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 22:25:09,325 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 22:25:09,325 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 22:25:09,325 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 22:25:09,326 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 22:25:09,326 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 22:25:09,326 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 22:25:09,326 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 22:25:09,326 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 22:25:09,326 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 22:25:09,326 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_4750d52d-dd24-4612-ae19-45391c9fd615/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 -> 54414f3686907f9338cea16d244952a57889399b [2018-12-02 22:25:09,344 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 22:25:09,353 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 22:25:09,356 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 22:25:09,357 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 22:25:09,357 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 22:25:09,358 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4750d52d-dd24-4612-ae19-45391c9fd615/bin-2019/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem10_label41_false-unreach-call.c [2018-12-02 22:25:09,395 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4750d52d-dd24-4612-ae19-45391c9fd615/bin-2019/utaipan/data/5c8914dc9/b7b534da617c490fb06f9de954ba7a7d/FLAGd9d2974d9 [2018-12-02 22:25:09,737 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 22:25:09,737 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4750d52d-dd24-4612-ae19-45391c9fd615/sv-benchmarks/c/eca-rers2012/Problem10_label41_false-unreach-call.c [2018-12-02 22:25:09,743 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4750d52d-dd24-4612-ae19-45391c9fd615/bin-2019/utaipan/data/5c8914dc9/b7b534da617c490fb06f9de954ba7a7d/FLAGd9d2974d9 [2018-12-02 22:25:10,118 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4750d52d-dd24-4612-ae19-45391c9fd615/bin-2019/utaipan/data/5c8914dc9/b7b534da617c490fb06f9de954ba7a7d [2018-12-02 22:25:10,121 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 22:25:10,121 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 22:25:10,122 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 22:25:10,122 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 22:25:10,124 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 22:25:10,125 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 10:25:10" (1/1) ... [2018-12-02 22:25:10,126 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d10e54c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:25:10, skipping insertion in model container [2018-12-02 22:25:10,126 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 10:25:10" (1/1) ... [2018-12-02 22:25:10,131 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 22:25:10,155 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 22:25:10,333 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 22:25:10,335 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 22:25:10,382 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 22:25:10,430 INFO L195 MainTranslator]: Completed translation [2018-12-02 22:25:10,431 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:25:10 WrapperNode [2018-12-02 22:25:10,431 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 22:25:10,432 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 22:25:10,432 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 22:25:10,432 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 22:25:10,439 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:25:10" (1/1) ... [2018-12-02 22:25:10,451 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:25:10" (1/1) ... [2018-12-02 22:25:10,457 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 22:25:10,457 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 22:25:10,457 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 22:25:10,457 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 22:25:10,464 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:25:10" (1/1) ... [2018-12-02 22:25:10,464 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:25:10" (1/1) ... [2018-12-02 22:25:10,466 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:25:10" (1/1) ... [2018-12-02 22:25:10,467 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:25:10" (1/1) ... [2018-12-02 22:25:10,481 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:25:10" (1/1) ... [2018-12-02 22:25:10,487 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:25:10" (1/1) ... [2018-12-02 22:25:10,490 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:25:10" (1/1) ... [2018-12-02 22:25:10,494 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 22:25:10,494 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 22:25:10,494 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 22:25:10,494 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 22:25:10,495 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:25:10" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4750d52d-dd24-4612-ae19-45391c9fd615/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 22:25:10,529 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 22:25:10,529 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 22:25:10,529 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-12-02 22:25:10,529 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-12-02 22:25:10,529 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 22:25:10,529 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 22:25:10,529 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 22:25:10,529 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 22:25:11,060 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 22:25:11,060 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-02 22:25:11,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 10:25:11 BoogieIcfgContainer [2018-12-02 22:25:11,061 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 22:25:11,061 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 22:25:11,061 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 22:25:11,063 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 22:25:11,063 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 10:25:10" (1/3) ... [2018-12-02 22:25:11,064 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3efd6d9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 10:25:11, skipping insertion in model container [2018-12-02 22:25:11,064 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:25:10" (2/3) ... [2018-12-02 22:25:11,064 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3efd6d9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 10:25:11, skipping insertion in model container [2018-12-02 22:25:11,064 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 10:25:11" (3/3) ... [2018-12-02 22:25:11,065 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label41_false-unreach-call.c [2018-12-02 22:25:11,071 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 22:25:11,076 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-02 22:25:11,086 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-02 22:25:11,105 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 22:25:11,106 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 22:25:11,106 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 22:25:11,106 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 22:25:11,106 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 22:25:11,106 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 22:25:11,106 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 22:25:11,106 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 22:25:11,119 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states. [2018-12-02 22:25:11,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-02 22:25:11,123 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:25:11,123 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 22:25:11,125 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:25:11,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:25:11,128 INFO L82 PathProgramCache]: Analyzing trace with hash -354743369, now seen corresponding path program 1 times [2018-12-02 22:25:11,129 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:25:11,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:25:11,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:25:11,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:25:11,159 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:25:11,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:25:11,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:25:11,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:25:11,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 22:25:11,266 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 22:25:11,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 22:25:11,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 22:25:11,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 22:25:11,278 INFO L87 Difference]: Start difference. First operand 215 states. Second operand 3 states. [2018-12-02 22:25:11,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:25:11,798 INFO L93 Difference]: Finished difference Result 571 states and 989 transitions. [2018-12-02 22:25:11,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 22:25:11,800 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-02 22:25:11,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:25:11,808 INFO L225 Difference]: With dead ends: 571 [2018-12-02 22:25:11,808 INFO L226 Difference]: Without dead ends: 294 [2018-12-02 22:25:11,811 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 22:25:11,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-12-02 22:25:11,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2018-12-02 22:25:11,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-12-02 22:25:11,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 446 transitions. [2018-12-02 22:25:11,848 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 446 transitions. Word has length 26 [2018-12-02 22:25:11,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:25:11,849 INFO L480 AbstractCegarLoop]: Abstraction has 294 states and 446 transitions. [2018-12-02 22:25:11,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 22:25:11,849 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 446 transitions. [2018-12-02 22:25:11,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-02 22:25:11,851 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:25:11,851 INFO L402 BasicCegarLoop]: trace histogram [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, 1] [2018-12-02 22:25:11,851 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:25:11,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:25:11,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1460648607, now seen corresponding path program 1 times [2018-12-02 22:25:11,852 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:25:11,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:25:11,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:25:11,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:25:11,853 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:25:11,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:25:11,972 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:25:11,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:25:11,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 22:25:11,973 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 22:25:11,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 22:25:11,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 22:25:11,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 22:25:11,975 INFO L87 Difference]: Start difference. First operand 294 states and 446 transitions. Second operand 6 states. [2018-12-02 22:25:12,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:25:12,434 INFO L93 Difference]: Finished difference Result 741 states and 1136 transitions. [2018-12-02 22:25:12,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 22:25:12,434 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2018-12-02 22:25:12,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:25:12,436 INFO L225 Difference]: With dead ends: 741 [2018-12-02 22:25:12,436 INFO L226 Difference]: Without dead ends: 453 [2018-12-02 22:25:12,437 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-02 22:25:12,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2018-12-02 22:25:12,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 445. [2018-12-02 22:25:12,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2018-12-02 22:25:12,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 626 transitions. [2018-12-02 22:25:12,452 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 626 transitions. Word has length 99 [2018-12-02 22:25:12,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:25:12,452 INFO L480 AbstractCegarLoop]: Abstraction has 445 states and 626 transitions. [2018-12-02 22:25:12,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 22:25:12,452 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 626 transitions. [2018-12-02 22:25:12,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-02 22:25:12,453 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:25:12,453 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 22:25:12,454 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:25:12,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:25:12,454 INFO L82 PathProgramCache]: Analyzing trace with hash -361920971, now seen corresponding path program 1 times [2018-12-02 22:25:12,454 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:25:12,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:25:12,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:25:12,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:25:12,455 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:25:12,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:25:12,587 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:25:12,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 22:25:12,587 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 22:25:12,587 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 106 with the following transitions: [2018-12-02 22:25:12,589 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [117], [119], [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], [792], [796], [805], [809], [811], [816], [817], [818], [820], [821] [2018-12-02 22:25:12,618 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 22:25:12,618 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 22:25:12,912 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 22:25:12,913 INFO L272 AbstractInterpreter]: Visited 87 different actions 166 times. Merged at 3 different actions 3 times. Never widened. Performed 1532 root evaluator evaluations with a maximum evaluation depth of 8. Performed 1532 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-12-02 22:25:12,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:25:12,919 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 22:25:12,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 22:25:12,920 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4750d52d-dd24-4612-ae19-45391c9fd615/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 22:25:12,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:25:12,927 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 22:25:12,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:25:12,960 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:25:13,005 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:25:13,005 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 22:25:13,044 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:25:13,062 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-02 22:25:13,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [7] total 8 [2018-12-02 22:25:13,062 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 22:25:13,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 22:25:13,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 22:25:13,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-12-02 22:25:13,063 INFO L87 Difference]: Start difference. First operand 445 states and 626 transitions. Second operand 3 states. [2018-12-02 22:25:13,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:25:13,385 INFO L93 Difference]: Finished difference Result 1319 states and 1894 transitions. [2018-12-02 22:25:13,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 22:25:13,385 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2018-12-02 22:25:13,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:25:13,388 INFO L225 Difference]: With dead ends: 1319 [2018-12-02 22:25:13,388 INFO L226 Difference]: Without dead ends: 880 [2018-12-02 22:25:13,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 209 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-12-02 22:25:13,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2018-12-02 22:25:13,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 880. [2018-12-02 22:25:13,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 880 states. [2018-12-02 22:25:13,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 1245 transitions. [2018-12-02 22:25:13,408 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 1245 transitions. Word has length 105 [2018-12-02 22:25:13,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:25:13,409 INFO L480 AbstractCegarLoop]: Abstraction has 880 states and 1245 transitions. [2018-12-02 22:25:13,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 22:25:13,409 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1245 transitions. [2018-12-02 22:25:13,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-12-02 22:25:13,411 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:25:13,411 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 22:25:13,411 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:25:13,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:25:13,412 INFO L82 PathProgramCache]: Analyzing trace with hash 287111494, now seen corresponding path program 1 times [2018-12-02 22:25:13,412 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:25:13,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:25:13,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:25:13,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:25:13,413 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:25:13,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:25:13,531 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:25:13,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:25:13,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 22:25:13,532 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 22:25:13,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 22:25:13,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 22:25:13,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 22:25:13,533 INFO L87 Difference]: Start difference. First operand 880 states and 1245 transitions. Second operand 6 states. [2018-12-02 22:25:13,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:25:13,972 INFO L93 Difference]: Finished difference Result 2078 states and 3015 transitions. [2018-12-02 22:25:13,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 22:25:13,973 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 138 [2018-12-02 22:25:13,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:25:13,976 INFO L225 Difference]: With dead ends: 2078 [2018-12-02 22:25:13,976 INFO L226 Difference]: Without dead ends: 1204 [2018-12-02 22:25:13,977 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-02 22:25:13,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1204 states. [2018-12-02 22:25:13,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1204 to 1033. [2018-12-02 22:25:13,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1033 states. [2018-12-02 22:25:13,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 1033 states and 1428 transitions. [2018-12-02 22:25:13,999 INFO L78 Accepts]: Start accepts. Automaton has 1033 states and 1428 transitions. Word has length 138 [2018-12-02 22:25:13,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:25:13,999 INFO L480 AbstractCegarLoop]: Abstraction has 1033 states and 1428 transitions. [2018-12-02 22:25:13,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 22:25:13,999 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 1428 transitions. [2018-12-02 22:25:14,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-12-02 22:25:14,001 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:25:14,001 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 22:25:14,001 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:25:14,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:25:14,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1343129801, now seen corresponding path program 1 times [2018-12-02 22:25:14,001 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:25:14,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:25:14,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:25:14,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:25:14,002 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:25:14,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:25:14,071 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:25:14,071 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:25:14,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 22:25:14,071 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 22:25:14,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 22:25:14,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 22:25:14,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 22:25:14,072 INFO L87 Difference]: Start difference. First operand 1033 states and 1428 transitions. Second operand 5 states. [2018-12-02 22:25:14,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:25:14,611 INFO L93 Difference]: Finished difference Result 2235 states and 3131 transitions. [2018-12-02 22:25:14,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 22:25:14,611 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 143 [2018-12-02 22:25:14,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:25:14,616 INFO L225 Difference]: With dead ends: 2235 [2018-12-02 22:25:14,616 INFO L226 Difference]: Without dead ends: 1208 [2018-12-02 22:25:14,617 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-02 22:25:14,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1208 states. [2018-12-02 22:25:14,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1208 to 1043. [2018-12-02 22:25:14,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1043 states. [2018-12-02 22:25:14,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 1434 transitions. [2018-12-02 22:25:14,638 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 1434 transitions. Word has length 143 [2018-12-02 22:25:14,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:25:14,638 INFO L480 AbstractCegarLoop]: Abstraction has 1043 states and 1434 transitions. [2018-12-02 22:25:14,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 22:25:14,639 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1434 transitions. [2018-12-02 22:25:14,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-12-02 22:25:14,640 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:25:14,641 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-02 22:25:14,641 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:25:14,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:25:14,641 INFO L82 PathProgramCache]: Analyzing trace with hash -498295095, now seen corresponding path program 1 times [2018-12-02 22:25:14,641 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:25:14,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:25:14,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:25:14,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:25:14,642 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:25:14,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:25:14,717 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-12-02 22:25:14,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:25:14,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 22:25:14,718 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 22:25:14,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 22:25:14,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 22:25:14,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 22:25:14,718 INFO L87 Difference]: Start difference. First operand 1043 states and 1434 transitions. Second operand 3 states. [2018-12-02 22:25:15,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:25:15,077 INFO L93 Difference]: Finished difference Result 2664 states and 3758 transitions. [2018-12-02 22:25:15,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 22:25:15,078 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 208 [2018-12-02 22:25:15,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:25:15,082 INFO L225 Difference]: With dead ends: 2664 [2018-12-02 22:25:15,082 INFO L226 Difference]: Without dead ends: 1770 [2018-12-02 22:25:15,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 22:25:15,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1770 states. [2018-12-02 22:25:15,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1770 to 1331. [2018-12-02 22:25:15,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1331 states. [2018-12-02 22:25:15,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1331 states to 1331 states and 1800 transitions. [2018-12-02 22:25:15,112 INFO L78 Accepts]: Start accepts. Automaton has 1331 states and 1800 transitions. Word has length 208 [2018-12-02 22:25:15,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:25:15,112 INFO L480 AbstractCegarLoop]: Abstraction has 1331 states and 1800 transitions. [2018-12-02 22:25:15,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 22:25:15,112 INFO L276 IsEmpty]: Start isEmpty. Operand 1331 states and 1800 transitions. [2018-12-02 22:25:15,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-12-02 22:25:15,115 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:25:15,115 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-02 22:25:15,115 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:25:15,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:25:15,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1399381286, now seen corresponding path program 1 times [2018-12-02 22:25:15,115 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:25:15,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:25:15,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:25:15,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:25:15,116 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:25:15,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:25:15,535 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 106 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:25:15,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 22:25:15,536 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 22:25:15,536 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 214 with the following transitions: [2018-12-02 22:25:15,536 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [117], [119], [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], [539], [543], [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], [686], [792], [796], [805], [809], [811], [816], [817], [818], [820], [821] [2018-12-02 22:25:15,540 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 22:25:15,540 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 22:25:17,069 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 22:25:17,069 INFO L272 AbstractInterpreter]: Visited 126 different actions 488 times. Merged at 6 different actions 17 times. Never widened. Performed 5202 root evaluator evaluations with a maximum evaluation depth of 24. Performed 5202 inverse root evaluator evaluations with a maximum inverse evaluation depth of 24. Found 4 fixpoints after 1 different actions. Largest state had 24 variables. [2018-12-02 22:25:17,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:25:17,074 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 22:25:17,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 22:25:17,074 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4750d52d-dd24-4612-ae19-45391c9fd615/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 22:25:17,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:25:17,081 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 22:25:17,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:25:17,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:25:17,171 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 106 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:25:17,171 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 22:25:17,308 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 106 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:25:17,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 22:25:17,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 5, 5] total 17 [2018-12-02 22:25:17,323 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 22:25:17,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-02 22:25:17,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-02 22:25:17,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2018-12-02 22:25:17,324 INFO L87 Difference]: Start difference. First operand 1331 states and 1800 transitions. Second operand 16 states. [2018-12-02 22:25:20,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:25:20,604 INFO L93 Difference]: Finished difference Result 3999 states and 6380 transitions. [2018-12-02 22:25:20,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-02 22:25:20,604 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 213 [2018-12-02 22:25:20,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:25:20,612 INFO L225 Difference]: With dead ends: 3999 [2018-12-02 22:25:20,612 INFO L226 Difference]: Without dead ends: 2817 [2018-12-02 22:25:20,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 499 GetRequests, 445 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 740 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=679, Invalid=2183, Unknown=0, NotChecked=0, Total=2862 [2018-12-02 22:25:20,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2817 states. [2018-12-02 22:25:20,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2817 to 2664. [2018-12-02 22:25:20,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2664 states. [2018-12-02 22:25:20,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2664 states to 2664 states and 3451 transitions. [2018-12-02 22:25:20,675 INFO L78 Accepts]: Start accepts. Automaton has 2664 states and 3451 transitions. Word has length 213 [2018-12-02 22:25:20,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:25:20,675 INFO L480 AbstractCegarLoop]: Abstraction has 2664 states and 3451 transitions. [2018-12-02 22:25:20,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-02 22:25:20,675 INFO L276 IsEmpty]: Start isEmpty. Operand 2664 states and 3451 transitions. [2018-12-02 22:25:20,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-12-02 22:25:20,678 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:25:20,678 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-02 22:25:20,678 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:25:20,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:25:20,678 INFO L82 PathProgramCache]: Analyzing trace with hash -942829970, now seen corresponding path program 1 times [2018-12-02 22:25:20,678 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:25:20,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:25:20,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:25:20,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:25:20,679 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:25:20,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:25:20,774 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 38 proven. 70 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 22:25:20,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 22:25:20,774 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 22:25:20,774 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 218 with the following transitions: [2018-12-02 22:25:20,775 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [117], [119], [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], [514], [515], [519], [523], [527], [531], [535], [539], [543], [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], [686], [792], [796], [805], [809], [811], [816], [817], [818], [820], [821] [2018-12-02 22:25:20,778 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 22:25:20,778 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 22:25:20,836 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-02 22:25:20,837 INFO L272 AbstractInterpreter]: Visited 122 different actions 122 times. Never merged. Never widened. Performed 1198 root evaluator evaluations with a maximum evaluation depth of 10. Performed 1198 inverse root evaluator evaluations with a maximum inverse evaluation depth of 10. Never found a fixpoint. Largest state had 24 variables. [2018-12-02 22:25:20,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:25:20,838 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-02 22:25:21,034 INFO L227 lantSequenceWeakener]: Weakened 208 states. On average, predicates are now at 72.82% of their original sizes. [2018-12-02 22:25:21,034 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-02 22:25:21,054 INFO L418 sIntCurrentIteration]: We unified 216 AI predicates to 216 [2018-12-02 22:25:21,054 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-02 22:25:21,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 22:25:21,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-12-02 22:25:21,055 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 22:25:21,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 22:25:21,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 22:25:21,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 22:25:21,055 INFO L87 Difference]: Start difference. First operand 2664 states and 3451 transitions. Second operand 6 states. [2018-12-02 22:25:23,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:25:23,906 INFO L93 Difference]: Finished difference Result 4890 states and 6371 transitions. [2018-12-02 22:25:23,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 22:25:23,906 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 217 [2018-12-02 22:25:23,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:25:23,910 INFO L225 Difference]: With dead ends: 4890 [2018-12-02 22:25:23,910 INFO L226 Difference]: Without dead ends: 2375 [2018-12-02 22:25:23,913 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 217 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-02 22:25:23,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2375 states. [2018-12-02 22:25:23,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2375 to 2368. [2018-12-02 22:25:23,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2368 states. [2018-12-02 22:25:23,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2368 states to 2368 states and 3047 transitions. [2018-12-02 22:25:23,944 INFO L78 Accepts]: Start accepts. Automaton has 2368 states and 3047 transitions. Word has length 217 [2018-12-02 22:25:23,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:25:23,944 INFO L480 AbstractCegarLoop]: Abstraction has 2368 states and 3047 transitions. [2018-12-02 22:25:23,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 22:25:23,944 INFO L276 IsEmpty]: Start isEmpty. Operand 2368 states and 3047 transitions. [2018-12-02 22:25:23,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-12-02 22:25:23,947 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:25:23,947 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-02 22:25:23,947 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:25:23,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:25:23,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1782157579, now seen corresponding path program 1 times [2018-12-02 22:25:23,947 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:25:23,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:25:23,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:25:23,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:25:23,948 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:25:23,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:25:24,082 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 39 proven. 5 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-12-02 22:25:24,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 22:25:24,082 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 22:25:24,083 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 223 with the following transitions: [2018-12-02 22:25:24,083 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [117], [119], [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], [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], [686], [792], [796], [805], [809], [811], [816], [817], [818], [820], [821] [2018-12-02 22:25:24,086 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 22:25:24,086 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 22:25:24,668 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 22:25:24,669 INFO L272 AbstractInterpreter]: Visited 126 different actions 249 times. Merged at 6 different actions 8 times. Never widened. Performed 2615 root evaluator evaluations with a maximum evaluation depth of 24. Performed 2615 inverse root evaluator evaluations with a maximum inverse evaluation depth of 24. Found 2 fixpoints after 2 different actions. Largest state had 24 variables. [2018-12-02 22:25:24,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:25:24,670 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 22:25:24,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 22:25:24,670 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4750d52d-dd24-4612-ae19-45391c9fd615/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 22:25:24,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:25:24,676 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 22:25:24,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:25:24,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:25:24,813 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 115 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:25:24,813 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 22:25:24,913 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 115 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:25:24,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 22:25:24,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 12 [2018-12-02 22:25:24,928 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 22:25:24,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 22:25:24,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 22:25:24,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-12-02 22:25:24,928 INFO L87 Difference]: Start difference. First operand 2368 states and 3047 transitions. Second operand 11 states. [2018-12-02 22:25:26,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:25:26,042 INFO L93 Difference]: Finished difference Result 6331 states and 8172 transitions. [2018-12-02 22:25:26,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-02 22:25:26,043 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 222 [2018-12-02 22:25:26,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:25:26,047 INFO L225 Difference]: With dead ends: 6331 [2018-12-02 22:25:26,047 INFO L226 Difference]: Without dead ends: 2787 [2018-12-02 22:25:26,050 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 476 GetRequests, 448 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=169, Invalid=431, Unknown=0, NotChecked=0, Total=600 [2018-12-02 22:25:26,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2787 states. [2018-12-02 22:25:26,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2787 to 2213. [2018-12-02 22:25:26,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2213 states. [2018-12-02 22:25:26,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2213 states to 2213 states and 2508 transitions. [2018-12-02 22:25:26,077 INFO L78 Accepts]: Start accepts. Automaton has 2213 states and 2508 transitions. Word has length 222 [2018-12-02 22:25:26,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:25:26,077 INFO L480 AbstractCegarLoop]: Abstraction has 2213 states and 2508 transitions. [2018-12-02 22:25:26,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 22:25:26,077 INFO L276 IsEmpty]: Start isEmpty. Operand 2213 states and 2508 transitions. [2018-12-02 22:25:26,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2018-12-02 22:25:26,079 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:25:26,079 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-02 22:25:26,080 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:25:26,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:25:26,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1063407853, now seen corresponding path program 1 times [2018-12-02 22:25:26,080 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:25:26,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:25:26,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:25:26,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:25:26,080 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:25:26,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:25:26,510 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 44 proven. 109 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:25:26,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 22:25:26,511 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 22:25:26,511 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 259 with the following transitions: [2018-12-02 22:25:26,511 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [117], [119], [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], [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], [679], [683], [686], [792], [796], [805], [809], [811], [816], [817], [818], [820], [821] [2018-12-02 22:25:26,513 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 22:25:26,513 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 22:25:27,712 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 22:25:27,712 INFO L272 AbstractInterpreter]: Visited 126 different actions 368 times. Merged at 6 different actions 12 times. Never widened. Performed 3894 root evaluator evaluations with a maximum evaluation depth of 24. Performed 3894 inverse root evaluator evaluations with a maximum inverse evaluation depth of 24. Found 3 fixpoints after 2 different actions. Largest state had 24 variables. [2018-12-02 22:25:27,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:25:27,714 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 22:25:27,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 22:25:27,714 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4750d52d-dd24-4612-ae19-45391c9fd615/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 22:25:27,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:25:27,730 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 22:25:27,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:25:27,765 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:25:47,360 WARN L180 SmtUtils]: Spent 19.52 s on a formula simplification. DAG size of input: 95 DAG size of output: 53 [2018-12-02 22:25:47,600 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 120 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:25:47,600 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 22:25:52,979 WARN L180 SmtUtils]: Spent 5.15 s on a formula simplification. DAG size of input: 187 DAG size of output: 22 [2018-12-02 22:25:53,037 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-12-02 22:25:53,083 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 26 [2018-12-02 22:25:53,228 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 22:25:53,271 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 22:25:53,316 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 22:25:53,360 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 22:25:53,405 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 22:25:53,453 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 22:25:53,497 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 22:25:53,535 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 22:25:53,577 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 22:25:53,617 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 22:25:53,658 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 22:25:53,700 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 22:25:53,742 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 22:25:53,786 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 22:25:53,836 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 22:25:53,881 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 22:25:53,931 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 22:25:53,974 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 22:25:54,019 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 22:25:54,067 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 22:25:54,110 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 22:25:54,159 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 22:25:54,201 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 22:25:54,244 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 22:25:54,286 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 22:25:54,329 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 22:25:54,372 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 22:25:54,412 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 22:25:54,464 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 22:25:54,507 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 22:25:54,550 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 22:25:54,593 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 22:25:54,638 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 22:25:54,680 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 22:25:54,719 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 22:25:54,760 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 22:25:54,804 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 22:25:54,848 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 22:25:54,888 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 22:25:54,930 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 22:25:54,972 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 22:25:55,018 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 22:25:55,062 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 22:25:55,105 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 22:25:55,148 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 22:25:55,193 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 22:25:55,232 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 22:25:55,271 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 22:25:55,312 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 22:25:55,354 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 22:25:55,395 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 22:25:55,435 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 22:25:55,477 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 22:25:55,523 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 22:25:55,569 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 22:25:55,614 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 22:25:55,657 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 22:25:55,700 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 22:25:55,741 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 22:25:55,782 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 22:25:55,819 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 22:25:55,860 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 22:25:55,906 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 22:25:55,956 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 22:25:55,996 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 22:25:56,039 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 22:25:56,080 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 22:25:56,123 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 22:25:56,165 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 22:25:56,208 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 22:25:56,252 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 22:25:56,296 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 22:25:56,338 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 22:25:56,381 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 22:25:56,423 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 22:25:56,470 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 22:25:56,514 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 22:25:56,558 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 22:25:56,603 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 22:25:56,647 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 22:25:56,687 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 22:25:56,727 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 22:25:56,771 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 22:25:56,813 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 22:25:56,856 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 22:25:56,899 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 22:25:56,945 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 22:25:56,995 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 22:25:57,037 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 22:25:57,083 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 22:25:57,130 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 22:25:57,176 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 22:25:57,221 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 22:25:57,263 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 22:25:57,305 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 22:25:57,347 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 22:25:57,389 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 22:25:57,426 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 22:25:57,467 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 22:25:57,506 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 22:25:57,545 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 22:25:57,585 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 22:25:57,622 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 22:25:57,660 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 22:25:57,704 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 22:25:57,745 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 22:25:57,785 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 22:25:57,828 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 22:25:58,240 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 42 proven. 111 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:25:58,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 22:25:58,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9, 9] total 28 [2018-12-02 22:25:58,255 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 22:25:58,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-02 22:25:58,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-02 22:25:58,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=638, Unknown=0, NotChecked=0, Total=756 [2018-12-02 22:25:58,256 INFO L87 Difference]: Start difference. First operand 2213 states and 2508 transitions. Second operand 21 states. [2018-12-02 22:25:59,026 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 49 [2018-12-02 22:26:00,336 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 31 [2018-12-02 22:26:01,461 WARN L180 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 45 [2018-12-02 22:26:02,103 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 26 [2018-12-02 22:26:25,083 WARN L180 SmtUtils]: Spent 19.05 s on a formula simplification. DAG size of input: 101 DAG size of output: 77 [2018-12-02 22:26:26,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:26:26,043 INFO L93 Difference]: Finished difference Result 4901 states and 5715 transitions. [2018-12-02 22:26:26,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-02 22:26:26,044 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 258 [2018-12-02 22:26:26,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:26:26,049 INFO L225 Difference]: With dead ends: 4901 [2018-12-02 22:26:26,049 INFO L226 Difference]: Without dead ends: 2837 [2018-12-02 22:26:26,052 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 570 GetRequests, 396 SyntacticMatches, 110 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3131 ImplicationChecksByTransitivity, 51.2s TimeCoverageRelationStatistics Valid=926, Invalid=3364, Unknown=0, NotChecked=0, Total=4290 [2018-12-02 22:26:26,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2837 states. [2018-12-02 22:26:26,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2837 to 2809. [2018-12-02 22:26:26,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2809 states. [2018-12-02 22:26:26,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2809 states to 2809 states and 3260 transitions. [2018-12-02 22:26:26,087 INFO L78 Accepts]: Start accepts. Automaton has 2809 states and 3260 transitions. Word has length 258 [2018-12-02 22:26:26,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:26:26,088 INFO L480 AbstractCegarLoop]: Abstraction has 2809 states and 3260 transitions. [2018-12-02 22:26:26,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-02 22:26:26,088 INFO L276 IsEmpty]: Start isEmpty. Operand 2809 states and 3260 transitions. [2018-12-02 22:26:26,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2018-12-02 22:26:26,091 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:26:26,091 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-02 22:26:26,091 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:26:26,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:26:26,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1472655782, now seen corresponding path program 1 times [2018-12-02 22:26:26,092 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 22:26:26,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:26:26,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:26:26,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:26:26,093 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 22:26:26,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 22:26:26,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 22:26:26,164 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 22:26:26,228 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 10:26:26 BoogieIcfgContainer [2018-12-02 22:26:26,228 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 22:26:26,229 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 22:26:26,229 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 22:26:26,229 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 22:26:26,229 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 10:25:11" (3/4) ... [2018-12-02 22:26:26,231 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 22:26:26,309 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_4750d52d-dd24-4612-ae19-45391c9fd615/bin-2019/utaipan/witness.graphml [2018-12-02 22:26:26,309 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 22:26:26,309 INFO L168 Benchmark]: Toolchain (without parser) took 76188.41 ms. Allocated memory was 1.0 GB in the beginning and 2.7 GB in the end (delta: 1.7 GB). Free memory was 945.9 MB in the beginning and 1.4 GB in the end (delta: -452.3 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2018-12-02 22:26:26,310 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 22:26:26,310 INFO L168 Benchmark]: CACSL2BoogieTranslator took 309.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -189.7 MB). Peak memory consumption was 46.8 MB. Max. memory is 11.5 GB. [2018-12-02 22:26:26,310 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.05 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 22:26:26,310 INFO L168 Benchmark]: Boogie Preprocessor took 36.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-12-02 22:26:26,311 INFO L168 Benchmark]: RCFGBuilder took 566.74 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: 97.7 MB). Peak memory consumption was 97.7 MB. Max. memory is 11.5 GB. [2018-12-02 22:26:26,311 INFO L168 Benchmark]: TraceAbstraction took 75167.21 ms. Allocated memory was 1.2 GB in the beginning and 2.7 GB in the end (delta: 1.5 GB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -367.0 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2018-12-02 22:26:26,311 INFO L168 Benchmark]: Witness Printer took 80.06 ms. Allocated memory is still 2.7 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 22:26:26,312 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 309.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -189.7 MB). Peak memory consumption was 46.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 25.05 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 36.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 566.74 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: 97.7 MB). Peak memory consumption was 97.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 75167.21 ms. Allocated memory was 1.2 GB in the beginning and 2.7 GB in the end (delta: 1.5 GB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -367.0 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. * Witness Printer took 80.06 ms. Allocated memory is still 2.7 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 64]: 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, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L210] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L220] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L225] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L231] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L236] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L239] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L244] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L249] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L254] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L260] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L265] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L271] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L277] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L283] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L286] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L291] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L296] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L301] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L306] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L312] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L317] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L320] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L323] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L326] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L329] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L335] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L340] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L345] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L351] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L354] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L357] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L360] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4))))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L365] COND FALSE !(((a4==14) && ((a19==9) && (((( a1 <= -13 && (a10==3)) || (( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 ))) && (input == 3)) && (a12==0))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L370] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L375] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L378] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L383] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L388] COND FALSE !(((a19==9) && ((a4==14) && (((input == 5) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ((a10==3) && a1 <= -13 ))) && (a12==0))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L393] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L398] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L403] COND FALSE !((((a12==0) && ((a19==9) && ((((a10==3) && a1 <= -13 ) || (((a10==2) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==2)))) && (input == 6)))) && (a4==14))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L408] COND FALSE !(((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L414] COND FALSE !((((a10==1) && (((a12==0) && ((a19==10) && (input == 4))) && ((-13 < a1) && (38 >= a1)) )) && (a4==14))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L419] COND FALSE !(((a12==0) && ((a4==14) && ( 218 < a1 && (((a10==1) && (input == 4)) && (a19==10)))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, 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] return 26; VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, \result=26, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L590] RET, EXPR calculate_output(input) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=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=4, 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, \old(input)=4, 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, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, 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)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, a1=518104, a10=0, a12=0, a19=9, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L436] COND TRUE ((a19==9) && ((((input == 4) && (( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 ))) && (a12==0)) && (a4==14))) [L437] a1 = (((((a1 / 5) % 89)- -128) / 5) + 34) [L438] a10 = 0 [L439] a19 = 8 [L441] return -1; VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=4, \result=-1, a1=64, a10=0, a12=0, a19=8, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L590] RET, EXPR calculate_output(input) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=64, a10=0, a12=0, a19=8, a4=14, calculate_output(input)=-1, input=4, 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=64, a10=0, a12=0, a19=8, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=-1] [L590] CALL calculate_output(input) VAL [\old(a1)=64, \old(a10)=0, \old(a19)=8, \old(input)=2, a1=64, a10=0, a12=0, a19=8, 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)=64, \old(a10)=0, \old(a19)=8, \old(input)=2, a1=64, a10=0, a12=0, a19=8, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=64, \old(a10)=0, \old(a19)=8, \old(input)=2, a1=64, a10=0, a12=0, a19=8, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=64, \old(a10)=0, \old(a19)=8, \old(input)=2, a1=64, a10=0, a12=0, a19=8, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=64, \old(a10)=0, \old(a19)=8, \old(input)=2, a1=64, a10=0, a12=0, a19=8, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=64, \old(a10)=0, \old(a19)=8, \old(input)=2, a1=64, a10=0, a12=0, a19=8, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=64, \old(a10)=0, \old(a19)=8, \old(input)=2, a1=64, a10=0, a12=0, a19=8, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=64, \old(a10)=0, \old(a19)=8, \old(input)=2, a1=64, a10=0, a12=0, a19=8, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=64, \old(a10)=0, \old(a19)=8, \old(input)=2, a1=64, a10=0, a12=0, a19=8, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=64, \old(a10)=0, \old(a19)=8, \old(input)=2, a1=64, a10=0, a12=0, a19=8, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=64, \old(a10)=0, \old(a19)=8, \old(input)=2, a1=64, a10=0, a12=0, a19=8, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=64, \old(a10)=0, \old(a19)=8, \old(input)=2, a1=64, a10=0, a12=0, a19=8, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=64, \old(a10)=0, \old(a19)=8, \old(input)=2, a1=64, a10=0, a12=0, a19=8, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=64, \old(a10)=0, \old(a19)=8, \old(input)=2, a1=64, a10=0, a12=0, a19=8, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=64, \old(a10)=0, \old(a19)=8, \old(input)=2, a1=64, a10=0, a12=0, a19=8, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L63] COND TRUE (((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8)) VAL [\old(a1)=64, \old(a10)=0, \old(a19)=8, \old(input)=2, a1=64, a10=0, a12=0, a19=8, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L64] __VERIFIER_error() VAL [\old(a1)=64, \old(a10)=0, \old(a19)=8, \old(input)=2, a1=64, a10=0, a12=0, a19=8, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 215 locations, 1 error locations. UNSAFE Result, 75.1s OverallTime, 11 OverallIterations, 3 TraceHistogramMax, 37.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 757 SDtfs, 6730 SDslu, 699 SDs, 0 SdLazy, 12962 SolverSat, 2549 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 12.3s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 2020 GetRequests, 1722 SyntacticMatches, 127 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3990 ImplicationChecksByTransitivity, 52.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2809occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 3.7s AbstIntTime, 5 AbstIntIterations, 1 AbstIntStrong, 0.9973935786435789 AbsIntWeakeningRatio, 0.12037037037037036 AbsIntAvgWeakeningVarsNumRemoved, 15.305555555555555 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 1545 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 32.0s InterpolantComputationTime, 2704 NumberOfCodeBlocks, 2704 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 3207 ConstructedInterpolants, 124 QuantifiedInterpolants, 8002613 SizeOfPredicates, 11 NumberOfNonLiveVariables, 1461 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 18 InterpolantComputations, 7 PerfectInterpolantSequences, 1123/1468 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...