./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem11_label34_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_3b733fc8-71c0-44ae-a0fa-d7eda32f6f5e/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3b733fc8-71c0-44ae-a0fa-d7eda32f6f5e/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3b733fc8-71c0-44ae-a0fa-d7eda32f6f5e/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3b733fc8-71c0-44ae-a0fa-d7eda32f6f5e/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem11_label34_false-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_3b733fc8-71c0-44ae-a0fa-d7eda32f6f5e/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3b733fc8-71c0-44ae-a0fa-d7eda32f6f5e/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 e90b42bc6d1c81437da93cd8e9907ec68a3f9573 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-08 20:40:24,919 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 20:40:24,921 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 20:40:24,929 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 20:40:24,929 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 20:40:24,930 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 20:40:24,931 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 20:40:24,932 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 20:40:24,933 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 20:40:24,934 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 20:40:24,934 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 20:40:24,934 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 20:40:24,935 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 20:40:24,936 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 20:40:24,936 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 20:40:24,937 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 20:40:24,937 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 20:40:24,939 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 20:40:24,940 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 20:40:24,941 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 20:40:24,942 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 20:40:24,942 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 20:40:24,944 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 20:40:24,944 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 20:40:24,944 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 20:40:24,945 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 20:40:24,945 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 20:40:24,946 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 20:40:24,947 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 20:40:24,947 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 20:40:24,947 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 20:40:24,948 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 20:40:24,948 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 20:40:24,948 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 20:40:24,949 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 20:40:24,949 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 20:40:24,949 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3b733fc8-71c0-44ae-a0fa-d7eda32f6f5e/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-08 20:40:24,959 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 20:40:24,959 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 20:40:24,960 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 20:40:24,960 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 20:40:24,960 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-08 20:40:24,960 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-08 20:40:24,961 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-08 20:40:24,961 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-08 20:40:24,961 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-08 20:40:24,961 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-08 20:40:24,961 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-08 20:40:24,961 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-08 20:40:24,961 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-08 20:40:24,962 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 20:40:24,962 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 20:40:24,962 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 20:40:24,962 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 20:40:24,962 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 20:40:24,962 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-08 20:40:24,962 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 20:40:24,963 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-08 20:40:24,963 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 20:40:24,963 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 20:40:24,963 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-08 20:40:24,963 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 20:40:24,963 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 20:40:24,963 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 20:40:24,963 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 20:40:24,963 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 20:40:24,963 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 20:40:24,964 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 20:40:24,964 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-08 20:40:24,964 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-08 20:40:24,964 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 20:40:24,964 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-08 20:40:24,964 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-08 20:40:24,964 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_3b733fc8-71c0-44ae-a0fa-d7eda32f6f5e/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 -> e90b42bc6d1c81437da93cd8e9907ec68a3f9573 [2018-12-08 20:40:24,986 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 20:40:24,995 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 20:40:24,997 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 20:40:24,998 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 20:40:24,999 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 20:40:24,999 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3b733fc8-71c0-44ae-a0fa-d7eda32f6f5e/bin-2019/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem11_label34_false-unreach-call.c [2018-12-08 20:40:25,041 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3b733fc8-71c0-44ae-a0fa-d7eda32f6f5e/bin-2019/utaipan/data/3d140f3e4/87f903be05264721a6dcac9e10578121/FLAG63beb5a29 [2018-12-08 20:40:25,419 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 20:40:25,419 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3b733fc8-71c0-44ae-a0fa-d7eda32f6f5e/sv-benchmarks/c/eca-rers2012/Problem11_label34_false-unreach-call.c [2018-12-08 20:40:25,426 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3b733fc8-71c0-44ae-a0fa-d7eda32f6f5e/bin-2019/utaipan/data/3d140f3e4/87f903be05264721a6dcac9e10578121/FLAG63beb5a29 [2018-12-08 20:40:25,786 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3b733fc8-71c0-44ae-a0fa-d7eda32f6f5e/bin-2019/utaipan/data/3d140f3e4/87f903be05264721a6dcac9e10578121 [2018-12-08 20:40:25,792 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 20:40:25,794 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 20:40:25,796 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 20:40:25,796 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 20:40:25,803 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 20:40:25,804 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 08:40:25" (1/1) ... [2018-12-08 20:40:25,809 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bf82b32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:40:25, skipping insertion in model container [2018-12-08 20:40:25,810 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 08:40:25" (1/1) ... [2018-12-08 20:40:25,818 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 20:40:25,848 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 20:40:26,076 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 20:40:26,079 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 20:40:26,232 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 20:40:26,242 INFO L195 MainTranslator]: Completed translation [2018-12-08 20:40:26,242 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:40:26 WrapperNode [2018-12-08 20:40:26,242 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 20:40:26,243 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 20:40:26,243 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 20:40:26,243 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 20:40:26,248 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:40:26" (1/1) ... [2018-12-08 20:40:26,264 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:40:26" (1/1) ... [2018-12-08 20:40:26,270 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 20:40:26,270 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 20:40:26,270 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 20:40:26,270 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 20:40:26,277 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:40:26" (1/1) ... [2018-12-08 20:40:26,277 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:40:26" (1/1) ... [2018-12-08 20:40:26,282 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:40:26" (1/1) ... [2018-12-08 20:40:26,282 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:40:26" (1/1) ... [2018-12-08 20:40:26,311 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:40:26" (1/1) ... [2018-12-08 20:40:26,321 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:40:26" (1/1) ... [2018-12-08 20:40:26,326 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:40:26" (1/1) ... [2018-12-08 20:40:26,333 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 20:40:26,334 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 20:40:26,334 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 20:40:26,334 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 20:40:26,335 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:40:26" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3b733fc8-71c0-44ae-a0fa-d7eda32f6f5e/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-08 20:40:26,378 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-08 20:40:26,378 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-08 20:40:26,378 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-12-08 20:40:26,378 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-12-08 20:40:26,378 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 20:40:26,378 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 20:40:26,379 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-08 20:40:26,379 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-08 20:40:27,298 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 20:40:27,299 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-08 20:40:27,299 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 08:40:27 BoogieIcfgContainer [2018-12-08 20:40:27,299 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 20:40:27,300 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 20:40:27,300 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 20:40:27,302 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 20:40:27,302 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 08:40:25" (1/3) ... [2018-12-08 20:40:27,302 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5eaff9d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 08:40:27, skipping insertion in model container [2018-12-08 20:40:27,302 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:40:26" (2/3) ... [2018-12-08 20:40:27,303 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5eaff9d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 08:40:27, skipping insertion in model container [2018-12-08 20:40:27,303 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 08:40:27" (3/3) ... [2018-12-08 20:40:27,304 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label34_false-unreach-call.c [2018-12-08 20:40:27,310 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 20:40:27,315 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-08 20:40:27,325 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-08 20:40:27,346 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 20:40:27,346 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-08 20:40:27,346 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 20:40:27,346 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 20:40:27,346 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 20:40:27,346 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 20:40:27,346 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 20:40:27,346 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 20:40:27,361 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states. [2018-12-08 20:40:27,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-08 20:40:27,365 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:40:27,365 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:40:27,367 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:40:27,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:40:27,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1631579171, now seen corresponding path program 1 times [2018-12-08 20:40:27,371 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 20:40:27,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:40:27,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:40:27,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:40:27,402 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 20:40:27,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:40:27,492 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-08 20:40:27,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:40:27,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 20:40:27,493 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 20:40:27,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 20:40:27,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 20:40:27,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-08 20:40:27,507 INFO L87 Difference]: Start difference. First operand 292 states. Second operand 4 states. [2018-12-08 20:40:28,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:40:28,560 INFO L93 Difference]: Finished difference Result 994 states and 1776 transitions. [2018-12-08 20:40:28,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 20:40:28,562 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-12-08 20:40:28,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:40:28,574 INFO L225 Difference]: With dead ends: 994 [2018-12-08 20:40:28,574 INFO L226 Difference]: Without dead ends: 620 [2018-12-08 20:40:28,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-08 20:40:28,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2018-12-08 20:40:28,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 614. [2018-12-08 20:40:28,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2018-12-08 20:40:28,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 908 transitions. [2018-12-08 20:40:28,630 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 908 transitions. Word has length 14 [2018-12-08 20:40:28,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:40:28,631 INFO L480 AbstractCegarLoop]: Abstraction has 614 states and 908 transitions. [2018-12-08 20:40:28,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 20:40:28,631 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 908 transitions. [2018-12-08 20:40:28,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-08 20:40:28,632 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:40:28,633 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-08 20:40:28,633 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:40:28,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:40:28,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1634260565, now seen corresponding path program 1 times [2018-12-08 20:40:28,633 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 20:40:28,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:40:28,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:40:28,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:40:28,634 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 20:40:28,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:40:28,839 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:40:28,839 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:40:28,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 20:40:28,839 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 20:40:28,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 20:40:28,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 20:40:28,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-08 20:40:28,841 INFO L87 Difference]: Start difference. First operand 614 states and 908 transitions. Second operand 7 states. [2018-12-08 20:40:30,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:40:30,038 INFO L93 Difference]: Finished difference Result 1841 states and 2762 transitions. [2018-12-08 20:40:30,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-08 20:40:30,039 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 87 [2018-12-08 20:40:30,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:40:30,043 INFO L225 Difference]: With dead ends: 1841 [2018-12-08 20:40:30,043 INFO L226 Difference]: Without dead ends: 1233 [2018-12-08 20:40:30,045 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2018-12-08 20:40:30,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states. [2018-12-08 20:40:30,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 823. [2018-12-08 20:40:30,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823 states. [2018-12-08 20:40:30,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1139 transitions. [2018-12-08 20:40:30,069 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1139 transitions. Word has length 87 [2018-12-08 20:40:30,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:40:30,069 INFO L480 AbstractCegarLoop]: Abstraction has 823 states and 1139 transitions. [2018-12-08 20:40:30,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 20:40:30,069 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1139 transitions. [2018-12-08 20:40:30,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-12-08 20:40:30,072 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:40:30,072 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:40:30,072 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:40:30,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:40:30,072 INFO L82 PathProgramCache]: Analyzing trace with hash 13471510, now seen corresponding path program 1 times [2018-12-08 20:40:30,073 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 20:40:30,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:40:30,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:40:30,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:40:30,073 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 20:40:30,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:40:30,200 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 14 proven. 68 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-08 20:40:30,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 20:40:30,201 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 20:40:30,201 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 160 with the following transitions: [2018-12-08 20:40:30,203 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [21], [23], [26], [34], [42], [50], [58], [66], [74], [82], [90], [98], [106], [114], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [506], [507], [510], [1084], [1088], [1097], [1101], [1103], [1108], [1109], [1110], [1112], [1113] [2018-12-08 20:40:30,231 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 20:40:30,231 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 20:40:30,602 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-08 20:40:30,603 INFO L272 AbstractInterpreter]: Visited 78 different actions 78 times. Never merged. Never widened. Performed 832 root evaluator evaluations with a maximum evaluation depth of 16. Performed 832 inverse root evaluator evaluations with a maximum inverse evaluation depth of 16. Never found a fixpoint. Largest state had 28 variables. [2018-12-08 20:40:30,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:40:30,608 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-08 20:40:30,962 INFO L227 lantSequenceWeakener]: Weakened 150 states. On average, predicates are now at 72.8% of their original sizes. [2018-12-08 20:40:30,963 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-08 20:40:30,992 INFO L418 sIntCurrentIteration]: We unified 158 AI predicates to 158 [2018-12-08 20:40:30,992 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-08 20:40:30,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 20:40:30,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-12-08 20:40:30,993 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 20:40:30,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 20:40:30,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 20:40:30,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-08 20:40:30,994 INFO L87 Difference]: Start difference. First operand 823 states and 1139 transitions. Second operand 6 states. [2018-12-08 20:40:59,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:40:59,203 INFO L93 Difference]: Finished difference Result 1830 states and 2480 transitions. [2018-12-08 20:40:59,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 20:40:59,204 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 159 [2018-12-08 20:40:59,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:40:59,206 INFO L225 Difference]: With dead ends: 1830 [2018-12-08 20:40:59,207 INFO L226 Difference]: Without dead ends: 1013 [2018-12-08 20:40:59,208 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 159 GetRequests, 154 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-08 20:40:59,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1013 states. [2018-12-08 20:40:59,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1013 to 1012. [2018-12-08 20:40:59,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1012 states. [2018-12-08 20:40:59,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1337 transitions. [2018-12-08 20:40:59,228 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1337 transitions. Word has length 159 [2018-12-08 20:40:59,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:40:59,228 INFO L480 AbstractCegarLoop]: Abstraction has 1012 states and 1337 transitions. [2018-12-08 20:40:59,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 20:40:59,229 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1337 transitions. [2018-12-08 20:40:59,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-12-08 20:40:59,231 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:40:59,231 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 20:40:59,231 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:40:59,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:40:59,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1813306775, now seen corresponding path program 1 times [2018-12-08 20:40:59,232 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 20:40:59,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:40:59,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:40:59,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:40:59,233 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 20:40:59,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:40:59,346 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 20:40:59,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 20:40:59,347 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 20:40:59,347 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 162 with the following transitions: [2018-12-08 20:40:59,347 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [21], [23], [26], [34], [42], [50], [58], [66], [74], [82], [90], [98], [106], [114], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [762], [766], [777], [781], [785], [789], [793], [797], [808], [812], [816], [820], [824], [828], [832], [843], [847], [851], [862], [866], [869], [1084], [1088], [1097], [1101], [1103], [1108], [1109], [1110], [1112], [1113] [2018-12-08 20:40:59,352 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 20:40:59,352 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 20:40:59,547 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-08 20:40:59,547 INFO L272 AbstractInterpreter]: Visited 154 different actions 302 times. Merged at 4 different actions 4 times. Never widened. Performed 4006 root evaluator evaluations with a maximum evaluation depth of 8. Performed 4006 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 1 fixpoints after 1 different actions. Largest state had 28 variables. [2018-12-08 20:40:59,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:40:59,551 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-08 20:40:59,692 INFO L227 lantSequenceWeakener]: Weakened 158 states. On average, predicates are now at 74.67% of their original sizes. [2018-12-08 20:40:59,692 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-08 20:40:59,750 INFO L418 sIntCurrentIteration]: We unified 160 AI predicates to 160 [2018-12-08 20:40:59,750 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-08 20:40:59,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 20:40:59,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [5] total 13 [2018-12-08 20:40:59,750 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 20:40:59,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-08 20:40:59,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-08 20:40:59,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-12-08 20:40:59,751 INFO L87 Difference]: Start difference. First operand 1012 states and 1337 transitions. Second operand 10 states. [2018-12-08 20:41:25,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:41:25,209 INFO L93 Difference]: Finished difference Result 2794 states and 3979 transitions. [2018-12-08 20:41:25,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-08 20:41:25,209 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 161 [2018-12-08 20:41:25,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:41:25,214 INFO L225 Difference]: With dead ends: 2794 [2018-12-08 20:41:25,214 INFO L226 Difference]: Without dead ends: 1977 [2018-12-08 20:41:25,215 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 169 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2018-12-08 20:41:25,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1977 states. [2018-12-08 20:41:25,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1977 to 1969. [2018-12-08 20:41:25,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1969 states. [2018-12-08 20:41:25,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2478 transitions. [2018-12-08 20:41:25,238 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2478 transitions. Word has length 161 [2018-12-08 20:41:25,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:41:25,239 INFO L480 AbstractCegarLoop]: Abstraction has 1969 states and 2478 transitions. [2018-12-08 20:41:25,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-08 20:41:25,239 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2478 transitions. [2018-12-08 20:41:25,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-12-08 20:41:25,240 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:41:25,241 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 20:41:25,241 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:41:25,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:41:25,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1327742716, now seen corresponding path program 1 times [2018-12-08 20:41:25,241 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 20:41:25,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:41:25,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:41:25,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:41:25,242 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 20:41:25,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:41:25,427 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 18 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:41:25,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 20:41:25,428 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 20:41:25,428 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 204 with the following transitions: [2018-12-08 20:41:25,428 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [21], [23], [26], [34], [42], [50], [58], [66], [74], [82], [90], [98], [106], [114], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [510], [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], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [710], [1084], [1088], [1097], [1101], [1103], [1108], [1109], [1110], [1112], [1113] [2018-12-08 20:41:25,430 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 20:41:25,430 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 20:41:25,772 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 20:41:25,772 INFO L272 AbstractInterpreter]: Visited 125 different actions 370 times. Merged at 6 different actions 17 times. Never widened. Performed 4949 root evaluator evaluations with a maximum evaluation depth of 18. Performed 4949 inverse root evaluator evaluations with a maximum inverse evaluation depth of 18. Found 3 fixpoints after 2 different actions. Largest state had 28 variables. [2018-12-08 20:41:25,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:41:25,774 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 20:41:25,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 20:41:25,774 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3b733fc8-71c0-44ae-a0fa-d7eda32f6f5e/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-08 20:41:25,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:41:25,781 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 20:41:25,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:41:25,840 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:41:26,175 WARN L180 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 329 DAG size of output: 31 [2018-12-08 20:41:26,291 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 15 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:41:26,292 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 20:41:26,928 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 15 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:41:26,944 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-08 20:41:26,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 21 [2018-12-08 20:41:26,944 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-08 20:41:26,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-08 20:41:26,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-08 20:41:26,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2018-12-08 20:41:26,945 INFO L87 Difference]: Start difference. First operand 1969 states and 2478 transitions. Second operand 16 states. [2018-12-08 20:41:27,825 WARN L180 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 19 [2018-12-08 20:41:30,634 WARN L180 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2018-12-08 20:41:33,635 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2018-12-08 20:41:36,543 WARN L180 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2018-12-08 20:41:52,358 WARN L180 SmtUtils]: Spent 2.22 s on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2018-12-08 20:41:58,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:41:58,841 INFO L93 Difference]: Finished difference Result 6160 states and 9506 transitions. [2018-12-08 20:41:58,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-12-08 20:41:58,841 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 203 [2018-12-08 20:41:58,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:41:58,853 INFO L225 Difference]: With dead ends: 6160 [2018-12-08 20:41:58,853 INFO L226 Difference]: Without dead ends: 4573 [2018-12-08 20:41:58,857 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 510 GetRequests, 397 SyntacticMatches, 3 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4403 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=1854, Invalid=10578, Unknown=0, NotChecked=0, Total=12432 [2018-12-08 20:41:58,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4573 states. [2018-12-08 20:41:58,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4573 to 4389. [2018-12-08 20:41:58,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4389 states. [2018-12-08 20:41:58,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4389 states to 4389 states and 5700 transitions. [2018-12-08 20:41:58,936 INFO L78 Accepts]: Start accepts. Automaton has 4389 states and 5700 transitions. Word has length 203 [2018-12-08 20:41:58,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:41:58,936 INFO L480 AbstractCegarLoop]: Abstraction has 4389 states and 5700 transitions. [2018-12-08 20:41:58,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-08 20:41:58,936 INFO L276 IsEmpty]: Start isEmpty. Operand 4389 states and 5700 transitions. [2018-12-08 20:41:58,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-12-08 20:41:58,938 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:41:58,938 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 20:41:58,938 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:41:58,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:41:58,938 INFO L82 PathProgramCache]: Analyzing trace with hash -267582160, now seen corresponding path program 1 times [2018-12-08 20:41:58,938 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 20:41:58,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:41:58,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:41:58,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:41:58,939 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 20:41:58,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:41:59,087 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 18 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:41:59,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 20:41:59,087 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 20:41:59,088 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 214 with the following transitions: [2018-12-08 20:41:59,088 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [21], [23], [26], [34], [42], [50], [58], [66], [74], [82], [90], [98], [106], [114], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [510], [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], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [750], [1084], [1088], [1097], [1101], [1103], [1108], [1109], [1110], [1112], [1113] [2018-12-08 20:41:59,090 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 20:41:59,090 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 20:41:59,370 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 20:41:59,370 INFO L272 AbstractInterpreter]: Visited 135 different actions 398 times. Merged at 6 different actions 15 times. Never widened. Performed 5343 root evaluator evaluations with a maximum evaluation depth of 18. Performed 5343 inverse root evaluator evaluations with a maximum inverse evaluation depth of 18. Found 3 fixpoints after 3 different actions. Largest state had 28 variables. [2018-12-08 20:41:59,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:41:59,371 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 20:41:59,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 20:41:59,372 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3b733fc8-71c0-44ae-a0fa-d7eda32f6f5e/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-08 20:41:59,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:41:59,377 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 20:41:59,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:41:59,416 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:41:59,650 WARN L180 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 20 [2018-12-08 20:41:59,745 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 15 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:41:59,745 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 20:42:00,105 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 15 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:42:00,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-08 20:42:00,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 21 [2018-12-08 20:42:00,120 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-08 20:42:00,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-08 20:42:00,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-08 20:42:00,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2018-12-08 20:42:00,121 INFO L87 Difference]: Start difference. First operand 4389 states and 5700 transitions. Second operand 16 states. [2018-12-08 20:42:01,793 WARN L180 SmtUtils]: Spent 859.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 36 [2018-12-08 20:42:03,185 WARN L180 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 32 DAG size of output: 27 [2018-12-08 20:42:03,879 WARN L180 SmtUtils]: Spent 467.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2018-12-08 20:42:04,920 WARN L180 SmtUtils]: Spent 892.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2018-12-08 20:42:06,180 WARN L180 SmtUtils]: Spent 891.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2018-12-08 20:42:07,451 WARN L180 SmtUtils]: Spent 729.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2018-12-08 20:42:07,703 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 17 [2018-12-08 20:42:08,016 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 20 [2018-12-08 20:42:09,011 WARN L180 SmtUtils]: Spent 890.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 31 [2018-12-08 20:42:10,307 WARN L180 SmtUtils]: Spent 882.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 31 [2018-12-08 20:42:12,216 WARN L180 SmtUtils]: Spent 907.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2018-12-08 20:42:14,674 WARN L180 SmtUtils]: Spent 898.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2018-12-08 20:42:18,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:42:18,055 INFO L93 Difference]: Finished difference Result 9574 states and 13701 transitions. [2018-12-08 20:42:18,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-12-08 20:42:18,056 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 213 [2018-12-08 20:42:18,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:42:18,069 INFO L225 Difference]: With dead ends: 9574 [2018-12-08 20:42:18,070 INFO L226 Difference]: Without dead ends: 5569 [2018-12-08 20:42:18,077 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 529 GetRequests, 417 SyntacticMatches, 1 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4454 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=1957, Invalid=10699, Unknown=0, NotChecked=0, Total=12656 [2018-12-08 20:42:18,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5569 states. [2018-12-08 20:42:18,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5569 to 5166. [2018-12-08 20:42:18,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5166 states. [2018-12-08 20:42:18,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5166 states to 5166 states and 6729 transitions. [2018-12-08 20:42:18,161 INFO L78 Accepts]: Start accepts. Automaton has 5166 states and 6729 transitions. Word has length 213 [2018-12-08 20:42:18,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:42:18,161 INFO L480 AbstractCegarLoop]: Abstraction has 5166 states and 6729 transitions. [2018-12-08 20:42:18,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-08 20:42:18,161 INFO L276 IsEmpty]: Start isEmpty. Operand 5166 states and 6729 transitions. [2018-12-08 20:42:18,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-12-08 20:42:18,163 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:42:18,163 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 20:42:18,163 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:42:18,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:42:18,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1680814493, now seen corresponding path program 1 times [2018-12-08 20:42:18,163 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 20:42:18,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:42:18,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:42:18,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:42:18,164 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 20:42:18,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:42:18,214 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-12-08 20:42:18,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:42:18,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 20:42:18,215 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 20:42:18,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 20:42:18,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 20:42:18,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 20:42:18,215 INFO L87 Difference]: Start difference. First operand 5166 states and 6729 transitions. Second operand 3 states. [2018-12-08 20:42:18,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:42:18,802 INFO L93 Difference]: Finished difference Result 12627 states and 17117 transitions. [2018-12-08 20:42:18,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 20:42:18,803 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 214 [2018-12-08 20:42:18,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:42:18,823 INFO L225 Difference]: With dead ends: 12627 [2018-12-08 20:42:18,823 INFO L226 Difference]: Without dead ends: 7845 [2018-12-08 20:42:18,831 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 20:42:18,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7845 states. [2018-12-08 20:42:18,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7845 to 7646. [2018-12-08 20:42:18,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7646 states. [2018-12-08 20:42:18,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7646 states to 7646 states and 9890 transitions. [2018-12-08 20:42:18,916 INFO L78 Accepts]: Start accepts. Automaton has 7646 states and 9890 transitions. Word has length 214 [2018-12-08 20:42:18,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:42:18,916 INFO L480 AbstractCegarLoop]: Abstraction has 7646 states and 9890 transitions. [2018-12-08 20:42:18,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 20:42:18,916 INFO L276 IsEmpty]: Start isEmpty. Operand 7646 states and 9890 transitions. [2018-12-08 20:42:18,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-12-08 20:42:18,918 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:42:18,918 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 20:42:18,918 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:42:18,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:42:18,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1215552756, now seen corresponding path program 1 times [2018-12-08 20:42:18,919 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 20:42:18,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:42:18,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:42:18,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:42:18,919 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 20:42:18,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:42:19,093 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 20 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:42:19,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 20:42:19,093 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 20:42:19,093 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 219 with the following transitions: [2018-12-08 20:42:19,093 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [21], [23], [26], [34], [42], [50], [58], [66], [74], [82], [90], [98], [106], [114], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [510], [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], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [762], [766], [769], [772], [776], [1084], [1088], [1097], [1101], [1103], [1108], [1109], [1110], [1112], [1113] [2018-12-08 20:42:19,095 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 20:42:19,096 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 20:42:19,384 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 20:42:19,384 INFO L272 AbstractInterpreter]: Visited 140 different actions 413 times. Merged at 6 different actions 15 times. Never widened. Performed 5782 root evaluator evaluations with a maximum evaluation depth of 18. Performed 5782 inverse root evaluator evaluations with a maximum inverse evaluation depth of 18. Found 3 fixpoints after 3 different actions. Largest state had 28 variables. [2018-12-08 20:42:19,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:42:19,385 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 20:42:19,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 20:42:19,385 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3b733fc8-71c0-44ae-a0fa-d7eda32f6f5e/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-08 20:42:19,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:42:19,393 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 20:42:19,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:42:19,427 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:42:19,517 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 85 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:42:19,517 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 20:42:19,795 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 15 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:42:19,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-08 20:42:19,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 21 [2018-12-08 20:42:19,810 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-08 20:42:19,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-08 20:42:19,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-08 20:42:19,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2018-12-08 20:42:19,811 INFO L87 Difference]: Start difference. First operand 7646 states and 9890 transitions. Second operand 16 states. [2018-12-08 20:42:24,282 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 23 [2018-12-08 20:42:27,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:42:27,811 INFO L93 Difference]: Finished difference Result 16363 states and 28235 transitions. [2018-12-08 20:42:27,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-08 20:42:27,811 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 218 [2018-12-08 20:42:27,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:42:27,849 INFO L225 Difference]: With dead ends: 16363 [2018-12-08 20:42:27,849 INFO L226 Difference]: Without dead ends: 10828 [2018-12-08 20:42:27,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 494 GetRequests, 427 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1306 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=965, Invalid=3591, Unknown=0, NotChecked=0, Total=4556 [2018-12-08 20:42:27,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10828 states. [2018-12-08 20:42:28,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10828 to 10251. [2018-12-08 20:42:28,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10251 states. [2018-12-08 20:42:28,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10251 states to 10251 states and 13727 transitions. [2018-12-08 20:42:28,082 INFO L78 Accepts]: Start accepts. Automaton has 10251 states and 13727 transitions. Word has length 218 [2018-12-08 20:42:28,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:42:28,082 INFO L480 AbstractCegarLoop]: Abstraction has 10251 states and 13727 transitions. [2018-12-08 20:42:28,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-08 20:42:28,082 INFO L276 IsEmpty]: Start isEmpty. Operand 10251 states and 13727 transitions. [2018-12-08 20:42:28,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-12-08 20:42:28,084 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:42:28,084 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 20:42:28,084 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:42:28,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:42:28,084 INFO L82 PathProgramCache]: Analyzing trace with hash 326215368, now seen corresponding path program 1 times [2018-12-08 20:42:28,084 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 20:42:28,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:42:28,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:42:28,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:42:28,085 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 20:42:28,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:42:28,140 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2018-12-08 20:42:28,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:42:28,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 20:42:28,140 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 20:42:28,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 20:42:28,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 20:42:28,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 20:42:28,140 INFO L87 Difference]: Start difference. First operand 10251 states and 13727 transitions. Second operand 3 states. [2018-12-08 20:42:28,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:42:28,758 INFO L93 Difference]: Finished difference Result 24345 states and 33857 transitions. [2018-12-08 20:42:28,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 20:42:28,759 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 236 [2018-12-08 20:42:28,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:42:28,788 INFO L225 Difference]: With dead ends: 24345 [2018-12-08 20:42:28,788 INFO L226 Difference]: Without dead ends: 14478 [2018-12-08 20:42:28,799 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 20:42:28,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14478 states. [2018-12-08 20:42:28,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14478 to 14067. [2018-12-08 20:42:28,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14067 states. [2018-12-08 20:42:28,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14067 states to 14067 states and 18853 transitions. [2018-12-08 20:42:28,961 INFO L78 Accepts]: Start accepts. Automaton has 14067 states and 18853 transitions. Word has length 236 [2018-12-08 20:42:28,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:42:28,961 INFO L480 AbstractCegarLoop]: Abstraction has 14067 states and 18853 transitions. [2018-12-08 20:42:28,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 20:42:28,961 INFO L276 IsEmpty]: Start isEmpty. Operand 14067 states and 18853 transitions. [2018-12-08 20:42:28,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2018-12-08 20:42:28,964 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:42:28,964 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 20:42:28,964 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:42:28,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:42:28,964 INFO L82 PathProgramCache]: Analyzing trace with hash 739456600, now seen corresponding path program 1 times [2018-12-08 20:42:28,964 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 20:42:28,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:42:28,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:42:28,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:42:28,965 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 20:42:28,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:42:29,033 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-12-08 20:42:29,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:42:29,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 20:42:29,033 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 20:42:29,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 20:42:29,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 20:42:29,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 20:42:29,034 INFO L87 Difference]: Start difference. First operand 14067 states and 18853 transitions. Second operand 3 states. [2018-12-08 20:42:30,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:42:30,014 INFO L93 Difference]: Finished difference Result 30018 states and 40947 transitions. [2018-12-08 20:42:30,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 20:42:30,015 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 241 [2018-12-08 20:42:30,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:42:30,038 INFO L225 Difference]: With dead ends: 30018 [2018-12-08 20:42:30,038 INFO L226 Difference]: Without dead ends: 16145 [2018-12-08 20:42:30,053 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 20:42:30,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16145 states. [2018-12-08 20:42:30,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16145 to 15950. [2018-12-08 20:42:30,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15950 states. [2018-12-08 20:42:30,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15950 states to 15950 states and 21002 transitions. [2018-12-08 20:42:30,236 INFO L78 Accepts]: Start accepts. Automaton has 15950 states and 21002 transitions. Word has length 241 [2018-12-08 20:42:30,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:42:30,236 INFO L480 AbstractCegarLoop]: Abstraction has 15950 states and 21002 transitions. [2018-12-08 20:42:30,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 20:42:30,236 INFO L276 IsEmpty]: Start isEmpty. Operand 15950 states and 21002 transitions. [2018-12-08 20:42:30,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2018-12-08 20:42:30,239 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:42:30,239 INFO L402 BasicCegarLoop]: trace histogram [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, 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] [2018-12-08 20:42:30,239 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:42:30,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:42:30,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1285043417, now seen corresponding path program 1 times [2018-12-08 20:42:30,239 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 20:42:30,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:42:30,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:42:30,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:42:30,240 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 20:42:30,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:42:30,308 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-12-08 20:42:30,309 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:42:30,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 20:42:30,309 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 20:42:30,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 20:42:30,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 20:42:30,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 20:42:30,310 INFO L87 Difference]: Start difference. First operand 15950 states and 21002 transitions. Second operand 3 states. [2018-12-08 20:42:30,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:42:30,955 INFO L93 Difference]: Finished difference Result 31470 states and 42589 transitions. [2018-12-08 20:42:30,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 20:42:30,955 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 283 [2018-12-08 20:42:30,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:42:30,983 INFO L225 Difference]: With dead ends: 31470 [2018-12-08 20:42:30,983 INFO L226 Difference]: Without dead ends: 18017 [2018-12-08 20:42:30,998 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 20:42:31,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18017 states. [2018-12-08 20:42:31,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18017 to 17829. [2018-12-08 20:42:31,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17829 states. [2018-12-08 20:42:31,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17829 states to 17829 states and 23514 transitions. [2018-12-08 20:42:31,183 INFO L78 Accepts]: Start accepts. Automaton has 17829 states and 23514 transitions. Word has length 283 [2018-12-08 20:42:31,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:42:31,183 INFO L480 AbstractCegarLoop]: Abstraction has 17829 states and 23514 transitions. [2018-12-08 20:42:31,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 20:42:31,184 INFO L276 IsEmpty]: Start isEmpty. Operand 17829 states and 23514 transitions. [2018-12-08 20:42:31,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2018-12-08 20:42:31,186 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:42:31,187 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-12-08 20:42:31,187 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:42:31,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:42:31,187 INFO L82 PathProgramCache]: Analyzing trace with hash 920184109, now seen corresponding path program 1 times [2018-12-08 20:42:31,187 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 20:42:31,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:42:31,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:42:31,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:42:31,188 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 20:42:31,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:42:31,389 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 33 proven. 217 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 20:42:31,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 20:42:31,389 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 20:42:31,390 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 300 with the following transitions: [2018-12-08 20:42:31,390 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [21], [23], [26], [34], [42], [50], [58], [66], [74], [82], [90], [98], [106], [114], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [510], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [562], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [750], [1084], [1088], [1097], [1101], [1103], [1108], [1109], [1110], [1112], [1113] [2018-12-08 20:42:31,391 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 20:42:31,391 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 20:42:31,871 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 20:42:31,871 INFO L272 AbstractInterpreter]: Visited 136 different actions 536 times. Merged at 7 different actions 24 times. Never widened. Performed 7453 root evaluator evaluations with a maximum evaluation depth of 18. Performed 7453 inverse root evaluator evaluations with a maximum inverse evaluation depth of 18. Found 7 fixpoints after 2 different actions. Largest state had 28 variables. [2018-12-08 20:42:31,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:42:31,872 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 20:42:31,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 20:42:31,872 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3b733fc8-71c0-44ae-a0fa-d7eda32f6f5e/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-08 20:42:31,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:42:31,878 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 20:42:31,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:42:31,924 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:42:31,999 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 168 proven. 2 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-12-08 20:42:31,999 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 20:42:32,265 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 168 proven. 2 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-12-08 20:42:32,281 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-08 20:42:32,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 5, 5] total 18 [2018-12-08 20:42:32,281 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-08 20:42:32,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-08 20:42:32,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-08 20:42:32,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2018-12-08 20:42:32,282 INFO L87 Difference]: Start difference. First operand 17829 states and 23514 transitions. Second operand 16 states. [2018-12-08 20:42:38,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:42:38,545 INFO L93 Difference]: Finished difference Result 35494 states and 49626 transitions. [2018-12-08 20:42:38,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-12-08 20:42:38,546 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 299 [2018-12-08 20:42:38,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:42:38,583 INFO L225 Difference]: With dead ends: 35494 [2018-12-08 20:42:38,584 INFO L226 Difference]: Without dead ends: 20162 [2018-12-08 20:42:38,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 716 GetRequests, 645 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1601 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=965, Invalid=4291, Unknown=0, NotChecked=0, Total=5256 [2018-12-08 20:42:38,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20162 states. [2018-12-08 20:42:38,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20162 to 18335. [2018-12-08 20:42:38,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18335 states. [2018-12-08 20:42:38,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18335 states to 18335 states and 24045 transitions. [2018-12-08 20:42:38,843 INFO L78 Accepts]: Start accepts. Automaton has 18335 states and 24045 transitions. Word has length 299 [2018-12-08 20:42:38,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:42:38,843 INFO L480 AbstractCegarLoop]: Abstraction has 18335 states and 24045 transitions. [2018-12-08 20:42:38,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-08 20:42:38,844 INFO L276 IsEmpty]: Start isEmpty. Operand 18335 states and 24045 transitions. [2018-12-08 20:42:38,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2018-12-08 20:42:38,847 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:42:38,847 INFO L402 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:42:38,847 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:42:38,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:42:38,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1279902127, now seen corresponding path program 1 times [2018-12-08 20:42:38,847 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 20:42:38,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:42:38,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:42:38,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:42:38,848 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 20:42:38,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:42:38,951 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2018-12-08 20:42:38,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 20:42:38,951 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 20:42:38,951 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 306 with the following transitions: [2018-12-08 20:42:38,951 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [21], [23], [26], [34], [42], [50], [58], [66], [74], [82], [90], [98], [106], [114], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [762], [766], [777], [781], [785], [789], [793], [797], [808], [812], [816], [820], [824], [828], [832], [843], [847], [850], [851], [862], [866], [869], [1084], [1088], [1097], [1101], [1103], [1108], [1109], [1110], [1112], [1113] [2018-12-08 20:42:38,953 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 20:42:38,953 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 20:42:39,176 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 20:42:39,176 INFO L272 AbstractInterpreter]: Visited 156 different actions 613 times. Merged at 6 different actions 21 times. Never widened. Performed 8559 root evaluator evaluations with a maximum evaluation depth of 8. Performed 8559 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 4 fixpoints after 3 different actions. Largest state had 28 variables. [2018-12-08 20:42:39,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:42:39,178 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 20:42:39,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 20:42:39,178 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3b733fc8-71c0-44ae-a0fa-d7eda32f6f5e/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 20:42:39,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:42:39,184 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 20:42:39,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:42:39,225 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:42:39,273 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2018-12-08 20:42:39,273 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 20:42:39,402 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2018-12-08 20:42:39,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-08 20:42:39,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 11 [2018-12-08 20:42:39,417 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 20:42:39,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 20:42:39,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 20:42:39,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-12-08 20:42:39,418 INFO L87 Difference]: Start difference. First operand 18335 states and 24045 transitions. Second operand 6 states. [2018-12-08 20:42:40,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:42:40,759 INFO L93 Difference]: Finished difference Result 44872 states and 59658 transitions. [2018-12-08 20:42:40,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 20:42:40,759 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 305 [2018-12-08 20:42:40,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:42:40,801 INFO L225 Difference]: With dead ends: 44872 [2018-12-08 20:42:40,801 INFO L226 Difference]: Without dead ends: 27888 [2018-12-08 20:42:40,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 620 GetRequests, 609 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-12-08 20:42:40,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27888 states. [2018-12-08 20:42:41,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27888 to 25818. [2018-12-08 20:42:41,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25818 states. [2018-12-08 20:42:41,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25818 states to 25818 states and 33582 transitions. [2018-12-08 20:42:41,162 INFO L78 Accepts]: Start accepts. Automaton has 25818 states and 33582 transitions. Word has length 305 [2018-12-08 20:42:41,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:42:41,163 INFO L480 AbstractCegarLoop]: Abstraction has 25818 states and 33582 transitions. [2018-12-08 20:42:41,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 20:42:41,163 INFO L276 IsEmpty]: Start isEmpty. Operand 25818 states and 33582 transitions. [2018-12-08 20:42:41,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2018-12-08 20:42:41,166 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:42:41,166 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-12-08 20:42:41,166 INFO L423 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:42:41,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:42:41,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1269064905, now seen corresponding path program 1 times [2018-12-08 20:42:41,167 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 20:42:41,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:42:41,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:42:41,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:42:41,167 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 20:42:41,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:42:41,239 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 257 trivial. 0 not checked. [2018-12-08 20:42:41,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:42:41,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 20:42:41,239 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 20:42:41,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 20:42:41,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 20:42:41,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-08 20:42:41,240 INFO L87 Difference]: Start difference. First operand 25818 states and 33582 transitions. Second operand 4 states. [2018-12-08 20:42:42,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:42:42,226 INFO L93 Difference]: Finished difference Result 54220 states and 71639 transitions. [2018-12-08 20:42:42,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 20:42:42,227 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 309 [2018-12-08 20:42:42,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:42:42,273 INFO L225 Difference]: With dead ends: 54220 [2018-12-08 20:42:42,273 INFO L226 Difference]: Without dead ends: 30901 [2018-12-08 20:42:42,294 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-08 20:42:42,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30901 states. [2018-12-08 20:42:42,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30901 to 27137. [2018-12-08 20:42:42,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27137 states. [2018-12-08 20:42:42,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27137 states to 27137 states and 34071 transitions. [2018-12-08 20:42:42,588 INFO L78 Accepts]: Start accepts. Automaton has 27137 states and 34071 transitions. Word has length 309 [2018-12-08 20:42:42,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:42:42,589 INFO L480 AbstractCegarLoop]: Abstraction has 27137 states and 34071 transitions. [2018-12-08 20:42:42,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 20:42:42,589 INFO L276 IsEmpty]: Start isEmpty. Operand 27137 states and 34071 transitions. [2018-12-08 20:42:42,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2018-12-08 20:42:42,593 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:42:42,593 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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] [2018-12-08 20:42:42,593 INFO L423 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:42:42,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:42:42,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1297899456, now seen corresponding path program 1 times [2018-12-08 20:42:42,593 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 20:42:42,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:42:42,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:42:42,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:42:42,594 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 20:42:42,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:42:43,068 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 34 proven. 234 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:42:43,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 20:42:43,068 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 20:42:43,068 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 315 with the following transitions: [2018-12-08 20:42:43,069 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [21], [23], [26], [34], [42], [50], [58], [66], [74], [82], [90], [98], [106], [114], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [510], [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], [626], [629], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [750], [1084], [1088], [1097], [1101], [1103], [1108], [1109], [1110], [1112], [1113] [2018-12-08 20:42:43,070 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 20:42:43,070 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 20:42:43,483 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 20:42:43,483 INFO L272 AbstractInterpreter]: Visited 136 different actions 405 times. Merged at 7 different actions 19 times. Never widened. Performed 5425 root evaluator evaluations with a maximum evaluation depth of 18. Performed 5425 inverse root evaluator evaluations with a maximum inverse evaluation depth of 18. Found 5 fixpoints after 3 different actions. Largest state had 28 variables. [2018-12-08 20:42:43,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:42:43,485 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 20:42:43,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 20:42:43,485 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3b733fc8-71c0-44ae-a0fa-d7eda32f6f5e/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 20:42:43,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:42:43,491 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 20:42:43,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:42:43,540 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:42:49,560 WARN L180 SmtUtils]: Spent 3.93 s on a formula simplification. DAG size of input: 151 DAG size of output: 24 [2018-12-08 20:42:51,044 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 23 proven. 147 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-12-08 20:42:51,044 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 20:42:51,355 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 168 proven. 2 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-12-08 20:42:51,370 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-08 20:42:51,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 8, 5] total 24 [2018-12-08 20:42:51,370 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-08 20:42:51,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-08 20:42:51,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-08 20:42:51,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=464, Unknown=2, NotChecked=0, Total=552 [2018-12-08 20:42:51,371 INFO L87 Difference]: Start difference. First operand 27137 states and 34071 transitions. Second operand 22 states. [2018-12-08 20:43:14,226 WARN L180 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 65 [2018-12-08 20:44:14,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:44:14,437 INFO L93 Difference]: Finished difference Result 61562 states and 78792 transitions. [2018-12-08 20:44:14,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-12-08 20:44:14,438 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 314 [2018-12-08 20:44:14,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:44:14,489 INFO L225 Difference]: With dead ends: 61562 [2018-12-08 20:44:14,489 INFO L226 Difference]: Without dead ends: 34385 [2018-12-08 20:44:14,516 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 727 GetRequests, 620 SyntacticMatches, 3 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3724 ImplicationChecksByTransitivity, 18.3s TimeCoverageRelationStatistics Valid=1554, Invalid=9568, Unknown=8, NotChecked=0, Total=11130 [2018-12-08 20:44:14,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34385 states. [2018-12-08 20:44:14,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34385 to 34032. [2018-12-08 20:44:14,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34032 states. [2018-12-08 20:44:14,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34032 states to 34032 states and 41295 transitions. [2018-12-08 20:44:14,876 INFO L78 Accepts]: Start accepts. Automaton has 34032 states and 41295 transitions. Word has length 314 [2018-12-08 20:44:14,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:44:14,876 INFO L480 AbstractCegarLoop]: Abstraction has 34032 states and 41295 transitions. [2018-12-08 20:44:14,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-08 20:44:14,877 INFO L276 IsEmpty]: Start isEmpty. Operand 34032 states and 41295 transitions. [2018-12-08 20:44:14,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2018-12-08 20:44:14,879 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:44:14,880 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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] [2018-12-08 20:44:14,880 INFO L423 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:44:14,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:44:14,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1630753072, now seen corresponding path program 1 times [2018-12-08 20:44:14,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 20:44:14,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:44:14,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:44:14,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:44:14,880 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 20:44:14,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:44:15,007 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 29 proven. 140 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-08 20:44:15,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 20:44:15,007 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 20:44:15,008 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 321 with the following transitions: [2018-12-08 20:44:15,008 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [21], [23], [26], [34], [42], [50], [58], [66], [74], [82], [90], [98], [106], [114], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [510], [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], [626], [630], [633], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [762], [766], [769], [772], [776], [1084], [1088], [1097], [1101], [1103], [1108], [1109], [1110], [1112], [1113] [2018-12-08 20:44:15,009 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 20:44:15,009 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 20:44:15,275 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 20:44:15,276 INFO L272 AbstractInterpreter]: Visited 141 different actions 419 times. Merged at 7 different actions 18 times. Never widened. Performed 5831 root evaluator evaluations with a maximum evaluation depth of 18. Performed 5831 inverse root evaluator evaluations with a maximum inverse evaluation depth of 18. Found 5 fixpoints after 2 different actions. Largest state had 28 variables. [2018-12-08 20:44:15,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:44:15,278 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 20:44:15,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 20:44:15,278 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3b733fc8-71c0-44ae-a0fa-d7eda32f6f5e/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 20:44:15,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:44:15,284 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 20:44:15,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:44:15,333 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:44:17,997 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 163 proven. 2 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-12-08 20:44:17,997 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 20:44:18,076 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 125 proven. 73 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-12-08 20:44:18,092 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-08 20:44:18,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 5] total 11 [2018-12-08 20:44:18,092 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-08 20:44:18,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-08 20:44:18,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-08 20:44:18,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=74, Unknown=2, NotChecked=0, Total=110 [2018-12-08 20:44:18,093 INFO L87 Difference]: Start difference. First operand 34032 states and 41295 transitions. Second operand 9 states. [2018-12-08 20:44:21,125 WARN L180 SmtUtils]: Spent 2.57 s on a formula simplification. DAG size of input: 27 DAG size of output: 13 [2018-12-08 20:44:34,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:44:34,861 INFO L93 Difference]: Finished difference Result 71146 states and 87869 transitions. [2018-12-08 20:44:34,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-08 20:44:34,862 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 320 [2018-12-08 20:44:34,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:44:34,925 INFO L225 Difference]: With dead ends: 71146 [2018-12-08 20:44:34,925 INFO L226 Difference]: Without dead ends: 39802 [2018-12-08 20:44:34,959 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 672 GetRequests, 647 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=146, Invalid=358, Unknown=2, NotChecked=0, Total=506 [2018-12-08 20:44:34,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39802 states. [2018-12-08 20:44:35,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39802 to 39566. [2018-12-08 20:44:35,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39566 states. [2018-12-08 20:44:35,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39566 states to 39566 states and 46398 transitions. [2018-12-08 20:44:35,387 INFO L78 Accepts]: Start accepts. Automaton has 39566 states and 46398 transitions. Word has length 320 [2018-12-08 20:44:35,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:44:35,387 INFO L480 AbstractCegarLoop]: Abstraction has 39566 states and 46398 transitions. [2018-12-08 20:44:35,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-08 20:44:35,387 INFO L276 IsEmpty]: Start isEmpty. Operand 39566 states and 46398 transitions. [2018-12-08 20:44:35,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2018-12-08 20:44:35,390 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:44:35,390 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:44:35,390 INFO L423 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:44:35,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:44:35,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1932530720, now seen corresponding path program 1 times [2018-12-08 20:44:35,390 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 20:44:35,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:44:35,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:44:35,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:44:35,391 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 20:44:35,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:44:35,711 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 159 proven. 77 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-08 20:44:35,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 20:44:35,711 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 20:44:35,712 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 331 with the following transitions: [2018-12-08 20:44:35,712 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [21], [23], [26], [34], [42], [50], [58], [66], [74], [82], [90], [98], [106], [114], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [506], [507], [510], [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], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [762], [766], [777], [781], [785], [789], [793], [797], [808], [812], [816], [820], [824], [828], [832], [843], [847], [851], [862], [866], [870], [874], [878], [889], [893], [897], [901], [905], [909], [913], [924], [928], [932], [936], [940], [944], [948], [952], [956], [960], [971], [975], [979], [983], [986], [1084], [1088], [1097], [1101], [1103], [1108], [1109], [1110], [1112], [1113] [2018-12-08 20:44:35,714 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 20:44:35,714 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 20:44:36,132 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 20:44:36,133 INFO L272 AbstractInterpreter]: Visited 181 different actions 536 times. Merged at 7 different actions 15 times. Never widened. Performed 7372 root evaluator evaluations with a maximum evaluation depth of 18. Performed 7372 inverse root evaluator evaluations with a maximum inverse evaluation depth of 18. Found 4 fixpoints after 2 different actions. Largest state had 28 variables. [2018-12-08 20:44:36,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:44:36,134 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 20:44:36,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 20:44:36,134 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3b733fc8-71c0-44ae-a0fa-d7eda32f6f5e/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 20:44:36,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:44:36,141 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 20:44:36,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:44:36,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:44:36,269 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 167 proven. 2 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-12-08 20:44:36,269 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 20:44:36,539 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 167 proven. 2 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-12-08 20:44:36,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-08 20:44:36,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 5, 5] total 19 [2018-12-08 20:44:36,554 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-08 20:44:36,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-08 20:44:36,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-08 20:44:36,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2018-12-08 20:44:36,555 INFO L87 Difference]: Start difference. First operand 39566 states and 46398 transitions. Second operand 17 states. [2018-12-08 20:44:39,419 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 28 [2018-12-08 20:44:43,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:44:43,389 INFO L93 Difference]: Finished difference Result 83824 states and 104083 transitions. [2018-12-08 20:44:43,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-08 20:44:43,390 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 330 [2018-12-08 20:44:43,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:44:43,480 INFO L225 Difference]: With dead ends: 83824 [2018-12-08 20:44:43,480 INFO L226 Difference]: Without dead ends: 43991 [2018-12-08 20:44:43,525 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 732 GetRequests, 676 SyntacticMatches, 4 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 732 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=596, Invalid=2266, Unknown=0, NotChecked=0, Total=2862 [2018-12-08 20:44:43,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43991 states. [2018-12-08 20:44:44,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43991 to 40850. [2018-12-08 20:44:44,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40850 states. [2018-12-08 20:44:44,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40850 states to 40850 states and 46538 transitions. [2018-12-08 20:44:44,095 INFO L78 Accepts]: Start accepts. Automaton has 40850 states and 46538 transitions. Word has length 330 [2018-12-08 20:44:44,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:44:44,096 INFO L480 AbstractCegarLoop]: Abstraction has 40850 states and 46538 transitions. [2018-12-08 20:44:44,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-08 20:44:44,096 INFO L276 IsEmpty]: Start isEmpty. Operand 40850 states and 46538 transitions. [2018-12-08 20:44:44,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2018-12-08 20:44:44,100 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:44:44,100 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-08 20:44:44,100 INFO L423 AbstractCegarLoop]: === Iteration 18 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:44:44,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:44:44,100 INFO L82 PathProgramCache]: Analyzing trace with hash 192064095, now seen corresponding path program 1 times [2018-12-08 20:44:44,100 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 20:44:44,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:44:44,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:44:44,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:44:44,101 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 20:44:44,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:44:44,482 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 216 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:44:44,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 20:44:44,482 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 20:44:44,482 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 357 with the following transitions: [2018-12-08 20:44:44,482 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [21], [23], [26], [34], [42], [50], [58], [66], [74], [82], [90], [98], [106], [114], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [510], [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], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [762], [766], [769], [772], [776], [777], [781], [785], [789], [793], [797], [808], [812], [816], [819], [1084], [1088], [1097], [1101], [1103], [1108], [1109], [1110], [1112], [1113] [2018-12-08 20:44:44,484 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 20:44:44,484 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 20:44:44,808 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 20:44:44,808 INFO L272 AbstractInterpreter]: Visited 150 different actions 450 times. Merged at 7 different actions 22 times. Never widened. Performed 6331 root evaluator evaluations with a maximum evaluation depth of 18. Performed 6331 inverse root evaluator evaluations with a maximum inverse evaluation depth of 18. Found 5 fixpoints after 3 different actions. Largest state had 28 variables. [2018-12-08 20:44:44,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:44:44,809 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 20:44:44,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 20:44:44,810 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3b733fc8-71c0-44ae-a0fa-d7eda32f6f5e/bin-2019/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 20:44:44,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:44:44,815 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 20:44:44,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:44:44,864 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:44:45,866 WARN L180 SmtUtils]: Spent 846.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 45 [2018-12-08 20:44:46,105 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 149 proven. 147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:44:46,105 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 20:44:46,763 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 216 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:44:46,778 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-08 20:44:46,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 11] total 32 [2018-12-08 20:44:46,778 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-08 20:44:46,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-08 20:44:46,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-08 20:44:46,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=847, Unknown=0, NotChecked=0, Total=992 [2018-12-08 20:44:46,779 INFO L87 Difference]: Start difference. First operand 40850 states and 46538 transitions. Second operand 25 states. [2018-12-08 20:44:48,216 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2018-12-08 20:44:51,228 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2018-12-08 20:44:52,143 WARN L180 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 40 [2018-12-08 20:44:52,563 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 35 [2018-12-08 20:44:53,141 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2018-12-08 20:44:53,800 WARN L180 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 45 [2018-12-08 20:44:54,935 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 39 [2018-12-08 20:44:55,313 WARN L180 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2018-12-08 20:44:57,680 WARN L180 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2018-12-08 20:44:58,354 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 33 [2018-12-08 20:44:59,370 WARN L180 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2018-12-08 20:45:02,009 WARN L180 SmtUtils]: Spent 892.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2018-12-08 20:45:05,871 WARN L180 SmtUtils]: Spent 917.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 61 [2018-12-08 20:45:07,103 WARN L180 SmtUtils]: Spent 924.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 65 [2018-12-08 20:45:08,272 WARN L180 SmtUtils]: Spent 874.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2018-12-08 20:45:09,257 WARN L180 SmtUtils]: Spent 881.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 60 [2018-12-08 20:45:11,500 WARN L180 SmtUtils]: Spent 895.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2018-12-08 20:45:12,776 WARN L180 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 44 [2018-12-08 20:45:13,224 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2018-12-08 20:45:13,507 WARN L180 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 43 [2018-12-08 20:45:13,890 WARN L180 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 38 [2018-12-08 20:45:14,258 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 23 [2018-12-08 20:45:14,665 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 30 [2018-12-08 20:45:15,600 WARN L180 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2018-12-08 20:45:16,369 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 29 [2018-12-08 20:45:19,063 WARN L180 SmtUtils]: Spent 863.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 55 [2018-12-08 20:45:19,935 WARN L180 SmtUtils]: Spent 851.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 55 [2018-12-08 20:45:25,071 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 39 [2018-12-08 20:45:27,312 WARN L180 SmtUtils]: Spent 1.00 s on a formula simplification. DAG size of input: 74 DAG size of output: 61 [2018-12-08 20:45:28,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:45:28,032 INFO L93 Difference]: Finished difference Result 86465 states and 102404 transitions. [2018-12-08 20:45:28,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2018-12-08 20:45:28,033 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 356 [2018-12-08 20:45:28,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:45:28,122 INFO L225 Difference]: With dead ends: 86465 [2018-12-08 20:45:28,122 INFO L226 Difference]: Without dead ends: 45999 [2018-12-08 20:45:28,166 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 875 GetRequests, 708 SyntacticMatches, 4 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9939 ImplicationChecksByTransitivity, 19.4s TimeCoverageRelationStatistics Valid=4280, Invalid=22780, Unknown=0, NotChecked=0, Total=27060 [2018-12-08 20:45:28,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45999 states. [2018-12-08 20:45:28,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45999 to 42144. [2018-12-08 20:45:28,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42144 states. [2018-12-08 20:45:28,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42144 states to 42144 states and 46963 transitions. [2018-12-08 20:45:28,749 INFO L78 Accepts]: Start accepts. Automaton has 42144 states and 46963 transitions. Word has length 356 [2018-12-08 20:45:28,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:45:28,750 INFO L480 AbstractCegarLoop]: Abstraction has 42144 states and 46963 transitions. [2018-12-08 20:45:28,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-08 20:45:28,750 INFO L276 IsEmpty]: Start isEmpty. Operand 42144 states and 46963 transitions. [2018-12-08 20:45:28,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2018-12-08 20:45:28,754 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:45:28,754 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-12-08 20:45:28,754 INFO L423 AbstractCegarLoop]: === Iteration 19 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:45:28,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:45:28,755 INFO L82 PathProgramCache]: Analyzing trace with hash 696011543, now seen corresponding path program 1 times [2018-12-08 20:45:28,755 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 20:45:28,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:45:28,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:45:28,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:45:28,756 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 20:45:28,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:45:28,928 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 199 proven. 221 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-12-08 20:45:28,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 20:45:28,928 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 20:45:28,928 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 371 with the following transitions: [2018-12-08 20:45:28,928 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [21], [23], [26], [34], [42], [50], [58], [66], [74], [82], [90], [98], [106], [114], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [510], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [550], [551], [554], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [710], [1084], [1088], [1097], [1101], [1103], [1108], [1109], [1110], [1112], [1113] [2018-12-08 20:45:28,929 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 20:45:28,929 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 20:45:29,280 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 20:45:29,281 INFO L272 AbstractInterpreter]: Visited 127 different actions 379 times. Merged at 7 different actions 20 times. Never widened. Performed 5018 root evaluator evaluations with a maximum evaluation depth of 18. Performed 5018 inverse root evaluator evaluations with a maximum inverse evaluation depth of 18. Found 5 fixpoints after 3 different actions. Largest state had 28 variables. [2018-12-08 20:45:29,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:45:29,282 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 20:45:29,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 20:45:29,282 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3b733fc8-71c0-44ae-a0fa-d7eda32f6f5e/bin-2019/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 20:45:29,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:45:29,289 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 20:45:29,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:45:29,340 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:45:29,400 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 406 proven. 2 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2018-12-08 20:45:29,400 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 20:45:29,470 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 203 proven. 73 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2018-12-08 20:45:29,485 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-08 20:45:29,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2018-12-08 20:45:29,486 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-08 20:45:29,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 20:45:29,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 20:45:29,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-12-08 20:45:29,486 INFO L87 Difference]: Start difference. First operand 42144 states and 46963 transitions. Second operand 7 states. [2018-12-08 20:45:30,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:45:30,598 INFO L93 Difference]: Finished difference Result 81850 states and 92016 transitions. [2018-12-08 20:45:30,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 20:45:30,599 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 370 [2018-12-08 20:45:30,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:45:30,656 INFO L225 Difference]: With dead ends: 81850 [2018-12-08 20:45:30,656 INFO L226 Difference]: Without dead ends: 42002 [2018-12-08 20:45:30,689 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 751 GetRequests, 740 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-12-08 20:45:30,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42002 states. [2018-12-08 20:45:31,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42002 to 41374. [2018-12-08 20:45:31,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41374 states. [2018-12-08 20:45:31,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41374 states to 41374 states and 45840 transitions. [2018-12-08 20:45:31,178 INFO L78 Accepts]: Start accepts. Automaton has 41374 states and 45840 transitions. Word has length 370 [2018-12-08 20:45:31,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:45:31,178 INFO L480 AbstractCegarLoop]: Abstraction has 41374 states and 45840 transitions. [2018-12-08 20:45:31,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 20:45:31,179 INFO L276 IsEmpty]: Start isEmpty. Operand 41374 states and 45840 transitions. [2018-12-08 20:45:31,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2018-12-08 20:45:31,182 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:45:31,182 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:45:31,182 INFO L423 AbstractCegarLoop]: === Iteration 20 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:45:31,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:45:31,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1672579873, now seen corresponding path program 1 times [2018-12-08 20:45:31,182 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 20:45:31,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:45:31,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:45:31,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:45:31,183 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 20:45:31,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:45:31,292 INFO L134 CoverageAnalysis]: Checked inductivity of 502 backedges. 208 proven. 73 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2018-12-08 20:45:31,292 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 20:45:31,292 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 20:45:31,292 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 375 with the following transitions: [2018-12-08 20:45:31,292 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [21], [23], [26], [34], [42], [50], [58], [66], [74], [82], [90], [98], [106], [114], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [510], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [554], [555], [559], [563], [566], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [710], [1084], [1088], [1097], [1101], [1103], [1108], [1109], [1110], [1112], [1113] [2018-12-08 20:45:31,293 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 20:45:31,293 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 20:45:31,631 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 20:45:31,631 INFO L272 AbstractInterpreter]: Visited 127 different actions 380 times. Merged at 8 different actions 21 times. Never widened. Performed 5054 root evaluator evaluations with a maximum evaluation depth of 18. Performed 5054 inverse root evaluator evaluations with a maximum inverse evaluation depth of 18. Found 7 fixpoints after 4 different actions. Largest state had 28 variables. [2018-12-08 20:45:31,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:45:31,633 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 20:45:31,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 20:45:31,633 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3b733fc8-71c0-44ae-a0fa-d7eda32f6f5e/bin-2019/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 20:45:31,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:45:31,639 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 20:45:31,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:45:31,690 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:45:31,798 INFO L134 CoverageAnalysis]: Checked inductivity of 502 backedges. 251 proven. 2 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2018-12-08 20:45:31,798 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 20:45:31,958 INFO L134 CoverageAnalysis]: Checked inductivity of 502 backedges. 251 proven. 2 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2018-12-08 20:45:31,973 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-08 20:45:31,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2018-12-08 20:45:31,974 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-08 20:45:31,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-08 20:45:31,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-08 20:45:31,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-12-08 20:45:31,974 INFO L87 Difference]: Start difference. First operand 41374 states and 45840 transitions. Second operand 9 states. [2018-12-08 20:45:37,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:45:37,597 INFO L93 Difference]: Finished difference Result 89839 states and 100119 transitions. [2018-12-08 20:45:37,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-08 20:45:37,597 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 374 [2018-12-08 20:45:37,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:45:37,659 INFO L225 Difference]: With dead ends: 89839 [2018-12-08 20:45:37,659 INFO L226 Difference]: Without dead ends: 48081 [2018-12-08 20:45:37,691 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 807 GetRequests, 771 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=303, Invalid=1103, Unknown=0, NotChecked=0, Total=1406 [2018-12-08 20:45:37,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48081 states. [2018-12-08 20:45:38,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48081 to 38440. [2018-12-08 20:45:38,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38440 states. [2018-12-08 20:45:38,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38440 states to 38440 states and 42060 transitions. [2018-12-08 20:45:38,194 INFO L78 Accepts]: Start accepts. Automaton has 38440 states and 42060 transitions. Word has length 374 [2018-12-08 20:45:38,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:45:38,195 INFO L480 AbstractCegarLoop]: Abstraction has 38440 states and 42060 transitions. [2018-12-08 20:45:38,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-08 20:45:38,195 INFO L276 IsEmpty]: Start isEmpty. Operand 38440 states and 42060 transitions. [2018-12-08 20:45:38,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2018-12-08 20:45:38,199 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:45:38,199 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-08 20:45:38,199 INFO L423 AbstractCegarLoop]: === Iteration 21 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:45:38,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:45:38,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1980121018, now seen corresponding path program 1 times [2018-12-08 20:45:38,199 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 20:45:38,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:45:38,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:45:38,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:45:38,200 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 20:45:38,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:45:38,468 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 171 proven. 141 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-08 20:45:38,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 20:45:38,468 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 20:45:38,468 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 401 with the following transitions: [2018-12-08 20:45:38,468 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [21], [23], [26], [34], [42], [50], [58], [66], [74], [82], [90], [98], [106], [114], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [510], [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], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [762], [766], [777], [781], [785], [789], [793], [797], [808], [812], [816], [820], [824], [828], [832], [843], [847], [851], [862], [866], [869], [870], [874], [878], [889], [893], [897], [901], [905], [909], [913], [924], [928], [932], [936], [940], [944], [948], [952], [956], [959], [1084], [1088], [1097], [1101], [1103], [1108], [1109], [1110], [1112], [1113] [2018-12-08 20:45:38,470 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 20:45:38,470 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 20:45:44,479 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 20:45:44,480 INFO L272 AbstractInterpreter]: Visited 176 different actions 525 times. Merged at 7 different actions 19 times. Never widened. Performed 7409 root evaluator evaluations with a maximum evaluation depth of 23. Performed 7409 inverse root evaluator evaluations with a maximum inverse evaluation depth of 23. Found 5 fixpoints after 3 different actions. Largest state had 28 variables. [2018-12-08 20:45:44,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:45:44,481 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 20:45:44,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 20:45:44,481 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3b733fc8-71c0-44ae-a0fa-d7eda32f6f5e/bin-2019/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 20:45:44,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:45:44,487 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 20:45:44,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:45:44,539 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:45:44,927 WARN L854 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_112 Int)) (let ((.cse0 (mod (+ v_prenex_112 69157) 299861))) (and (= .cse0 0) (<= |c_old(~a29~0)| v_prenex_112) (<= c_~a29~0 (+ .cse0 300138))))) (exists ((v_~a29~0_728 Int)) (let ((.cse2 (+ v_~a29~0_728 69157))) (let ((.cse1 (mod .cse2 299861))) (and (not (= .cse1 0)) (< .cse2 0) (<= c_~a29~0 (+ .cse1 277)) (<= |c_old(~a29~0)| v_~a29~0_728))))) (exists ((v_prenex_111 Int)) (let ((.cse3 (+ v_prenex_111 69157))) (and (<= |c_old(~a29~0)| v_prenex_111) (<= 0 .cse3) (<= c_~a29~0 (+ (mod .cse3 299861) 300138)))))) is different from true [2018-12-08 20:45:45,111 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 94 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2018-12-08 20:45:45,111 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 20:45:45,544 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 237 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:45:45,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-08 20:45:45,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 8] total 25 [2018-12-08 20:45:45,560 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-08 20:45:45,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-08 20:45:45,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-08 20:45:45,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=462, Unknown=1, NotChecked=44, Total=600 [2018-12-08 20:45:45,560 INFO L87 Difference]: Start difference. First operand 38440 states and 42060 transitions. Second operand 20 states. [2018-12-08 20:45:48,082 WARN L180 SmtUtils]: Spent 949.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 17 [2018-12-08 20:45:51,047 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 30 [2018-12-08 20:45:53,032 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 31 [2018-12-08 20:45:53,280 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2018-12-08 20:45:58,676 WARN L180 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 46 DAG size of output: 11 [2018-12-08 20:46:04,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:46:04,328 INFO L93 Difference]: Finished difference Result 78372 states and 86457 transitions. [2018-12-08 20:46:04,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-12-08 20:46:04,329 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 400 [2018-12-08 20:46:04,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:46:04,385 INFO L225 Difference]: With dead ends: 78372 [2018-12-08 20:46:04,385 INFO L226 Difference]: Without dead ends: 42638 [2018-12-08 20:46:04,416 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 889 GetRequests, 789 SyntacticMatches, 4 SemanticMatches, 96 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2964 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=1541, Invalid=7769, Unknown=6, NotChecked=190, Total=9506 [2018-12-08 20:46:04,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42638 states. [2018-12-08 20:46:04,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42638 to 40905. [2018-12-08 20:46:04,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40905 states. [2018-12-08 20:46:04,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40905 states to 40905 states and 44637 transitions. [2018-12-08 20:46:04,933 INFO L78 Accepts]: Start accepts. Automaton has 40905 states and 44637 transitions. Word has length 400 [2018-12-08 20:46:04,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:46:04,933 INFO L480 AbstractCegarLoop]: Abstraction has 40905 states and 44637 transitions. [2018-12-08 20:46:04,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-08 20:46:04,933 INFO L276 IsEmpty]: Start isEmpty. Operand 40905 states and 44637 transitions. [2018-12-08 20:46:04,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2018-12-08 20:46:04,938 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:46:04,938 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-08 20:46:04,938 INFO L423 AbstractCegarLoop]: === Iteration 22 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:46:04,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:46:04,939 INFO L82 PathProgramCache]: Analyzing trace with hash -920905034, now seen corresponding path program 1 times [2018-12-08 20:46:04,939 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 20:46:04,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:46:04,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:46:04,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:46:04,939 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 20:46:04,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:46:04,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:46:05,044 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-08 20:46:05,127 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.12 08:46:05 BoogieIcfgContainer [2018-12-08 20:46:05,127 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-08 20:46:05,127 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 20:46:05,127 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 20:46:05,128 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 20:46:05,128 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 08:40:27" (3/4) ... [2018-12-08 20:46:05,129 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-08 20:46:05,220 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_3b733fc8-71c0-44ae-a0fa-d7eda32f6f5e/bin-2019/utaipan/witness.graphml [2018-12-08 20:46:05,220 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 20:46:05,221 INFO L168 Benchmark]: Toolchain (without parser) took 339428.42 ms. Allocated memory was 1.0 GB in the beginning and 4.3 GB in the end (delta: 3.3 GB). Free memory was 945.9 MB in the beginning and 1.8 GB in the end (delta: -870.7 MB). Peak memory consumption was 2.4 GB. Max. memory is 11.5 GB. [2018-12-08 20:46:05,221 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 20:46:05,221 INFO L168 Benchmark]: CACSL2BoogieTranslator took 446.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -151.6 MB). Peak memory consumption was 58.5 MB. Max. memory is 11.5 GB. [2018-12-08 20:46:05,221 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.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-08 20:46:05,221 INFO L168 Benchmark]: Boogie Preprocessor took 63.27 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: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-12-08 20:46:05,222 INFO L168 Benchmark]: RCFGBuilder took 965.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 913.1 MB in the end (delta: 170.1 MB). Peak memory consumption was 170.1 MB. Max. memory is 11.5 GB. [2018-12-08 20:46:05,222 INFO L168 Benchmark]: TraceAbstraction took 337827.57 ms. Allocated memory was 1.2 GB in the beginning and 4.3 GB in the end (delta: 3.2 GB). Free memory was 913.1 MB in the beginning and 1.9 GB in the end (delta: -969.4 MB). Peak memory consumption was 2.2 GB. Max. memory is 11.5 GB. [2018-12-08 20:46:05,222 INFO L168 Benchmark]: Witness Printer took 92.69 ms. Allocated memory is still 4.3 GB. Free memory was 1.9 GB in the beginning and 1.8 GB in the end (delta: 65.9 MB). Peak memory consumption was 65.9 MB. Max. memory is 11.5 GB. [2018-12-08 20:46:05,223 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 446.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -151.6 MB). Peak memory consumption was 58.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 27.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 63.27 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: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 965.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 913.1 MB in the end (delta: 170.1 MB). Peak memory consumption was 170.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 337827.57 ms. Allocated memory was 1.2 GB in the beginning and 4.3 GB in the end (delta: 3.2 GB). Free memory was 913.1 MB in the beginning and 1.9 GB in the end (delta: -969.4 MB). Peak memory consumption was 2.2 GB. Max. memory is 11.5 GB. * Witness Printer took 92.69 ms. Allocated memory is still 4.3 GB. Free memory was 1.9 GB in the beginning and 1.8 GB in the end (delta: 65.9 MB). Peak memory consumption was 65.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 30]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L7] int inputA = 1; [L8] int inputD = 4; [L9] int inputB = 2; [L10] int inputE = 5; [L11] int inputF = 6; [L12] int inputC = 3; [L15] int a29 = 130; [L16] int a4 = 1; [L17] int a23 = 312; [L18] int a8 = 15; [L19] int a25 = 10; [L20] int a3 = 1; VAL [\old(a23)=206683, \old(a25)=206687, \old(a29)=206685, \old(a3)=206684, \old(a4)=206679, \old(a8)=206686, \old(inputA)=206681, \old(inputB)=206682, \old(inputC)=206680, \old(inputD)=206677, \old(inputE)=206676, \old(inputF)=206678, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1031] int output = -1; VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=-1] [L1034] COND TRUE 1 [L1037] int input; [L1038] input = __VERIFIER_nondet_int() [L1039] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=-1] [L1042] CALL, EXPR calculate_output(input) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L23] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L26] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L29] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L32] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L35] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L38] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L41] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L44] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L47] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L50] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L53] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L56] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L59] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L62] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L65] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L68] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L71] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L74] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L77] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L80] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L83] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L86] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L89] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L92] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L95] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L98] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L101] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L104] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L107] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L110] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L113] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L116] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L119] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L122] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L125] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L128] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L131] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L134] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L137] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L140] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L143] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L146] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L149] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L152] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L155] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L158] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L161] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L164] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L167] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L170] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L173] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L176] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L179] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L182] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && 306 < a23 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L185] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L188] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L191] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L194] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L197] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L200] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L203] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L207] COND FALSE !((( ((140 < a29) && (245 >= a29)) && ((a25==12) && ( a23 <= -43 && ((a8==15) && ((input == 6) && (a3==1)))))) && !(a4==1))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L214] COND FALSE !((!(a4==1) && (((a3==1) && ((((((a25==13) && ((140 < a29) && (245 >= a29)) ) || ((a25==9) && ((245 < a29) && (277 >= a29)) )) || ( ((245 < a29) && (277 >= a29)) && (a25==10))) && (input == 4)) && a23 <= -43 )) && (a8==15)))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L221] COND FALSE !(((a25==11) && (!(a4==1) && (((((input == 2) && (a3==1)) && a23 <= -43 ) && (a8==15)) && ((245 < a29) && (277 >= a29)) )))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L227] COND FALSE !(((( a29 <= 140 && ((a3==1) && (((input == 5) && (a25==13)) && (a4==1)))) && (a8==15)) && 306 < a23 )) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L233] COND FALSE !((((a8==15) && (((((((a4==1) && 277 < a29 ) && (a25==12)) && 306 < a23 ) || ( 306 < a23 && (((a4==1) && 277 < a29 ) && (a25==13)))) || ((( a29 <= 140 && !(a4==1)) && (a25==9)) && a23 <= -43 )) && (input == 6))) && (a3==1))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L240] COND FALSE !(((((input == 4) && (( a23 <= -43 && ((a25==9) && (!(a4==1) && a29 <= 140 ))) || (((( 277 < a29 && (a4==1)) && (a25==12)) && 306 < a23 ) || ( 306 < a23 && ((a25==13) && ( 277 < a29 && (a4==1))))))) && (a8==15)) && (a3==1))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L247] COND FALSE !((((a3==1) && (!(a4==1) && (( a29 <= 140 && ((input == 1) && ((a25==12) || ((a25==10) || (a25==11))))) && ((-43 < a23) && (138 >= a23)) ))) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L254] COND FALSE !(((( ((245 < a29) && (277 >= a29)) && (( a23 <= -43 && (!(a4==1) && (input == 1))) && (a25==11))) && (a8==15)) && (a3==1))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L260] COND FALSE !(((((a4==1) && (((input == 1) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (((a25==13) && ((140 < a29) && (245 >= a29)) ) || ((a25==9) && ((245 < a29) && (277 >= a29)) )))) && (a8==15))) && 306 < a23 ) && (a3==1))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L265] COND FALSE !((( 277 < a29 && (((a8==15) && ( a23 <= -43 && ((input == 2) && (a3==1)))) && !(a4==1))) && (a25==13))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L268] COND FALSE !(( a29 <= 140 && ((((a8==15) && ((a3==1) && ((input == 1) && ((a25==12) || (a25==13))))) && !(a4==1)) && a23 <= -43 ))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L275] COND FALSE !((((a4==1) && ((a8==15) && (((a3==1) && (((a25==9) || (a25==10)) && (input == 5))) && ((140 < a29) && (245 >= a29)) ))) && 306 < a23 )) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L280] COND FALSE !(((a3==1) && (((((input == 5) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ( ((245 < a29) && (277 >= a29)) && (a25==9))))) && (a8==15)) && !(a4==1)) && a23 <= -43 ))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L287] COND FALSE !(((a8==15) && ((((!(a4==1) && (((a25==12) || (a25==13)) && (input == 4))) && a23 <= -43 ) && a29 <= 140 ) && (a3==1)))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L294] COND FALSE !(((a8==15) && (!(a4==1) && ( a23 <= -43 && ((a3==1) && ( 277 < a29 && (((a25==12) || ((a25==10) || (a25==11))) && (input == 6)))))))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L299] COND FALSE !(( 306 < a23 && (((a8==15) && ((a3==1) && ((a4==1) && (((a25==11) || (a25==12)) && (input == 6))))) && ((140 < a29) && (245 >= a29)) ))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L305] COND FALSE !(((((a8==15) && ( a29 <= 140 && ( a23 <= -43 && ((input == 2) && ((a25==10) || (a25==11)))))) && !(a4==1)) && (a3==1))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L310] COND FALSE !(((a3==1) && ( ((245 < a29) && (277 >= a29)) && (((a4==1) && ((a8==15) && ((((a25==11) || (a25==12)) || (a25==13)) && (input == 5)))) && 306 < a23 )))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L317] COND FALSE !(((((a8==15) && (((a4==1) && ((input == 2) && ((a25==13) || ((a25==11) || (a25==12))))) && ((245 < a29) && (277 >= a29)) )) && 306 < a23 ) && (a3==1))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L322] COND FALSE !((( 306 < a23 && ((a8==15) && ((((input == 6) && ((a25==9) || (a25==10))) && ((140 < a29) && (245 >= a29)) ) && (a3==1)))) && (a4==1))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L329] COND FALSE !(((((a8==15) && (((((a25==11) || (a25==12)) && (input == 4)) && 306 < a23 ) && (a3==1))) && (a4==1)) && ((140 < a29) && (245 >= a29)) )) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L334] COND FALSE !(( a23 <= -43 && ( ((140 < a29) && (245 >= a29)) && (((a8==15) && (((input == 4) && ((a25==11) || ((a25==9) || (a25==10)))) && !(a4==1))) && (a3==1))))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L340] COND FALSE !((((((((((a25==12) && ((245 < a29) && (277 >= a29)) ) || ((a25==13) && ((245 < a29) && (277 >= a29)) )) || ( 277 < a29 && (a25==9))) && (input == 1)) && a23 <= -43 ) && (a8==15)) && !(a4==1)) && (a3==1))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L346] COND FALSE !((!(a4==1) && ( a29 <= 140 && ((((((a25==12) || (a25==13)) && (input == 2)) && a23 <= -43 ) && (a3==1)) && (a8==15))))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L353] COND FALSE !(((a8==15) && (( 306 < a23 && ((a3==1) && ((input == 4) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ((a25==9) && ((245 < a29) && (277 >= a29)) )))))) && (a4==1)))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L358] COND FALSE !(((((input == 3) && (( a23 <= -43 && ((!(a4==1) && a29 <= 140 ) && (a25==9))) || (( 306 < a23 && (( 277 < a29 && (a4==1)) && (a25==12))) || ((((a4==1) && 277 < a29 ) && (a25==13)) && 306 < a23 )))) && (a3==1)) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L365] COND FALSE !(( 306 < a23 && ((a4==1) && (((((((a25==11) || (a25==12)) || (a25==13)) && (input == 3)) && (a8==15)) && (a3==1)) && ((245 < a29) && (277 >= a29)) )))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L370] COND FALSE !(( ((245 < a29) && (277 >= a29)) && (((((!(a4==1) && (input == 6)) && (a3==1)) && (a25==11)) && (a8==15)) && a23 <= -43 ))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L377] COND FALSE !((( ((-43 < a23) && (138 >= a23)) && (((a8==15) && ((input == 2) && ((( a29 <= 140 && (a25==13)) || ( ((140 < a29) && (245 >= a29)) && (a25==9))) || ((a25==10) && ((140 < a29) && (245 >= a29)) )))) && (a3==1))) && !(a4==1))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L384] COND FALSE !(( a29 <= 140 && ((a8==15) && ((((((a25==10) || (a25==11)) && (input == 3)) && a23 <= -43 ) && (a3==1)) && !(a4==1))))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L391] COND FALSE !((((((a8==15) && (((input == 3) && (((a25==10) || (a25==11)) || (a25==12))) && (a3==1))) && a23 <= -43 ) && !(a4==1)) && 277 < a29 )) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L398] COND FALSE !(((!(a4==1) && ((a25==9) && ((a8==15) && ((a3==1) && ( ((-43 < a23) && (138 >= a23)) && (input == 1)))))) && a29 <= 140 )) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L411] COND FALSE !(((a8==15) && ((( 306 < a23 && (((((a25==11) || (a25==12)) || (a25==13)) && (input == 6)) && ((245 < a29) && (277 >= a29)) )) && (a4==1)) && (a3==1)))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L417] COND FALSE !((((((!(a4==1) && ((a8==15) && (input == 2))) && (a3==1)) && ((140 < a29) && (245 >= a29)) ) && (a25==12)) && a23 <= -43 )) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L422] COND FALSE !(( a23 <= -43 && (( a29 <= 140 && ((a8==15) && (!(a4==1) && (((a25==12) || (a25==13)) && (input == 3))))) && (a3==1)))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L429] COND FALSE !(((((((input == 6) && ((((a25==13) && a29 <= 140 ) || ( ((140 < a29) && (245 >= a29)) && (a25==9))) || ( ((140 < a29) && (245 >= a29)) && (a25==10)))) && (a8==15)) && (a3==1)) && !(a4==1)) && ((-43 < a23) && (138 >= a23)) )) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L436] COND FALSE !(((!(a4==1) && (((((a3==1) && (input == 4)) && (a25==11)) && ((245 < a29) && (277 >= a29)) ) && a23 <= -43 )) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L443] COND FALSE !(((a3==1) && ( ((140 < a29) && (245 >= a29)) && ( a23 <= -43 && ((a8==15) && (!(a4==1) && ((((a25==9) || (a25==10)) || (a25==11)) && (input == 3)))))))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L450] COND FALSE !(((((!(a4==1) && (((((a25==10) || (a25==11)) || (a25==12)) && (input == 4)) && 277 < a29 )) && a23 <= -43 ) && (a8==15)) && (a3==1))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L456] COND FALSE !(( ((140 < a29) && (245 >= a29)) && ((a8==15) && (((a25==12) && (!(a4==1) && ( a23 <= -43 && (input == 4)))) && (a3==1))))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L463] COND FALSE !(((a3==1) && ((((((( 277 < a29 && (a4==1)) && (a25==12)) && 306 < a23 ) || ( 306 < a23 && (((a4==1) && 277 < a29 ) && (a25==13)))) || (((a25==9) && (!(a4==1) && a29 <= 140 )) && a23 <= -43 )) && (input == 2)) && (a8==15)))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L470] COND FALSE !(((((input == 5) && (((((a25==12) && ((a4==1) && 277 < a29 )) && 306 < a23 ) || ((( 277 < a29 && (a4==1)) && (a25==13)) && 306 < a23 )) || ((( a29 <= 140 && !(a4==1)) && (a25==9)) && a23 <= -43 ))) && (a8==15)) && (a3==1))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L477] COND FALSE !(((a25==12) && (((a3==1) && ((((input == 1) && a23 <= -43 ) && ((140 < a29) && (245 >= a29)) ) && !(a4==1))) && (a8==15)))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L487] COND FALSE !((((a8==15) && (( ((-43 < a23) && (138 >= a23)) && ((input == 1) && (( ((140 < a29) && (245 >= a29)) && (a25==10)) || (((a25==13) && a29 <= 140 ) || ((a25==9) && ((140 < a29) && (245 >= a29)) ))))) && (a3==1))) && !(a4==1))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L500] COND FALSE !(((a3==1) && ((a8==15) && (((((( ((140 < a29) && (245 >= a29)) && (a25==13)) || ((a25==9) && ((245 < a29) && (277 >= a29)) )) || ( ((245 < a29) && (277 >= a29)) && (a25==10))) && (input == 3)) && !(a4==1)) && a23 <= -43 )))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L507] COND FALSE !((( a29 <= 140 && ( ((-43 < a23) && (138 >= a23)) && ((a3==1) && ((a8==15) && (((a25==12) || ((a25==10) || (a25==11))) && (input == 2)))))) && !(a4==1))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L514] COND FALSE !((((a4==1) && ( 306 < a23 && ((((input == 3) && ((a25==9) || (a25==10))) && ((140 < a29) && (245 >= a29)) ) && (a3==1)))) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L526] COND FALSE !(((a4==1) && ((((a3==1) && ( 306 < a23 && (((a25==12) || ((a25==10) || (a25==11))) && (input == 4)))) && a29 <= 140 ) && (a8==15)))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L531] COND FALSE !((((( ((-43 < a23) && (138 >= a23)) && ((!(a4==1) && (input == 5)) && (a3==1))) && (a25==9)) && a29 <= 140 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L537] COND FALSE !(( 306 < a23 && (((a8==15) && ((((input == 1) && ((a25==11) || (a25==12))) && (a4==1)) && (a3==1))) && ((140 < a29) && (245 >= a29)) ))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L542] COND FALSE !(((((a8==15) && ( a23 <= -43 && (((input == 1) && ((a25==10) || (a25==11))) && a29 <= 140 ))) && !(a4==1)) && (a3==1))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L549] COND FALSE !(((( a23 <= -43 && (!(a4==1) && ((a3==1) && (((a25==11) || ((a25==9) || (a25==10))) && (input == 5))))) && (a8==15)) && ((140 < a29) && (245 >= a29)) )) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L555] COND FALSE !(((a3==1) && ( ((-43 < a23) && (138 >= a23)) && ((a8==15) && ((((((a25==10) || (a25==11)) || (a25==12)) && (input == 5)) && a29 <= 140 ) && !(a4==1)))))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L561] COND FALSE !(( 306 < a23 && (((a3==1) && ( 277 < a29 && (((input == 4) && (((a25==9) || (a25==10)) || (a25==11))) && (a8==15)))) && (a4==1)))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L566] COND FALSE !((!(a4==1) && ( a23 <= -43 && ((a8==15) && (((((a25==12) || ((a25==10) || (a25==11))) && (input == 1)) && (a3==1)) && 277 < a29 ))))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L572] COND FALSE !(( 277 < a29 && (((a25==13) && ( a23 <= -43 && (!(a4==1) && ((input == 1) && (a3==1))))) && (a8==15)))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L575] COND FALSE !(((( ((-43 < a23) && (138 >= a23)) && (((a25==9) && ((input == 4) && !(a4==1))) && a29 <= 140 )) && (a3==1)) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L581] COND FALSE !(((a8==15) && ((((a3==1) && (((((a25==10) || (a25==11)) || (a25==12)) && (input == 3)) && (a4==1))) && 306 < a23 ) && a29 <= 140 ))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L586] COND FALSE !((( ((-43 < a23) && (138 >= a23)) && ((a3==1) && (!(a4==1) && ((input == 4) && (((a25==10) && ((140 < a29) && (245 >= a29)) ) || (((a25==13) && a29 <= 140 ) || ( ((140 < a29) && (245 >= a29)) && (a25==9)))))))) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L598] COND FALSE !(((((a8==15) && ((!(a4==1) && (((a25==11) || ((a25==9) || (a25==10))) && (input == 6))) && (a3==1))) && a23 <= -43 ) && ((140 < a29) && (245 >= a29)) )) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L603] COND FALSE !(( a29 <= 140 && (((a4==1) && ((a8==15) && (((input == 6) && (((a25==10) || (a25==11)) || (a25==12))) && 306 < a23 ))) && (a3==1)))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L615] COND FALSE !(((((((a3==1) && ((input == 5) && ((a25==11) || (a25==12)))) && (a4==1)) && 306 < a23 ) && ((140 < a29) && (245 >= a29)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L621] COND FALSE !(((((a4==1) && ( 306 < a23 && ((a8==15) && (((a25==11) || (a25==12)) && (input == 2))))) && ((140 < a29) && (245 >= a29)) ) && (a3==1))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L628] COND FALSE !(((((a8==15) && ( a23 <= -43 && (!(a4==1) && ((a25==11) && (input == 5))))) && (a3==1)) && ((245 < a29) && (277 >= a29)) )) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L635] COND FALSE !((((((((input == 2) && ((a25==9) || (a25==10))) && (a8==15)) && ((140 < a29) && (245 >= a29)) ) && 306 < a23 ) && (a3==1)) && (a4==1))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L642] COND FALSE !(((a8==15) && (((( 277 < a29 && ((input == 2) && ((a25==11) || ((a25==9) || (a25==10))))) && (a4==1)) && (a3==1)) && 306 < a23 ))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L647] COND FALSE !(((((( ((-43 < a23) && (138 >= a23)) && ((input == 3) && ((a25==12) || ((a25==10) || (a25==11))))) && !(a4==1)) && (a8==15)) && a29 <= 140 ) && (a3==1))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L658] COND FALSE !((((!(a4==1) && ((((input == 6) && ((a25==12) || ((a25==10) || (a25==11)))) && (a8==15)) && ((-43 < a23) && (138 >= a23)) )) && (a3==1)) && a29 <= 140 )) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L663] COND FALSE !(((a25==9) && (( a29 <= 140 && ((a3==1) && (!(a4==1) && ( ((-43 < a23) && (138 >= a23)) && (input == 2))))) && (a8==15)))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L670] COND FALSE !((!(a4==1) && ( a23 <= -43 && (((a8==15) && (((((a25==12) && ((245 < a29) && (277 >= a29)) ) || ( ((245 < a29) && (277 >= a29)) && (a25==13))) || ((a25==9) && 277 < a29 )) && (input == 3))) && (a3==1))))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L675] COND FALSE !((((!(a4==1) && ((a3==1) && ((input == 5) && ((( ((245 < a29) && (277 >= a29)) && (a25==12)) || ((a25==13) && ((245 < a29) && (277 >= a29)) )) || ((a25==9) && 277 < a29 ))))) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L681] COND FALSE !(( a23 <= -43 && (!(a4==1) && ( ((245 < a29) && (277 >= a29)) && ((a8==15) && ((a25==11) && ((a3==1) && (input == 3)))))))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L688] COND FALSE !(((((a8==15) && ( 306 < a23 && ( ((140 < a29) && (245 >= a29)) && ((input == 1) && ((a25==9) || (a25==10)))))) && (a4==1)) && (a3==1))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L694] COND FALSE !((!(a4==1) && (((((a3==1) && ((input == 2) && (((a25==9) || (a25==10)) || (a25==11)))) && ((140 < a29) && (245 >= a29)) ) && a23 <= -43 ) && (a8==15)))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L706] COND FALSE !(((((((( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ((a25==9) && ((245 < a29) && (277 >= a29)) ))) && (input == 6)) && (a3==1)) && 306 < a23 ) && (a4==1)) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L712] COND FALSE !(( 306 < a23 && ((a8==15) && ( 277 < a29 && ((a4==1) && ((a3==1) && ((((a25==9) || (a25==10)) || (a25==11)) && (input == 5)))))))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L717] COND FALSE !(((( 277 < a29 && ((a8==15) && (((input == 6) && a23 <= -43 ) && (a25==13)))) && !(a4==1)) && (a3==1))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L731] COND FALSE !(((a3==1) && (((!(a4==1) && ((( ((140 < a29) && (245 >= a29)) && (a25==10)) || (( a29 <= 140 && (a25==13)) || ((a25==9) && ((140 < a29) && (245 >= a29)) ))) && (input == 3))) && ((-43 < a23) && (138 >= a23)) ) && (a8==15)))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L738] COND FALSE !(((a3==1) && (( 306 < a23 && (((a4==1) && (((a25==12) || ((a25==10) || (a25==11))) && (input == 1))) && a29 <= 140 )) && (a8==15)))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L743] COND FALSE !((((( a23 <= -43 && ((input == 1) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ((a25==9) && ((245 < a29) && (277 >= a29)) ))))) && (a3==1)) && !(a4==1)) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L750] COND FALSE !(((!(a4==1) && (((a8==15) && ( a29 <= 140 && (((a25==10) || (a25==11)) && (input == 5)))) && a23 <= -43 )) && (a3==1))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L757] COND FALSE !((((((a8==15) && ((a3==1) && ( a23 <= -43 && (input == 5)))) && !(a4==1)) && (a25==13)) && 277 < a29 )) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L769] COND FALSE !(((a8==15) && ((a3==1) && ( 306 < a23 && ((((((a25==11) || (a25==12)) || (a25==13)) && (input == 1)) && (a4==1)) && ((245 < a29) && (277 >= a29)) ))))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L774] COND FALSE !((!(a4==1) && (((((((a25==12) || (a25==13)) && (input == 6)) && (a8==15)) && a23 <= -43 ) && (a3==1)) && a29 <= 140 ))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L780] COND FALSE !(((a3==1) && (( a23 <= -43 && (((input == 6) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (((a25==13) && ((140 < a29) && (245 >= a29)) ) || ((a25==9) && ((245 < a29) && (277 >= a29)) )))) && !(a4==1))) && (a8==15)))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L787] COND FALSE !((((( ((-43 < a23) && (138 >= a23)) && ((!(a4==1) && (input == 6)) && (a25==9))) && a29 <= 140 ) && (a3==1)) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L792] COND FALSE !((( a29 <= 140 && ((a3==1) && ((a8==15) && ((a25==13) && ( 306 < a23 && (input == 1)))))) && (a4==1))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L799] COND FALSE !(((a3==1) && (((a8==15) && (((( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ( ((245 < a29) && (277 >= a29)) && (a25==9)))) && (input == 5)) && 306 < a23 )) && (a4==1)))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L804] COND FALSE !((((((a8==15) && ((input == 4) && (( 277 < a29 && (a25==9)) || (( ((245 < a29) && (277 >= a29)) && (a25==12)) || ( ((245 < a29) && (277 >= a29)) && (a25==13)))))) && !(a4==1)) && a23 <= -43 ) && (a3==1))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L816] COND FALSE !(((( ((-43 < a23) && (138 >= a23)) && (!(a4==1) && ((input == 5) && (( ((140 < a29) && (245 >= a29)) && (a25==10)) || (( a29 <= 140 && (a25==13)) || ((a25==9) && ((140 < a29) && (245 >= a29)) )))))) && (a8==15)) && (a3==1))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L822] COND FALSE !(( a29 <= 140 && ((((( 306 < a23 && (input == 2)) && (a25==13)) && (a4==1)) && (a3==1)) && (a8==15)))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L825] COND FALSE !(((a8==15) && ((((a3==1) && ((((a25==10) || (a25==11)) && (input == 6)) && a29 <= 140 )) && a23 <= -43 ) && !(a4==1)))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L831] COND FALSE !(( ((245 < a29) && (277 >= a29)) && (((((a8==15) && (((a25==13) || ((a25==11) || (a25==12))) && (input == 4))) && (a4==1)) && (a3==1)) && 306 < a23 ))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L836] COND FALSE !((((a3==1) && ((a8==15) && ((((a25==13) && (input == 4)) && (a4==1)) && a29 <= 140 ))) && 306 < a23 )) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L841] COND FALSE !((( 306 < a23 && ((a25==13) && ((((input == 3) && a29 <= 140 ) && (a3==1)) && (a4==1)))) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L846] COND FALSE !((!(a4==1) && (( 277 < a29 && ((((input == 4) && a23 <= -43 ) && (a8==15)) && (a3==1))) && (a25==13)))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L852] COND FALSE !(((a3==1) && (((((( a29 <= 140 && !(a4==1)) && (a25==9)) && a23 <= -43 ) || (( 306 < a23 && (((a4==1) && 277 < a29 ) && (a25==12))) || ( 306 < a23 && (((a4==1) && 277 < a29 ) && (a25==13))))) && (input == 1)) && (a8==15)))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L859] COND FALSE !(( 277 < a29 && ((a3==1) && ((a8==15) && ((a4==1) && ( 306 < a23 && ((input == 6) && (((a25==9) || (a25==10)) || (a25==11))))))))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L865] COND FALSE !(((((( ((-43 < a23) && (138 >= a23)) && ((input == 4) && ((a25==12) || ((a25==10) || (a25==11))))) && (a8==15)) && !(a4==1)) && (a3==1)) && a29 <= 140 )) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L876] COND FALSE !(((((( a23 <= -43 && ((input == 5) && ((a25==12) || ((a25==10) || (a25==11))))) && (a3==1)) && !(a4==1)) && 277 < a29 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L881] COND FALSE !(((((a8==15) && ((a4==1) && (((( ((140 < a29) && (245 >= a29)) && (a25==13)) || ((a25==9) && ((245 < a29) && (277 >= a29)) )) || ( ((245 < a29) && (277 >= a29)) && (a25==10))) && (input == 2)))) && (a3==1)) && 306 < a23 )) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L886] COND FALSE !((( a23 <= -43 && ((( ((140 < a29) && (245 >= a29)) && ((input == 1) && (((a25==9) || (a25==10)) || (a25==11)))) && !(a4==1)) && (a8==15))) && (a3==1))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L893] COND TRUE ((((a3==1) && ((((input == 2) && ((a25==12) || ((a25==10) || (a25==11)))) && (a4==1)) && (a8==15))) && a29 <= 140 ) && 306 < a23 ) [L895] a25 = 13 [L897] return 23; VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, \result=23, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1042] RET, EXPR calculate_output(input) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, calculate_output(input)=23, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=-1] [L1042] output = calculate_output(input) [L1034] COND TRUE 1 [L1037] int input; [L1038] input = __VERIFIER_nondet_int() [L1039] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=23] [L1042] CALL, EXPR calculate_output(input) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L23] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L26] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L29] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L32] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L35] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L38] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L41] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L44] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L47] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L50] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L53] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L56] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L59] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L62] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L65] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L68] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L71] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L74] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L77] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L80] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L83] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L86] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L89] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L92] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L95] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L98] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L101] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L104] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L107] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L110] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L113] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L116] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L119] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L122] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L125] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L128] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L131] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L134] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L137] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L140] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L143] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L146] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L149] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L152] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L155] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L158] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L161] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L164] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L167] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L170] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L173] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L176] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L179] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L182] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && 306 < a23 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L185] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L188] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L191] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L194] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L197] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L200] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L203] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L207] COND FALSE !((( ((140 < a29) && (245 >= a29)) && ((a25==12) && ( a23 <= -43 && ((a8==15) && ((input == 6) && (a3==1)))))) && !(a4==1))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L214] COND FALSE !((!(a4==1) && (((a3==1) && ((((((a25==13) && ((140 < a29) && (245 >= a29)) ) || ((a25==9) && ((245 < a29) && (277 >= a29)) )) || ( ((245 < a29) && (277 >= a29)) && (a25==10))) && (input == 4)) && a23 <= -43 )) && (a8==15)))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L221] COND FALSE !(((a25==11) && (!(a4==1) && (((((input == 2) && (a3==1)) && a23 <= -43 ) && (a8==15)) && ((245 < a29) && (277 >= a29)) )))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L227] COND FALSE !(((( a29 <= 140 && ((a3==1) && (((input == 5) && (a25==13)) && (a4==1)))) && (a8==15)) && 306 < a23 )) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L233] COND FALSE !((((a8==15) && (((((((a4==1) && 277 < a29 ) && (a25==12)) && 306 < a23 ) || ( 306 < a23 && (((a4==1) && 277 < a29 ) && (a25==13)))) || ((( a29 <= 140 && !(a4==1)) && (a25==9)) && a23 <= -43 )) && (input == 6))) && (a3==1))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L240] COND FALSE !(((((input == 4) && (( a23 <= -43 && ((a25==9) && (!(a4==1) && a29 <= 140 ))) || (((( 277 < a29 && (a4==1)) && (a25==12)) && 306 < a23 ) || ( 306 < a23 && ((a25==13) && ( 277 < a29 && (a4==1))))))) && (a8==15)) && (a3==1))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L247] COND FALSE !((((a3==1) && (!(a4==1) && (( a29 <= 140 && ((input == 1) && ((a25==12) || ((a25==10) || (a25==11))))) && ((-43 < a23) && (138 >= a23)) ))) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L254] COND FALSE !(((( ((245 < a29) && (277 >= a29)) && (( a23 <= -43 && (!(a4==1) && (input == 1))) && (a25==11))) && (a8==15)) && (a3==1))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L260] COND FALSE !(((((a4==1) && (((input == 1) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (((a25==13) && ((140 < a29) && (245 >= a29)) ) || ((a25==9) && ((245 < a29) && (277 >= a29)) )))) && (a8==15))) && 306 < a23 ) && (a3==1))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L265] COND FALSE !((( 277 < a29 && (((a8==15) && ( a23 <= -43 && ((input == 2) && (a3==1)))) && !(a4==1))) && (a25==13))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L268] COND FALSE !(( a29 <= 140 && ((((a8==15) && ((a3==1) && ((input == 1) && ((a25==12) || (a25==13))))) && !(a4==1)) && a23 <= -43 ))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L275] COND FALSE !((((a4==1) && ((a8==15) && (((a3==1) && (((a25==9) || (a25==10)) && (input == 5))) && ((140 < a29) && (245 >= a29)) ))) && 306 < a23 )) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L280] COND FALSE !(((a3==1) && (((((input == 5) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ( ((245 < a29) && (277 >= a29)) && (a25==9))))) && (a8==15)) && !(a4==1)) && a23 <= -43 ))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L287] COND FALSE !(((a8==15) && ((((!(a4==1) && (((a25==12) || (a25==13)) && (input == 4))) && a23 <= -43 ) && a29 <= 140 ) && (a3==1)))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L294] COND FALSE !(((a8==15) && (!(a4==1) && ( a23 <= -43 && ((a3==1) && ( 277 < a29 && (((a25==12) || ((a25==10) || (a25==11))) && (input == 6)))))))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L299] COND FALSE !(( 306 < a23 && (((a8==15) && ((a3==1) && ((a4==1) && (((a25==11) || (a25==12)) && (input == 6))))) && ((140 < a29) && (245 >= a29)) ))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L305] COND FALSE !(((((a8==15) && ( a29 <= 140 && ( a23 <= -43 && ((input == 2) && ((a25==10) || (a25==11)))))) && !(a4==1)) && (a3==1))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L310] COND FALSE !(((a3==1) && ( ((245 < a29) && (277 >= a29)) && (((a4==1) && ((a8==15) && ((((a25==11) || (a25==12)) || (a25==13)) && (input == 5)))) && 306 < a23 )))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L317] COND FALSE !(((((a8==15) && (((a4==1) && ((input == 2) && ((a25==13) || ((a25==11) || (a25==12))))) && ((245 < a29) && (277 >= a29)) )) && 306 < a23 ) && (a3==1))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L322] COND FALSE !((( 306 < a23 && ((a8==15) && ((((input == 6) && ((a25==9) || (a25==10))) && ((140 < a29) && (245 >= a29)) ) && (a3==1)))) && (a4==1))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L329] COND FALSE !(((((a8==15) && (((((a25==11) || (a25==12)) && (input == 4)) && 306 < a23 ) && (a3==1))) && (a4==1)) && ((140 < a29) && (245 >= a29)) )) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L334] COND FALSE !(( a23 <= -43 && ( ((140 < a29) && (245 >= a29)) && (((a8==15) && (((input == 4) && ((a25==11) || ((a25==9) || (a25==10)))) && !(a4==1))) && (a3==1))))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L340] COND FALSE !((((((((((a25==12) && ((245 < a29) && (277 >= a29)) ) || ((a25==13) && ((245 < a29) && (277 >= a29)) )) || ( 277 < a29 && (a25==9))) && (input == 1)) && a23 <= -43 ) && (a8==15)) && !(a4==1)) && (a3==1))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L346] COND FALSE !((!(a4==1) && ( a29 <= 140 && ((((((a25==12) || (a25==13)) && (input == 2)) && a23 <= -43 ) && (a3==1)) && (a8==15))))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L353] COND FALSE !(((a8==15) && (( 306 < a23 && ((a3==1) && ((input == 4) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ((a25==9) && ((245 < a29) && (277 >= a29)) )))))) && (a4==1)))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L358] COND FALSE !(((((input == 3) && (( a23 <= -43 && ((!(a4==1) && a29 <= 140 ) && (a25==9))) || (( 306 < a23 && (( 277 < a29 && (a4==1)) && (a25==12))) || ((((a4==1) && 277 < a29 ) && (a25==13)) && 306 < a23 )))) && (a3==1)) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L365] COND FALSE !(( 306 < a23 && ((a4==1) && (((((((a25==11) || (a25==12)) || (a25==13)) && (input == 3)) && (a8==15)) && (a3==1)) && ((245 < a29) && (277 >= a29)) )))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L370] COND FALSE !(( ((245 < a29) && (277 >= a29)) && (((((!(a4==1) && (input == 6)) && (a3==1)) && (a25==11)) && (a8==15)) && a23 <= -43 ))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L377] COND FALSE !((( ((-43 < a23) && (138 >= a23)) && (((a8==15) && ((input == 2) && ((( a29 <= 140 && (a25==13)) || ( ((140 < a29) && (245 >= a29)) && (a25==9))) || ((a25==10) && ((140 < a29) && (245 >= a29)) )))) && (a3==1))) && !(a4==1))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L384] COND FALSE !(( a29 <= 140 && ((a8==15) && ((((((a25==10) || (a25==11)) && (input == 3)) && a23 <= -43 ) && (a3==1)) && !(a4==1))))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L391] COND FALSE !((((((a8==15) && (((input == 3) && (((a25==10) || (a25==11)) || (a25==12))) && (a3==1))) && a23 <= -43 ) && !(a4==1)) && 277 < a29 )) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L398] COND FALSE !(((!(a4==1) && ((a25==9) && ((a8==15) && ((a3==1) && ( ((-43 < a23) && (138 >= a23)) && (input == 1)))))) && a29 <= 140 )) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L411] COND FALSE !(((a8==15) && ((( 306 < a23 && (((((a25==11) || (a25==12)) || (a25==13)) && (input == 6)) && ((245 < a29) && (277 >= a29)) )) && (a4==1)) && (a3==1)))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L417] COND FALSE !((((((!(a4==1) && ((a8==15) && (input == 2))) && (a3==1)) && ((140 < a29) && (245 >= a29)) ) && (a25==12)) && a23 <= -43 )) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L422] COND FALSE !(( a23 <= -43 && (( a29 <= 140 && ((a8==15) && (!(a4==1) && (((a25==12) || (a25==13)) && (input == 3))))) && (a3==1)))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L429] COND FALSE !(((((((input == 6) && ((((a25==13) && a29 <= 140 ) || ( ((140 < a29) && (245 >= a29)) && (a25==9))) || ( ((140 < a29) && (245 >= a29)) && (a25==10)))) && (a8==15)) && (a3==1)) && !(a4==1)) && ((-43 < a23) && (138 >= a23)) )) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L436] COND FALSE !(((!(a4==1) && (((((a3==1) && (input == 4)) && (a25==11)) && ((245 < a29) && (277 >= a29)) ) && a23 <= -43 )) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L443] COND FALSE !(((a3==1) && ( ((140 < a29) && (245 >= a29)) && ( a23 <= -43 && ((a8==15) && (!(a4==1) && ((((a25==9) || (a25==10)) || (a25==11)) && (input == 3)))))))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L450] COND FALSE !(((((!(a4==1) && (((((a25==10) || (a25==11)) || (a25==12)) && (input == 4)) && 277 < a29 )) && a23 <= -43 ) && (a8==15)) && (a3==1))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L456] COND FALSE !(( ((140 < a29) && (245 >= a29)) && ((a8==15) && (((a25==12) && (!(a4==1) && ( a23 <= -43 && (input == 4)))) && (a3==1))))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L463] COND FALSE !(((a3==1) && ((((((( 277 < a29 && (a4==1)) && (a25==12)) && 306 < a23 ) || ( 306 < a23 && (((a4==1) && 277 < a29 ) && (a25==13)))) || (((a25==9) && (!(a4==1) && a29 <= 140 )) && a23 <= -43 )) && (input == 2)) && (a8==15)))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L470] COND FALSE !(((((input == 5) && (((((a25==12) && ((a4==1) && 277 < a29 )) && 306 < a23 ) || ((( 277 < a29 && (a4==1)) && (a25==13)) && 306 < a23 )) || ((( a29 <= 140 && !(a4==1)) && (a25==9)) && a23 <= -43 ))) && (a8==15)) && (a3==1))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L477] COND FALSE !(((a25==12) && (((a3==1) && ((((input == 1) && a23 <= -43 ) && ((140 < a29) && (245 >= a29)) ) && !(a4==1))) && (a8==15)))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L487] COND FALSE !((((a8==15) && (( ((-43 < a23) && (138 >= a23)) && ((input == 1) && (( ((140 < a29) && (245 >= a29)) && (a25==10)) || (((a25==13) && a29 <= 140 ) || ((a25==9) && ((140 < a29) && (245 >= a29)) ))))) && (a3==1))) && !(a4==1))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L500] COND FALSE !(((a3==1) && ((a8==15) && (((((( ((140 < a29) && (245 >= a29)) && (a25==13)) || ((a25==9) && ((245 < a29) && (277 >= a29)) )) || ( ((245 < a29) && (277 >= a29)) && (a25==10))) && (input == 3)) && !(a4==1)) && a23 <= -43 )))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L507] COND FALSE !((( a29 <= 140 && ( ((-43 < a23) && (138 >= a23)) && ((a3==1) && ((a8==15) && (((a25==12) || ((a25==10) || (a25==11))) && (input == 2)))))) && !(a4==1))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L514] COND FALSE !((((a4==1) && ( 306 < a23 && ((((input == 3) && ((a25==9) || (a25==10))) && ((140 < a29) && (245 >= a29)) ) && (a3==1)))) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L526] COND FALSE !(((a4==1) && ((((a3==1) && ( 306 < a23 && (((a25==12) || ((a25==10) || (a25==11))) && (input == 4)))) && a29 <= 140 ) && (a8==15)))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L531] COND FALSE !((((( ((-43 < a23) && (138 >= a23)) && ((!(a4==1) && (input == 5)) && (a3==1))) && (a25==9)) && a29 <= 140 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L537] COND FALSE !(( 306 < a23 && (((a8==15) && ((((input == 1) && ((a25==11) || (a25==12))) && (a4==1)) && (a3==1))) && ((140 < a29) && (245 >= a29)) ))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L542] COND FALSE !(((((a8==15) && ( a23 <= -43 && (((input == 1) && ((a25==10) || (a25==11))) && a29 <= 140 ))) && !(a4==1)) && (a3==1))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L549] COND FALSE !(((( a23 <= -43 && (!(a4==1) && ((a3==1) && (((a25==11) || ((a25==9) || (a25==10))) && (input == 5))))) && (a8==15)) && ((140 < a29) && (245 >= a29)) )) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L555] COND FALSE !(((a3==1) && ( ((-43 < a23) && (138 >= a23)) && ((a8==15) && ((((((a25==10) || (a25==11)) || (a25==12)) && (input == 5)) && a29 <= 140 ) && !(a4==1)))))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L561] COND FALSE !(( 306 < a23 && (((a3==1) && ( 277 < a29 && (((input == 4) && (((a25==9) || (a25==10)) || (a25==11))) && (a8==15)))) && (a4==1)))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L566] COND FALSE !((!(a4==1) && ( a23 <= -43 && ((a8==15) && (((((a25==12) || ((a25==10) || (a25==11))) && (input == 1)) && (a3==1)) && 277 < a29 ))))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L572] COND FALSE !(( 277 < a29 && (((a25==13) && ( a23 <= -43 && (!(a4==1) && ((input == 1) && (a3==1))))) && (a8==15)))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L575] COND FALSE !(((( ((-43 < a23) && (138 >= a23)) && (((a25==9) && ((input == 4) && !(a4==1))) && a29 <= 140 )) && (a3==1)) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L581] COND FALSE !(((a8==15) && ((((a3==1) && (((((a25==10) || (a25==11)) || (a25==12)) && (input == 3)) && (a4==1))) && 306 < a23 ) && a29 <= 140 ))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L586] COND FALSE !((( ((-43 < a23) && (138 >= a23)) && ((a3==1) && (!(a4==1) && ((input == 4) && (((a25==10) && ((140 < a29) && (245 >= a29)) ) || (((a25==13) && a29 <= 140 ) || ( ((140 < a29) && (245 >= a29)) && (a25==9)))))))) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L598] COND FALSE !(((((a8==15) && ((!(a4==1) && (((a25==11) || ((a25==9) || (a25==10))) && (input == 6))) && (a3==1))) && a23 <= -43 ) && ((140 < a29) && (245 >= a29)) )) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L603] COND FALSE !(( a29 <= 140 && (((a4==1) && ((a8==15) && (((input == 6) && (((a25==10) || (a25==11)) || (a25==12))) && 306 < a23 ))) && (a3==1)))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L615] COND FALSE !(((((((a3==1) && ((input == 5) && ((a25==11) || (a25==12)))) && (a4==1)) && 306 < a23 ) && ((140 < a29) && (245 >= a29)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L621] COND FALSE !(((((a4==1) && ( 306 < a23 && ((a8==15) && (((a25==11) || (a25==12)) && (input == 2))))) && ((140 < a29) && (245 >= a29)) ) && (a3==1))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L628] COND FALSE !(((((a8==15) && ( a23 <= -43 && (!(a4==1) && ((a25==11) && (input == 5))))) && (a3==1)) && ((245 < a29) && (277 >= a29)) )) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L635] COND FALSE !((((((((input == 2) && ((a25==9) || (a25==10))) && (a8==15)) && ((140 < a29) && (245 >= a29)) ) && 306 < a23 ) && (a3==1)) && (a4==1))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L642] COND FALSE !(((a8==15) && (((( 277 < a29 && ((input == 2) && ((a25==11) || ((a25==9) || (a25==10))))) && (a4==1)) && (a3==1)) && 306 < a23 ))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L647] COND FALSE !(((((( ((-43 < a23) && (138 >= a23)) && ((input == 3) && ((a25==12) || ((a25==10) || (a25==11))))) && !(a4==1)) && (a8==15)) && a29 <= 140 ) && (a3==1))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L658] COND FALSE !((((!(a4==1) && ((((input == 6) && ((a25==12) || ((a25==10) || (a25==11)))) && (a8==15)) && ((-43 < a23) && (138 >= a23)) )) && (a3==1)) && a29 <= 140 )) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L663] COND FALSE !(((a25==9) && (( a29 <= 140 && ((a3==1) && (!(a4==1) && ( ((-43 < a23) && (138 >= a23)) && (input == 2))))) && (a8==15)))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L670] COND FALSE !((!(a4==1) && ( a23 <= -43 && (((a8==15) && (((((a25==12) && ((245 < a29) && (277 >= a29)) ) || ( ((245 < a29) && (277 >= a29)) && (a25==13))) || ((a25==9) && 277 < a29 )) && (input == 3))) && (a3==1))))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L675] COND FALSE !((((!(a4==1) && ((a3==1) && ((input == 5) && ((( ((245 < a29) && (277 >= a29)) && (a25==12)) || ((a25==13) && ((245 < a29) && (277 >= a29)) )) || ((a25==9) && 277 < a29 ))))) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L681] COND FALSE !(( a23 <= -43 && (!(a4==1) && ( ((245 < a29) && (277 >= a29)) && ((a8==15) && ((a25==11) && ((a3==1) && (input == 3)))))))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L688] COND FALSE !(((((a8==15) && ( 306 < a23 && ( ((140 < a29) && (245 >= a29)) && ((input == 1) && ((a25==9) || (a25==10)))))) && (a4==1)) && (a3==1))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L694] COND FALSE !((!(a4==1) && (((((a3==1) && ((input == 2) && (((a25==9) || (a25==10)) || (a25==11)))) && ((140 < a29) && (245 >= a29)) ) && a23 <= -43 ) && (a8==15)))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L706] COND FALSE !(((((((( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ((a25==9) && ((245 < a29) && (277 >= a29)) ))) && (input == 6)) && (a3==1)) && 306 < a23 ) && (a4==1)) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L712] COND FALSE !(( 306 < a23 && ((a8==15) && ( 277 < a29 && ((a4==1) && ((a3==1) && ((((a25==9) || (a25==10)) || (a25==11)) && (input == 5)))))))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L717] COND FALSE !(((( 277 < a29 && ((a8==15) && (((input == 6) && a23 <= -43 ) && (a25==13)))) && !(a4==1)) && (a3==1))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L731] COND FALSE !(((a3==1) && (((!(a4==1) && ((( ((140 < a29) && (245 >= a29)) && (a25==10)) || (( a29 <= 140 && (a25==13)) || ((a25==9) && ((140 < a29) && (245 >= a29)) ))) && (input == 3))) && ((-43 < a23) && (138 >= a23)) ) && (a8==15)))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L738] COND FALSE !(((a3==1) && (( 306 < a23 && (((a4==1) && (((a25==12) || ((a25==10) || (a25==11))) && (input == 1))) && a29 <= 140 )) && (a8==15)))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L743] COND FALSE !((((( a23 <= -43 && ((input == 1) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ((a25==9) && ((245 < a29) && (277 >= a29)) ))))) && (a3==1)) && !(a4==1)) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L750] COND FALSE !(((!(a4==1) && (((a8==15) && ( a29 <= 140 && (((a25==10) || (a25==11)) && (input == 5)))) && a23 <= -43 )) && (a3==1))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L757] COND FALSE !((((((a8==15) && ((a3==1) && ( a23 <= -43 && (input == 5)))) && !(a4==1)) && (a25==13)) && 277 < a29 )) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L769] COND FALSE !(((a8==15) && ((a3==1) && ( 306 < a23 && ((((((a25==11) || (a25==12)) || (a25==13)) && (input == 1)) && (a4==1)) && ((245 < a29) && (277 >= a29)) ))))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L774] COND FALSE !((!(a4==1) && (((((((a25==12) || (a25==13)) && (input == 6)) && (a8==15)) && a23 <= -43 ) && (a3==1)) && a29 <= 140 ))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L780] COND FALSE !(((a3==1) && (( a23 <= -43 && (((input == 6) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (((a25==13) && ((140 < a29) && (245 >= a29)) ) || ((a25==9) && ((245 < a29) && (277 >= a29)) )))) && !(a4==1))) && (a8==15)))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L787] COND FALSE !((((( ((-43 < a23) && (138 >= a23)) && ((!(a4==1) && (input == 6)) && (a25==9))) && a29 <= 140 ) && (a3==1)) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L792] COND FALSE !((( a29 <= 140 && ((a3==1) && ((a8==15) && ((a25==13) && ( 306 < a23 && (input == 1)))))) && (a4==1))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L799] COND FALSE !(((a3==1) && (((a8==15) && (((( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ( ((245 < a29) && (277 >= a29)) && (a25==9)))) && (input == 5)) && 306 < a23 )) && (a4==1)))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L804] COND FALSE !((((((a8==15) && ((input == 4) && (( 277 < a29 && (a25==9)) || (( ((245 < a29) && (277 >= a29)) && (a25==12)) || ( ((245 < a29) && (277 >= a29)) && (a25==13)))))) && !(a4==1)) && a23 <= -43 ) && (a3==1))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L816] COND FALSE !(((( ((-43 < a23) && (138 >= a23)) && (!(a4==1) && ((input == 5) && (( ((140 < a29) && (245 >= a29)) && (a25==10)) || (( a29 <= 140 && (a25==13)) || ((a25==9) && ((140 < a29) && (245 >= a29)) )))))) && (a8==15)) && (a3==1))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L822] COND TRUE ( a29 <= 140 && ((((( 306 < a23 && (input == 2)) && (a25==13)) && (a4==1)) && (a3==1)) && (a8==15))) [L823] a29 = (((a29 / 5) + 165004) + 41645) [L824] return 23; VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, \result=23, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1042] RET, EXPR calculate_output(input) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, calculate_output(input)=23, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=23] [L1042] output = calculate_output(input) [L1034] COND TRUE 1 [L1037] int input; [L1038] input = __VERIFIER_nondet_int() [L1039] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=23] [L1042] CALL, EXPR calculate_output(input) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L23] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L26] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L29] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L32] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L35] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L38] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L41] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L44] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L47] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L50] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L53] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L56] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L59] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L62] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L65] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L68] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L71] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L74] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L77] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L80] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L83] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L86] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L89] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L92] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L95] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L98] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L101] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L104] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L107] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L110] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L113] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L116] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L119] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L122] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L125] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L128] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L131] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L134] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L137] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L140] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L143] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L146] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L149] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L152] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L155] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L158] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L161] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L164] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L167] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L170] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L173] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L176] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L179] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L182] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && 306 < a23 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L185] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L188] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L191] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L194] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L197] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L200] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L203] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L207] COND FALSE !((( ((140 < a29) && (245 >= a29)) && ((a25==12) && ( a23 <= -43 && ((a8==15) && ((input == 6) && (a3==1)))))) && !(a4==1))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L214] COND FALSE !((!(a4==1) && (((a3==1) && ((((((a25==13) && ((140 < a29) && (245 >= a29)) ) || ((a25==9) && ((245 < a29) && (277 >= a29)) )) || ( ((245 < a29) && (277 >= a29)) && (a25==10))) && (input == 4)) && a23 <= -43 )) && (a8==15)))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L221] COND FALSE !(((a25==11) && (!(a4==1) && (((((input == 2) && (a3==1)) && a23 <= -43 ) && (a8==15)) && ((245 < a29) && (277 >= a29)) )))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L227] COND FALSE !(((( a29 <= 140 && ((a3==1) && (((input == 5) && (a25==13)) && (a4==1)))) && (a8==15)) && 306 < a23 )) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L233] COND TRUE (((a8==15) && (((((((a4==1) && 277 < a29 ) && (a25==12)) && 306 < a23 ) || ( 306 < a23 && (((a4==1) && 277 < a29 ) && (a25==13)))) || ((( a29 <= 140 && !(a4==1)) && (a25==9)) && a23 <= -43 )) && (input == 6))) && (a3==1)) [L234] a29 = ((((a29 / 5) - -25349) / 5) + 110879) [L235] a23 = ((((((a23 * 9)/ 10) + 1944) + 57035) % 90)- -48) [L236] a4 = 1 [L237] a25 = 9 [L239] return -1; VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=6, \result=-1, a23=87, a25=9, a29=124215, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1042] RET, EXPR calculate_output(input) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, a23=87, a25=9, a29=124215, a3=1, a4=1, a8=15, calculate_output(input)=-1, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=23] [L1042] output = calculate_output(input) [L1034] COND TRUE 1 [L1037] int input; [L1038] input = __VERIFIER_nondet_int() [L1039] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, a23=87, a25=9, a29=124215, a3=1, a4=1, a8=15, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=-1] [L1042] CALL calculate_output(input) VAL [\old(a23)=87, \old(a25)=9, \old(a29)=124215, \old(a4)=1, \old(input)=1, a23=87, a25=9, a29=124215, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L23] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=87, \old(a25)=9, \old(a29)=124215, \old(a4)=1, \old(input)=1, a23=87, a25=9, a29=124215, a3=1, a4=1, a8=15, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L26] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=87, \old(a25)=9, \old(a29)=124215, \old(a4)=1, \old(input)=1, a23=87, a25=9, a29=124215, a3=1, a4=1, a8=15, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L29] COND TRUE ((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15)) VAL [\old(a23)=87, \old(a25)=9, \old(a29)=124215, \old(a4)=1, \old(input)=1, a23=87, a25=9, a29=124215, a3=1, a4=1, a8=15, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L30] __VERIFIER_error() VAL [\old(a23)=87, \old(a25)=9, \old(a29)=124215, \old(a4)=1, \old(input)=1, a23=87, a25=9, a29=124215, a3=1, a4=1, a8=15, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 292 locations, 1 error locations. UNSAFE Result, 337.7s OverallTime, 22 OverallIterations, 5 TraceHistogramMax, 299.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2872 SDtfs, 38720 SDslu, 5830 SDs, 0 SdLazy, 77123 SolverSat, 17432 SolverUnsat, 61 SolverUnknown, 0 SolverNotchecked, 206.2s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 8690 GetRequests, 7774 SyntacticMatches, 29 SemanticMatches, 887 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 29645 ImplicationChecksByTransitivity, 82.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42144occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 10.3s AbstIntTime, 14 AbstIntIterations, 2 AbstIntStrong, 0.9972338087124797 AbsIntWeakeningRatio, 0.15723270440251572 AbsIntAvgWeakeningVarsNumRemoved, 17.462264150943398 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 5.4s AutomataMinimizationTime, 21 MinimizatonAttempts, 29830 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 18.8s InterpolantComputationTime, 9525 NumberOfCodeBlocks, 9525 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 12765 ConstructedInterpolants, 37 QuantifiedInterpolants, 26010431 SizeOfPredicates, 39 NumberOfNonLiveVariables, 6574 ConjunctsInSsa, 169 ConjunctsInUnsatCore, 45 InterpolantComputations, 8 PerfectInterpolantSequences, 7338/10013 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...