./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label15_false-unreach-call_false-termination.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_3791b766-30eb-45a0-90e2-91a4a45c5a46/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3791b766-30eb-45a0-90e2-91a4a45c5a46/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3791b766-30eb-45a0-90e2-91a4a45c5a46/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3791b766-30eb-45a0-90e2-91a4a45c5a46/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label15_false-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_3791b766-30eb-45a0-90e2-91a4a45c5a46/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3791b766-30eb-45a0-90e2-91a4a45c5a46/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 4893d056c55084f9785b9d10ff20a8939e2b3502 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:48:31,042 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 20:48:31,043 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 20:48:31,049 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 20:48:31,050 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 20:48:31,050 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 20:48:31,051 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 20:48:31,052 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 20:48:31,053 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 20:48:31,053 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 20:48:31,054 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 20:48:31,054 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 20:48:31,054 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 20:48:31,055 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 20:48:31,055 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 20:48:31,056 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 20:48:31,056 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 20:48:31,057 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 20:48:31,058 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 20:48:31,059 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 20:48:31,059 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 20:48:31,060 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 20:48:31,061 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 20:48:31,061 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 20:48:31,061 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 20:48:31,062 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 20:48:31,062 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 20:48:31,063 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 20:48:31,063 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 20:48:31,064 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 20:48:31,064 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 20:48:31,064 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 20:48:31,064 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 20:48:31,064 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 20:48:31,065 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 20:48:31,065 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 20:48:31,066 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3791b766-30eb-45a0-90e2-91a4a45c5a46/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-08 20:48:31,073 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 20:48:31,073 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 20:48:31,074 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 20:48:31,074 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 20:48:31,074 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-08 20:48:31,074 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-08 20:48:31,074 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-08 20:48:31,074 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-08 20:48:31,074 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-08 20:48:31,074 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-08 20:48:31,074 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-08 20:48:31,074 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-08 20:48:31,075 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-08 20:48:31,075 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 20:48:31,075 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 20:48:31,075 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 20:48:31,075 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 20:48:31,075 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 20:48:31,075 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-08 20:48:31,075 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 20:48:31,076 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-08 20:48:31,076 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 20:48:31,076 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 20:48:31,076 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-08 20:48:31,076 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 20:48:31,076 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 20:48:31,076 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 20:48:31,076 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 20:48:31,076 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 20:48:31,076 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 20:48:31,076 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 20:48:31,077 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-08 20:48:31,077 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-08 20:48:31,077 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 20:48:31,077 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-08 20:48:31,077 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-08 20:48:31,077 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_3791b766-30eb-45a0-90e2-91a4a45c5a46/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 -> 4893d056c55084f9785b9d10ff20a8939e2b3502 [2018-12-08 20:48:31,095 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 20:48:31,104 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 20:48:31,106 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 20:48:31,107 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 20:48:31,107 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 20:48:31,108 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3791b766-30eb-45a0-90e2-91a4a45c5a46/bin-2019/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem01_label15_false-unreach-call_false-termination.c [2018-12-08 20:48:31,144 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3791b766-30eb-45a0-90e2-91a4a45c5a46/bin-2019/utaipan/data/4584b1060/bcfa217158954bd6b5ac82af9ad61332/FLAG1f458f6b7 [2018-12-08 20:48:31,663 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 20:48:31,663 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3791b766-30eb-45a0-90e2-91a4a45c5a46/sv-benchmarks/c/eca-rers2012/Problem01_label15_false-unreach-call_false-termination.c [2018-12-08 20:48:31,670 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3791b766-30eb-45a0-90e2-91a4a45c5a46/bin-2019/utaipan/data/4584b1060/bcfa217158954bd6b5ac82af9ad61332/FLAG1f458f6b7 [2018-12-08 20:48:32,177 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3791b766-30eb-45a0-90e2-91a4a45c5a46/bin-2019/utaipan/data/4584b1060/bcfa217158954bd6b5ac82af9ad61332 [2018-12-08 20:48:32,179 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 20:48:32,180 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 20:48:32,180 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 20:48:32,180 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 20:48:32,182 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 20:48:32,183 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 08:48:32" (1/1) ... [2018-12-08 20:48:32,184 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@672351b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:48:32, skipping insertion in model container [2018-12-08 20:48:32,185 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 08:48:32" (1/1) ... [2018-12-08 20:48:32,189 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 20:48:32,219 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 20:48:32,412 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 20:48:32,415 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 20:48:32,523 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 20:48:32,534 INFO L195 MainTranslator]: Completed translation [2018-12-08 20:48:32,534 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:48:32 WrapperNode [2018-12-08 20:48:32,534 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 20:48:32,535 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 20:48:32,535 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 20:48:32,535 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 20:48:32,540 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:48:32" (1/1) ... [2018-12-08 20:48:32,549 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:48:32" (1/1) ... [2018-12-08 20:48:32,554 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 20:48:32,554 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 20:48:32,554 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 20:48:32,554 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 20:48:32,561 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:48:32" (1/1) ... [2018-12-08 20:48:32,561 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:48:32" (1/1) ... [2018-12-08 20:48:32,563 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:48:32" (1/1) ... [2018-12-08 20:48:32,563 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:48:32" (1/1) ... [2018-12-08 20:48:32,579 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:48:32" (1/1) ... [2018-12-08 20:48:32,586 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:48:32" (1/1) ... [2018-12-08 20:48:32,589 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:48:32" (1/1) ... [2018-12-08 20:48:32,592 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 20:48:32,592 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 20:48:32,592 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 20:48:32,592 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 20:48:32,593 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:48:32" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3791b766-30eb-45a0-90e2-91a4a45c5a46/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:48:32,633 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-08 20:48:32,633 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-08 20:48:32,633 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-12-08 20:48:32,634 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-12-08 20:48:32,634 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 20:48:32,634 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 20:48:32,634 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-08 20:48:32,634 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-08 20:48:33,230 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 20:48:33,231 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-08 20:48:33,231 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 08:48:33 BoogieIcfgContainer [2018-12-08 20:48:33,231 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 20:48:33,232 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 20:48:33,232 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 20:48:33,235 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 20:48:33,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 08:48:32" (1/3) ... [2018-12-08 20:48:33,236 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e400d4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 08:48:33, skipping insertion in model container [2018-12-08 20:48:33,236 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:48:32" (2/3) ... [2018-12-08 20:48:33,236 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e400d4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 08:48:33, skipping insertion in model container [2018-12-08 20:48:33,236 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 08:48:33" (3/3) ... [2018-12-08 20:48:33,238 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label15_false-unreach-call_false-termination.c [2018-12-08 20:48:33,246 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 20:48:33,253 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-08 20:48:33,266 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-08 20:48:33,294 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 20:48:33,294 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-08 20:48:33,294 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 20:48:33,294 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 20:48:33,295 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 20:48:33,295 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 20:48:33,295 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 20:48:33,295 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 20:48:33,314 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states. [2018-12-08 20:48:33,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-08 20:48:33,321 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:48:33,321 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:33,323 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:48:33,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:48:33,328 INFO L82 PathProgramCache]: Analyzing trace with hash 78510191, now seen corresponding path program 1 times [2018-12-08 20:48:33,330 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 20:48:33,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:33,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:48:33,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:33,364 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 20:48:33,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:48:33,589 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:48:33,591 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:48:33,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 20:48:33,591 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 20:48:33,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 20:48:33,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 20:48:33,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-08 20:48:33,604 INFO L87 Difference]: Start difference. First operand 207 states. Second operand 4 states. [2018-12-08 20:48:34,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:48:34,092 INFO L93 Difference]: Finished difference Result 547 states and 938 transitions. [2018-12-08 20:48:34,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 20:48:34,094 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2018-12-08 20:48:34,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:48:34,101 INFO L225 Difference]: With dead ends: 547 [2018-12-08 20:48:34,101 INFO L226 Difference]: Without dead ends: 278 [2018-12-08 20:48:34,104 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 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:48:34,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-12-08 20:48:34,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2018-12-08 20:48:34,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-12-08 20:48:34,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 412 transitions. [2018-12-08 20:48:34,139 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 412 transitions. Word has length 87 [2018-12-08 20:48:34,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:48:34,140 INFO L480 AbstractCegarLoop]: Abstraction has 278 states and 412 transitions. [2018-12-08 20:48:34,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 20:48:34,140 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 412 transitions. [2018-12-08 20:48:34,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-08 20:48:34,142 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:48:34,142 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] [2018-12-08 20:48:34,142 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:48:34,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:48:34,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1666970376, now seen corresponding path program 1 times [2018-12-08 20:48:34,143 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 20:48:34,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:34,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:48:34,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:34,144 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 20:48:34,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:48:34,204 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:48:34,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:48:34,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 20:48:34,204 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 20:48:34,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 20:48:34,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 20:48:34,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-08 20:48:34,206 INFO L87 Difference]: Start difference. First operand 278 states and 412 transitions. Second operand 6 states. [2018-12-08 20:48:34,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:48:34,559 INFO L93 Difference]: Finished difference Result 703 states and 1063 transitions. [2018-12-08 20:48:34,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 20:48:34,560 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2018-12-08 20:48:34,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:48:34,562 INFO L225 Difference]: With dead ends: 703 [2018-12-08 20:48:34,562 INFO L226 Difference]: Without dead ends: 431 [2018-12-08 20:48:34,563 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-08 20:48:34,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2018-12-08 20:48:34,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 417. [2018-12-08 20:48:34,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-12-08 20:48:34,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 609 transitions. [2018-12-08 20:48:34,578 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 609 transitions. Word has length 97 [2018-12-08 20:48:34,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:48:34,578 INFO L480 AbstractCegarLoop]: Abstraction has 417 states and 609 transitions. [2018-12-08 20:48:34,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 20:48:34,578 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 609 transitions. [2018-12-08 20:48:34,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-08 20:48:34,579 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:48:34,579 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:48:34,579 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:48:34,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:48:34,580 INFO L82 PathProgramCache]: Analyzing trace with hash -758839946, now seen corresponding path program 1 times [2018-12-08 20:48:34,580 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 20:48:34,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:34,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:48:34,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:34,580 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 20:48:34,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:48:34,636 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:48:34,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:48:34,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 20:48:34,636 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 20:48:34,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 20:48:34,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 20:48:34,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-08 20:48:34,637 INFO L87 Difference]: Start difference. First operand 417 states and 609 transitions. Second operand 4 states. [2018-12-08 20:48:35,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:48:35,106 INFO L93 Difference]: Finished difference Result 1505 states and 2253 transitions. [2018-12-08 20:48:35,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 20:48:35,107 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2018-12-08 20:48:35,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:48:35,110 INFO L225 Difference]: With dead ends: 1505 [2018-12-08 20:48:35,110 INFO L226 Difference]: Without dead ends: 1094 [2018-12-08 20:48:35,111 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:48:35,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1094 states. [2018-12-08 20:48:35,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1094 to 959. [2018-12-08 20:48:35,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 959 states. [2018-12-08 20:48:35,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 959 states to 959 states and 1314 transitions. [2018-12-08 20:48:35,134 INFO L78 Accepts]: Start accepts. Automaton has 959 states and 1314 transitions. Word has length 98 [2018-12-08 20:48:35,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:48:35,135 INFO L480 AbstractCegarLoop]: Abstraction has 959 states and 1314 transitions. [2018-12-08 20:48:35,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 20:48:35,135 INFO L276 IsEmpty]: Start isEmpty. Operand 959 states and 1314 transitions. [2018-12-08 20:48:35,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-08 20:48:35,137 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:48:35,137 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:35,137 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:48:35,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:48:35,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1710985768, now seen corresponding path program 1 times [2018-12-08 20:48:35,138 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 20:48:35,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:35,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:48:35,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:35,139 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 20:48:35,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:48:35,238 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:48:35,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:48:35,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 20:48:35,239 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 20:48:35,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 20:48:35,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 20:48:35,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-08 20:48:35,239 INFO L87 Difference]: Start difference. First operand 959 states and 1314 transitions. Second operand 7 states. [2018-12-08 20:48:35,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:48:35,733 INFO L93 Difference]: Finished difference Result 1938 states and 2679 transitions. [2018-12-08 20:48:35,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-08 20:48:35,734 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 121 [2018-12-08 20:48:35,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:48:35,738 INFO L225 Difference]: With dead ends: 1938 [2018-12-08 20:48:35,738 INFO L226 Difference]: Without dead ends: 985 [2018-12-08 20:48:35,740 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2018-12-08 20:48:35,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 985 states. [2018-12-08 20:48:35,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 985 to 697. [2018-12-08 20:48:35,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 697 states. [2018-12-08 20:48:35,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 908 transitions. [2018-12-08 20:48:35,757 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 908 transitions. Word has length 121 [2018-12-08 20:48:35,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:48:35,757 INFO L480 AbstractCegarLoop]: Abstraction has 697 states and 908 transitions. [2018-12-08 20:48:35,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 20:48:35,757 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 908 transitions. [2018-12-08 20:48:35,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-12-08 20:48:35,759 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:48:35,759 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:35,759 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:48:35,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:48:35,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1073963665, now seen corresponding path program 1 times [2018-12-08 20:48:35,759 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 20:48:35,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:35,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:48:35,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:35,760 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 20:48:35,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:48:35,867 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 48 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:48:35,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 20:48:35,867 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 20:48:35,868 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 133 with the following transitions: [2018-12-08 20:48:35,870 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [17], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [109], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [341], [343], [757], [761], [770], [774], [776], [781], [782], [783], [785], [786] [2018-12-08 20:48:35,904 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 20:48:35,904 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 20:48:36,299 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-08 20:48:36,300 INFO L272 AbstractInterpreter]: Visited 91 different actions 175 times. Merged at 3 different actions 3 times. Never widened. Performed 2623 root evaluator evaluations with a maximum evaluation depth of 3. Performed 2623 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-12-08 20:48:36,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:48:36,305 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-08 20:48:36,519 INFO L227 lantSequenceWeakener]: Weakened 129 states. On average, predicates are now at 81.32% of their original sizes. [2018-12-08 20:48:36,519 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-08 20:48:36,574 INFO L418 sIntCurrentIteration]: We unified 131 AI predicates to 131 [2018-12-08 20:48:36,574 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-08 20:48:36,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 20:48:36,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-12-08 20:48:36,574 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 20:48:36,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-08 20:48:36,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-08 20:48:36,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-12-08 20:48:36,575 INFO L87 Difference]: Start difference. First operand 697 states and 908 transitions. Second operand 10 states. [2018-12-08 20:48:39,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:48:39,558 INFO L93 Difference]: Finished difference Result 2040 states and 2635 transitions. [2018-12-08 20:48:39,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-08 20:48:39,558 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 132 [2018-12-08 20:48:39,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:48:39,560 INFO L225 Difference]: With dead ends: 2040 [2018-12-08 20:48:39,560 INFO L226 Difference]: Without dead ends: 970 [2018-12-08 20:48:39,562 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 141 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2018-12-08 20:48:39,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2018-12-08 20:48:39,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 832. [2018-12-08 20:48:39,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 832 states. [2018-12-08 20:48:39,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 832 states to 832 states and 980 transitions. [2018-12-08 20:48:39,575 INFO L78 Accepts]: Start accepts. Automaton has 832 states and 980 transitions. Word has length 132 [2018-12-08 20:48:39,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:48:39,575 INFO L480 AbstractCegarLoop]: Abstraction has 832 states and 980 transitions. [2018-12-08 20:48:39,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-08 20:48:39,575 INFO L276 IsEmpty]: Start isEmpty. Operand 832 states and 980 transitions. [2018-12-08 20:48:39,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-12-08 20:48:39,577 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:48:39,577 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:48:39,577 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:48:39,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:48:39,577 INFO L82 PathProgramCache]: Analyzing trace with hash 119363290, now seen corresponding path program 1 times [2018-12-08 20:48:39,578 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 20:48:39,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:39,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:48:39,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:39,578 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 20:48:39,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:48:39,677 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 62 proven. 19 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-08 20:48:39,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 20:48:39,677 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 20:48:39,677 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 149 with the following transitions: [2018-12-08 20:48:39,677 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [46], [49], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [109], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [341], [343], [757], [761], [770], [774], [776], [781], [782], [783], [785], [786] [2018-12-08 20:48:39,680 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 20:48:39,680 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 20:48:39,769 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-08 20:48:39,769 INFO L272 AbstractInterpreter]: Visited 92 different actions 178 times. Merged at 4 different actions 4 times. Never widened. Performed 2558 root evaluator evaluations with a maximum evaluation depth of 3. Performed 2558 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-12-08 20:48:39,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:48:39,770 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-08 20:48:39,885 INFO L227 lantSequenceWeakener]: Weakened 145 states. On average, predicates are now at 81.33% of their original sizes. [2018-12-08 20:48:39,885 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-08 20:48:39,923 INFO L418 sIntCurrentIteration]: We unified 147 AI predicates to 147 [2018-12-08 20:48:39,923 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-08 20:48:39,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 20:48:39,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [7] total 15 [2018-12-08 20:48:39,923 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 20:48:39,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-08 20:48:39,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-08 20:48:39,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-12-08 20:48:39,924 INFO L87 Difference]: Start difference. First operand 832 states and 980 transitions. Second operand 10 states. [2018-12-08 20:48:41,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:48:41,649 INFO L93 Difference]: Finished difference Result 1932 states and 2260 transitions. [2018-12-08 20:48:41,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-08 20:48:41,649 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 148 [2018-12-08 20:48:41,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:48:41,652 INFO L225 Difference]: With dead ends: 1932 [2018-12-08 20:48:41,652 INFO L226 Difference]: Without dead ends: 1106 [2018-12-08 20:48:41,653 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 155 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2018-12-08 20:48:41,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2018-12-08 20:48:41,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 1104. [2018-12-08 20:48:41,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1104 states. [2018-12-08 20:48:41,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1104 states to 1104 states and 1267 transitions. [2018-12-08 20:48:41,677 INFO L78 Accepts]: Start accepts. Automaton has 1104 states and 1267 transitions. Word has length 148 [2018-12-08 20:48:41,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:48:41,677 INFO L480 AbstractCegarLoop]: Abstraction has 1104 states and 1267 transitions. [2018-12-08 20:48:41,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-08 20:48:41,678 INFO L276 IsEmpty]: Start isEmpty. Operand 1104 states and 1267 transitions. [2018-12-08 20:48:41,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-12-08 20:48:41,680 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:48:41,680 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:48:41,680 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:48:41,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:48:41,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1861440533, now seen corresponding path program 1 times [2018-12-08 20:48:41,681 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 20:48:41,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:41,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:48:41,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:41,682 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 20:48:41,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:48:41,924 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 75 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:48:41,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 20:48:41,924 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 20:48:41,925 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 163 with the following transitions: [2018-12-08 20:48:41,925 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [109], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [341], [343], [757], [761], [770], [774], [776], [781], [782], [783], [785], [786] [2018-12-08 20:48:41,927 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 20:48:41,927 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 20:48:42,011 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-08 20:48:42,011 INFO L272 AbstractInterpreter]: Visited 91 different actions 176 times. Merged at 4 different actions 4 times. Never widened. Performed 2566 root evaluator evaluations with a maximum evaluation depth of 3. Performed 2566 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-12-08 20:48:42,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:48:42,020 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-08 20:48:42,141 INFO L227 lantSequenceWeakener]: Weakened 159 states. On average, predicates are now at 81.37% of their original sizes. [2018-12-08 20:48:42,141 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-08 20:48:42,207 INFO L418 sIntCurrentIteration]: We unified 161 AI predicates to 161 [2018-12-08 20:48:42,207 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-08 20:48:42,207 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 20:48:42,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2018-12-08 20:48:42,207 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 20:48:42,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-08 20:48:42,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-08 20:48:42,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-12-08 20:48:42,208 INFO L87 Difference]: Start difference. First operand 1104 states and 1267 transitions. Second operand 10 states. [2018-12-08 20:48:44,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:48:44,826 INFO L93 Difference]: Finished difference Result 2206 states and 2600 transitions. [2018-12-08 20:48:44,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-08 20:48:44,826 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 162 [2018-12-08 20:48:44,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:48:44,829 INFO L225 Difference]: With dead ends: 2206 [2018-12-08 20:48:44,829 INFO L226 Difference]: Without dead ends: 1380 [2018-12-08 20:48:44,830 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 170 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2018-12-08 20:48:44,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2018-12-08 20:48:44,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 1378. [2018-12-08 20:48:44,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1378 states. [2018-12-08 20:48:44,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1378 states to 1378 states and 1562 transitions. [2018-12-08 20:48:44,845 INFO L78 Accepts]: Start accepts. Automaton has 1378 states and 1562 transitions. Word has length 162 [2018-12-08 20:48:44,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:48:44,845 INFO L480 AbstractCegarLoop]: Abstraction has 1378 states and 1562 transitions. [2018-12-08 20:48:44,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-08 20:48:44,845 INFO L276 IsEmpty]: Start isEmpty. Operand 1378 states and 1562 transitions. [2018-12-08 20:48:44,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-12-08 20:48:44,847 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:48:44,847 INFO L402 BasicCegarLoop]: trace histogram [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, 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:48:44,848 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:48:44,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:48:44,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1600034810, now seen corresponding path program 1 times [2018-12-08 20:48:44,848 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 20:48:44,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:44,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:48:44,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:44,849 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 20:48:44,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:48:44,920 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 79 proven. 39 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-08 20:48:44,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 20:48:44,921 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 20:48:44,921 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 171 with the following transitions: [2018-12-08 20:48:44,921 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [109], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [341], [343], [757], [761], [770], [774], [776], [781], [782], [783], [785], [786] [2018-12-08 20:48:44,923 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 20:48:44,923 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 20:48:45,106 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 20:48:45,106 INFO L272 AbstractInterpreter]: Visited 93 different actions 363 times. Merged at 7 different actions 24 times. Never widened. Performed 5427 root evaluator evaluations with a maximum evaluation depth of 3. Performed 5427 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 7 fixpoints after 2 different actions. Largest state had 42 variables. [2018-12-08 20:48:45,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:48:45,108 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 20:48:45,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 20:48:45,109 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3791b766-30eb-45a0-90e2-91a4a45c5a46/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:48:45,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:48:45,115 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 20:48:45,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:48:45,170 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:48:45,235 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 90 proven. 2 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-12-08 20:48:45,235 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 20:48:45,318 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 84 proven. 34 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-08 20:48:45,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-08 20:48:45,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2018-12-08 20:48:45,334 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-08 20:48:45,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-08 20:48:45,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-08 20:48:45,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-12-08 20:48:45,334 INFO L87 Difference]: Start difference. First operand 1378 states and 1562 transitions. Second operand 11 states. [2018-12-08 20:48:46,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:48:46,295 INFO L93 Difference]: Finished difference Result 4146 states and 4974 transitions. [2018-12-08 20:48:46,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-08 20:48:46,295 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 170 [2018-12-08 20:48:46,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:48:46,301 INFO L225 Difference]: With dead ends: 4146 [2018-12-08 20:48:46,301 INFO L226 Difference]: Without dead ends: 3183 [2018-12-08 20:48:46,302 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 343 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2018-12-08 20:48:46,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3183 states. [2018-12-08 20:48:46,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3183 to 2911. [2018-12-08 20:48:46,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2911 states. [2018-12-08 20:48:46,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2911 states to 2911 states and 3361 transitions. [2018-12-08 20:48:46,341 INFO L78 Accepts]: Start accepts. Automaton has 2911 states and 3361 transitions. Word has length 170 [2018-12-08 20:48:46,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:48:46,341 INFO L480 AbstractCegarLoop]: Abstraction has 2911 states and 3361 transitions. [2018-12-08 20:48:46,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-08 20:48:46,342 INFO L276 IsEmpty]: Start isEmpty. Operand 2911 states and 3361 transitions. [2018-12-08 20:48:46,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-12-08 20:48:46,345 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:48:46,345 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-12-08 20:48:46,346 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:48:46,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:48:46,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1381841719, now seen corresponding path program 1 times [2018-12-08 20:48:46,346 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 20:48:46,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:46,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:48:46,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:46,347 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 20:48:46,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:48:46,414 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 99 proven. 60 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-12-08 20:48:46,414 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 20:48:46,414 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 20:48:46,414 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 190 with the following transitions: [2018-12-08 20:48:46,414 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [46], [49], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [109], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [341], [343], [757], [761], [770], [774], [776], [781], [782], [783], [785], [786] [2018-12-08 20:48:46,416 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 20:48:46,416 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 20:48:46,604 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 20:48:46,604 INFO L272 AbstractInterpreter]: Visited 94 different actions 375 times. Merged at 8 different actions 32 times. Never widened. Performed 5616 root evaluator evaluations with a maximum evaluation depth of 3. Performed 5616 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 9 fixpoints after 3 different actions. Largest state had 42 variables. [2018-12-08 20:48:46,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:48:46,606 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 20:48:46,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 20:48:46,606 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3791b766-30eb-45a0-90e2-91a4a45c5a46/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:48:46,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:48:46,613 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 20:48:46,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:48:46,662 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:48:46,693 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 116 proven. 2 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-12-08 20:48:46,693 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 20:48:46,732 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 104 proven. 14 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-12-08 20:48:46,747 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-08 20:48:46,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2018-12-08 20:48:46,747 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-08 20:48:46,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-08 20:48:46,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-08 20:48:46,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-12-08 20:48:46,748 INFO L87 Difference]: Start difference. First operand 2911 states and 3361 transitions. Second operand 12 states. [2018-12-08 20:48:48,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:48:48,833 INFO L93 Difference]: Finished difference Result 8941 states and 11042 transitions. [2018-12-08 20:48:48,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-08 20:48:48,834 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 189 [2018-12-08 20:48:48,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:48:48,845 INFO L225 Difference]: With dead ends: 8941 [2018-12-08 20:48:48,845 INFO L226 Difference]: Without dead ends: 6308 [2018-12-08 20:48:48,848 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 459 GetRequests, 410 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 682 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=512, Invalid=1938, Unknown=0, NotChecked=0, Total=2450 [2018-12-08 20:48:48,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6308 states. [2018-12-08 20:48:48,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6308 to 6022. [2018-12-08 20:48:48,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6022 states. [2018-12-08 20:48:48,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6022 states to 6022 states and 7251 transitions. [2018-12-08 20:48:48,927 INFO L78 Accepts]: Start accepts. Automaton has 6022 states and 7251 transitions. Word has length 189 [2018-12-08 20:48:48,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:48:48,927 INFO L480 AbstractCegarLoop]: Abstraction has 6022 states and 7251 transitions. [2018-12-08 20:48:48,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-08 20:48:48,928 INFO L276 IsEmpty]: Start isEmpty. Operand 6022 states and 7251 transitions. [2018-12-08 20:48:48,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-12-08 20:48:48,935 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:48:48,936 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-12-08 20:48:48,936 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:48:48,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:48:48,936 INFO L82 PathProgramCache]: Analyzing trace with hash 16837138, now seen corresponding path program 1 times [2018-12-08 20:48:48,936 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 20:48:48,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:48,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:48:48,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:48,937 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 20:48:48,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:48:49,010 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 120 proven. 60 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-12-08 20:48:49,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 20:48:49,011 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 20:48:49,011 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 208 with the following transitions: [2018-12-08 20:48:49,011 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [9], [10], [14], [18], [22], [26], [30], [34], [38], [42], [46], [49], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [109], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [173], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [341], [343], [757], [761], [770], [774], [776], [781], [782], [783], [785], [786] [2018-12-08 20:48:49,012 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 20:48:49,013 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 20:48:49,247 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 20:48:49,247 INFO L272 AbstractInterpreter]: Visited 95 different actions 467 times. Merged at 8 different actions 36 times. Never widened. Performed 7015 root evaluator evaluations with a maximum evaluation depth of 3. Performed 7015 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 10 fixpoints after 2 different actions. Largest state had 42 variables. [2018-12-08 20:48:49,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:48:49,252 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 20:48:49,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 20:48:49,253 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3791b766-30eb-45a0-90e2-91a4a45c5a46/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:48:49,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:48:49,259 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 20:48:49,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:48:49,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:48:49,357 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 146 proven. 6 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-12-08 20:48:49,357 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 20:48:49,461 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 126 proven. 54 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-12-08 20:48:49,476 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-08 20:48:49,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-12-08 20:48:49,477 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-08 20:48:49,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 20:48:49,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 20:48:49,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-12-08 20:48:49,477 INFO L87 Difference]: Start difference. First operand 6022 states and 7251 transitions. Second operand 8 states. [2018-12-08 20:48:50,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:48:50,225 INFO L93 Difference]: Finished difference Result 15195 states and 18913 transitions. [2018-12-08 20:48:50,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-08 20:48:50,226 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 207 [2018-12-08 20:48:50,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:48:50,253 INFO L225 Difference]: With dead ends: 15195 [2018-12-08 20:48:50,253 INFO L226 Difference]: Without dead ends: 9594 [2018-12-08 20:48:50,263 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 414 SyntacticMatches, 13 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2018-12-08 20:48:50,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9594 states. [2018-12-08 20:48:50,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9594 to 9033. [2018-12-08 20:48:50,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9033 states. [2018-12-08 20:48:50,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9033 states to 9033 states and 10645 transitions. [2018-12-08 20:48:50,438 INFO L78 Accepts]: Start accepts. Automaton has 9033 states and 10645 transitions. Word has length 207 [2018-12-08 20:48:50,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:48:50,439 INFO L480 AbstractCegarLoop]: Abstraction has 9033 states and 10645 transitions. [2018-12-08 20:48:50,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 20:48:50,439 INFO L276 IsEmpty]: Start isEmpty. Operand 9033 states and 10645 transitions. [2018-12-08 20:48:50,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-12-08 20:48:50,447 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:48:50,447 INFO L402 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 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] [2018-12-08 20:48:50,447 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:48:50,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:48:50,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1783900723, now seen corresponding path program 1 times [2018-12-08 20:48:50,447 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 20:48:50,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:50,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:48:50,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:50,448 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 20:48:50,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:48:50,517 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 128 proven. 81 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-12-08 20:48:50,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 20:48:50,518 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 20:48:50,518 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 208 with the following transitions: [2018-12-08 20:48:50,518 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [85], [86], [90], [94], [98], [102], [106], [109], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [173], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [341], [343], [757], [761], [770], [774], [776], [781], [782], [783], [785], [786] [2018-12-08 20:48:50,520 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 20:48:50,520 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 20:48:50,642 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-08 20:48:50,642 INFO L272 AbstractInterpreter]: Visited 93 different actions 271 times. Merged at 6 different actions 12 times. Never widened. Performed 3838 root evaluator evaluations with a maximum evaluation depth of 3. Performed 3838 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 2 different actions. Largest state had 42 variables. [2018-12-08 20:48:50,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:48:50,643 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-08 20:48:50,827 INFO L227 lantSequenceWeakener]: Weakened 204 states. On average, predicates are now at 83.02% of their original sizes. [2018-12-08 20:48:50,827 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-08 20:48:50,863 INFO L418 sIntCurrentIteration]: We unified 206 AI predicates to 206 [2018-12-08 20:48:50,863 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-08 20:48:50,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 20:48:50,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-12-08 20:48:50,864 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 20:48:50,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-08 20:48:50,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-08 20:48:50,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-12-08 20:48:50,864 INFO L87 Difference]: Start difference. First operand 9033 states and 10645 transitions. Second operand 10 states. [2018-12-08 20:48:52,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:48:52,614 INFO L93 Difference]: Finished difference Result 18884 states and 22278 transitions. [2018-12-08 20:48:52,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-08 20:48:52,615 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 207 [2018-12-08 20:48:52,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:48:52,636 INFO L225 Difference]: With dead ends: 18884 [2018-12-08 20:48:52,636 INFO L226 Difference]: Without dead ends: 10407 [2018-12-08 20:48:52,648 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 214 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2018-12-08 20:48:52,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10407 states. [2018-12-08 20:48:52,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10407 to 10268. [2018-12-08 20:48:52,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10268 states. [2018-12-08 20:48:52,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10268 states to 10268 states and 12011 transitions. [2018-12-08 20:48:52,774 INFO L78 Accepts]: Start accepts. Automaton has 10268 states and 12011 transitions. Word has length 207 [2018-12-08 20:48:52,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:48:52,775 INFO L480 AbstractCegarLoop]: Abstraction has 10268 states and 12011 transitions. [2018-12-08 20:48:52,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-08 20:48:52,775 INFO L276 IsEmpty]: Start isEmpty. Operand 10268 states and 12011 transitions. [2018-12-08 20:48:52,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-12-08 20:48:52,784 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:48:52,784 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:52,784 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:48:52,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:48:52,784 INFO L82 PathProgramCache]: Analyzing trace with hash -625483229, now seen corresponding path program 1 times [2018-12-08 20:48:52,785 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 20:48:52,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:52,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:48:52,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:52,785 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 20:48:52,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:48:53,109 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 143 proven. 125 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-12-08 20:48:53,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 20:48:53,109 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 20:48:53,109 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 221 with the following transitions: [2018-12-08 20:48:53,109 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [46], [49], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [109], [110], [114], [118], [122], [126], [129], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [341], [343], [757], [761], [770], [774], [776], [781], [782], [783], [785], [786] [2018-12-08 20:48:53,110 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 20:48:53,110 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 20:48:53,295 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 20:48:53,296 INFO L272 AbstractInterpreter]: Visited 94 different actions 369 times. Merged at 8 different actions 26 times. Never widened. Performed 5731 root evaluator evaluations with a maximum evaluation depth of 3. Performed 5731 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 9 fixpoints after 3 different actions. Largest state had 42 variables. [2018-12-08 20:48:53,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:48:53,300 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 20:48:53,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 20:48:53,300 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3791b766-30eb-45a0-90e2-91a4a45c5a46/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:48:53,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:48:53,307 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 20:48:53,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:48:53,361 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:48:53,423 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 212 proven. 2 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-12-08 20:48:53,423 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 20:48:53,643 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 212 proven. 2 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-12-08 20:48:53,659 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-08 20:48:53,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 5, 5] total 20 [2018-12-08 20:48:53,660 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-08 20:48:53,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-08 20:48:53,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-08 20:48:53,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2018-12-08 20:48:53,660 INFO L87 Difference]: Start difference. First operand 10268 states and 12011 transitions. Second operand 18 states. [2018-12-08 20:48:55,286 WARN L180 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2018-12-08 20:48:57,152 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 30 [2018-12-08 20:48:57,300 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 18 [2018-12-08 20:48:57,897 WARN L180 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 37 [2018-12-08 20:48:59,032 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2018-12-08 20:48:59,381 WARN L180 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 46 [2018-12-08 20:49:00,473 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 31 [2018-12-08 20:49:00,672 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 31 [2018-12-08 20:49:00,885 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 33 [2018-12-08 20:49:01,524 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 37 [2018-12-08 20:49:03,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:49:03,297 INFO L93 Difference]: Finished difference Result 18576 states and 22603 transitions. [2018-12-08 20:49:03,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-12-08 20:49:03,298 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 220 [2018-12-08 20:49:03,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:49:03,320 INFO L225 Difference]: With dead ends: 18576 [2018-12-08 20:49:03,320 INFO L226 Difference]: Without dead ends: 9257 [2018-12-08 20:49:03,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 551 GetRequests, 474 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1954 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=1089, Invalid=5073, Unknown=0, NotChecked=0, Total=6162 [2018-12-08 20:49:03,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9257 states. [2018-12-08 20:49:03,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9257 to 8725. [2018-12-08 20:49:03,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8725 states. [2018-12-08 20:49:03,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8725 states to 8725 states and 10012 transitions. [2018-12-08 20:49:03,524 INFO L78 Accepts]: Start accepts. Automaton has 8725 states and 10012 transitions. Word has length 220 [2018-12-08 20:49:03,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:49:03,524 INFO L480 AbstractCegarLoop]: Abstraction has 8725 states and 10012 transitions. [2018-12-08 20:49:03,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-08 20:49:03,524 INFO L276 IsEmpty]: Start isEmpty. Operand 8725 states and 10012 transitions. [2018-12-08 20:49:03,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2018-12-08 20:49:03,531 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:49:03,532 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:49:03,532 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:49:03,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:49:03,532 INFO L82 PathProgramCache]: Analyzing trace with hash -512092368, now seen corresponding path program 1 times [2018-12-08 20:49:03,532 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 20:49:03,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:49:03,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:49:03,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:49:03,533 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 20:49:03,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:49:03,855 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 152 proven. 106 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:49:03,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 20:49:03,855 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 20:49:03,855 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 236 with the following transitions: [2018-12-08 20:49:03,855 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [109], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [177], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [225], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [341], [343], [757], [761], [770], [774], [776], [781], [782], [783], [785], [786] [2018-12-08 20:49:03,856 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 20:49:03,857 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 20:49:04,033 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 20:49:04,033 INFO L272 AbstractInterpreter]: Visited 93 different actions 361 times. Merged at 7 different actions 22 times. Never widened. Performed 5472 root evaluator evaluations with a maximum evaluation depth of 3. Performed 5472 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 6 fixpoints after 2 different actions. Largest state had 42 variables. [2018-12-08 20:49:04,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:49:04,034 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 20:49:04,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 20:49:04,034 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3791b766-30eb-45a0-90e2-91a4a45c5a46/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:49:04,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:49:04,042 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 20:49:04,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:49:04,094 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:49:04,147 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 208 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-12-08 20:49:04,148 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 20:49:04,347 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 208 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-12-08 20:49:04,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-08 20:49:04,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 5, 5] total 19 [2018-12-08 20:49:04,362 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-08 20:49:04,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-08 20:49:04,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-08 20:49:04,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2018-12-08 20:49:04,363 INFO L87 Difference]: Start difference. First operand 8725 states and 10012 transitions. Second operand 17 states. [2018-12-08 20:49:06,638 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 46 [2018-12-08 20:49:06,871 WARN L180 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 42 [2018-12-08 20:49:07,029 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 62 [2018-12-08 20:49:08,944 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 27 [2018-12-08 20:49:10,777 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 30 [2018-12-08 20:49:11,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:49:11,819 INFO L93 Difference]: Finished difference Result 16508 states and 19376 transitions. [2018-12-08 20:49:11,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-12-08 20:49:11,820 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 235 [2018-12-08 20:49:11,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:49:11,834 INFO L225 Difference]: With dead ends: 16508 [2018-12-08 20:49:11,834 INFO L226 Difference]: Without dead ends: 8339 [2018-12-08 20:49:11,844 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 568 GetRequests, 501 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1447 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=839, Invalid=3853, Unknown=0, NotChecked=0, Total=4692 [2018-12-08 20:49:11,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8339 states. [2018-12-08 20:49:11,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8339 to 7289. [2018-12-08 20:49:11,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7289 states. [2018-12-08 20:49:11,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7289 states to 7289 states and 8176 transitions. [2018-12-08 20:49:11,952 INFO L78 Accepts]: Start accepts. Automaton has 7289 states and 8176 transitions. Word has length 235 [2018-12-08 20:49:11,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:49:11,952 INFO L480 AbstractCegarLoop]: Abstraction has 7289 states and 8176 transitions. [2018-12-08 20:49:11,952 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-08 20:49:11,952 INFO L276 IsEmpty]: Start isEmpty. Operand 7289 states and 8176 transitions. [2018-12-08 20:49:11,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-12-08 20:49:11,957 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:49:11,957 INFO L402 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-12-08 20:49:11,958 INFO L423 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:49:11,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:49:11,958 INFO L82 PathProgramCache]: Analyzing trace with hash 2021476655, now seen corresponding path program 1 times [2018-12-08 20:49:11,958 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 20:49:11,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:49:11,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:49:11,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:49:11,958 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 20:49:11,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:49:12,349 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 216 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:49:12,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 20:49:12,349 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 20:49:12,349 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 238 with the following transitions: [2018-12-08 20:49:12,349 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [109], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [173], [174], [178], [182], [186], [190], [194], [198], [202], [205], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [341], [343], [757], [761], [770], [774], [776], [781], [782], [783], [785], [786] [2018-12-08 20:49:12,350 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 20:49:12,350 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 20:49:12,572 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 20:49:12,572 INFO L272 AbstractInterpreter]: Visited 94 different actions 463 times. Merged at 8 different actions 37 times. Widened at 1 different actions 1 times. Performed 6852 root evaluator evaluations with a maximum evaluation depth of 3. Performed 6852 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 10 fixpoints after 3 different actions. Largest state had 42 variables. [2018-12-08 20:49:12,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:49:12,575 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 20:49:12,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 20:49:12,575 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3791b766-30eb-45a0-90e2-91a4a45c5a46/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:49:12,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:49:12,581 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 20:49:12,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:49:12,627 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:49:12,692 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 218 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-12-08 20:49:12,692 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 20:49:12,950 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 218 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-12-08 20:49:12,965 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-08 20:49:12,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 5, 5] total 24 [2018-12-08 20:49:12,965 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-08 20:49:12,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-08 20:49:12,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-08 20:49:12,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=464, Unknown=0, NotChecked=0, Total=552 [2018-12-08 20:49:12,966 INFO L87 Difference]: Start difference. First operand 7289 states and 8176 transitions. Second operand 22 states. [2018-12-08 20:49:15,088 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 40 [2018-12-08 20:49:15,308 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 49 [2018-12-08 20:49:16,471 WARN L180 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 36 [2018-12-08 20:49:18,694 WARN L180 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 38 [2018-12-08 20:49:19,465 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 46 [2018-12-08 20:49:19,868 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 29 [2018-12-08 20:49:21,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:49:21,275 INFO L93 Difference]: Finished difference Result 14054 states and 15858 transitions. [2018-12-08 20:49:21,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-12-08 20:49:21,276 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 237 [2018-12-08 20:49:21,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:49:21,291 INFO L225 Difference]: With dead ends: 14054 [2018-12-08 20:49:21,292 INFO L226 Difference]: Without dead ends: 7168 [2018-12-08 20:49:21,301 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 597 GetRequests, 508 SyntacticMatches, 1 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2570 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1518, Invalid=6492, Unknown=0, NotChecked=0, Total=8010 [2018-12-08 20:49:21,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7168 states. [2018-12-08 20:49:21,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7168 to 5366. [2018-12-08 20:49:21,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5366 states. [2018-12-08 20:49:21,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5366 states to 5366 states and 5783 transitions. [2018-12-08 20:49:21,379 INFO L78 Accepts]: Start accepts. Automaton has 5366 states and 5783 transitions. Word has length 237 [2018-12-08 20:49:21,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:49:21,379 INFO L480 AbstractCegarLoop]: Abstraction has 5366 states and 5783 transitions. [2018-12-08 20:49:21,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-08 20:49:21,379 INFO L276 IsEmpty]: Start isEmpty. Operand 5366 states and 5783 transitions. [2018-12-08 20:49:21,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-12-08 20:49:21,383 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:49:21,383 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:49:21,383 INFO L423 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:49:21,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:49:21,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1764963115, now seen corresponding path program 1 times [2018-12-08 20:49:21,383 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 20:49:21,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:49:21,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:49:21,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:49:21,384 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 20:49:21,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:49:21,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:49:21,454 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-08 20:49:21,515 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.12 08:49:21 BoogieIcfgContainer [2018-12-08 20:49:21,515 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-08 20:49:21,515 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 20:49:21,515 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 20:49:21,515 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 20:49:21,516 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 08:48:33" (3/4) ... [2018-12-08 20:49:21,517 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-08 20:49:21,597 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_3791b766-30eb-45a0-90e2-91a4a45c5a46/bin-2019/utaipan/witness.graphml [2018-12-08 20:49:21,598 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 20:49:21,598 INFO L168 Benchmark]: Toolchain (without parser) took 49419.01 ms. Allocated memory was 1.0 GB in the beginning and 2.6 GB in the end (delta: 1.5 GB). Free memory was 949.6 MB in the beginning and 2.0 GB in the end (delta: -1.1 GB). Peak memory consumption was 470.5 MB. Max. memory is 11.5 GB. [2018-12-08 20:49:21,599 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 20:49:21,599 INFO L168 Benchmark]: CACSL2BoogieTranslator took 354.27 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.6 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -135.5 MB). Peak memory consumption was 38.2 MB. Max. memory is 11.5 GB. [2018-12-08 20:49:21,599 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.25 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-08 20:49:21,599 INFO L168 Benchmark]: Boogie Preprocessor took 37.39 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-08 20:49:21,599 INFO L168 Benchmark]: RCFGBuilder took 639.24 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 973.8 MB in the end (delta: 100.5 MB). Peak memory consumption was 100.5 MB. Max. memory is 11.5 GB. [2018-12-08 20:49:21,599 INFO L168 Benchmark]: TraceAbstraction took 48283.28 ms. Allocated memory was 1.1 GB in the beginning and 2.6 GB in the end (delta: 1.4 GB). Free memory was 968.4 MB in the beginning and 2.0 GB in the end (delta: -1.1 GB). Peak memory consumption was 357.1 MB. Max. memory is 11.5 GB. [2018-12-08 20:49:21,599 INFO L168 Benchmark]: Witness Printer took 82.33 ms. Allocated memory is still 2.6 GB. Free memory was 2.0 GB in the beginning and 2.0 GB in the end (delta: 32.6 MB). Peak memory consumption was 32.6 MB. Max. memory is 11.5 GB. [2018-12-08 20:49:21,601 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 354.27 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.6 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -135.5 MB). Peak memory consumption was 38.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 19.25 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 37.39 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 639.24 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 973.8 MB in the end (delta: 100.5 MB). Peak memory consumption was 100.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 48283.28 ms. Allocated memory was 1.1 GB in the beginning and 2.6 GB in the end (delta: 1.4 GB). Free memory was 968.4 MB in the beginning and 2.0 GB in the end (delta: -1.1 GB). Peak memory consumption was 357.1 MB. Max. memory is 11.5 GB. * Witness Printer took 82.33 ms. Allocated memory is still 2.6 GB. Free memory was 2.0 GB in the beginning and 2.0 GB in the end (delta: 32.6 MB). Peak memory consumption was 32.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 419]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L7] int a= 1; [L8] int d= 4; [L9] int e= 5; [L10] int f= 6; [L11] int c= 3; [L12] int b= 2; [L15] int u = 21; [L16] int v = 22; [L17] int w = 23; [L18] int x = 24; [L19] int y = 25; [L20] int z = 26; [L22] int a17 = 1; [L23] int a7 = 0; [L24] int a20 = 1; [L25] int a8 = 15; [L26] int a12 = 8; [L27] int a16 = 5; [L28] int a21 = 1; VAL [\old(a)=31, \old(a12)=27, \old(a16)=24, \old(a17)=18, \old(a20)=19, \old(a21)=23, \old(a7)=26, \old(a8)=34, \old(b)=20, \old(c)=21, \old(d)=29, \old(e)=17, \old(f)=28, \old(u)=32, \old(v)=16, \old(w)=30, \old(x)=22, \old(y)=33, \old(z)=25, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L580] int output = -1; VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, output=-1, u=21, v=22, w=23, x=24, y=25, z=26] [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, output=-1, u=21, v=22, w=23, x=24, y=25, z=26] [L591] CALL, EXPR calculate_output(input) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L268] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L273] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L292] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L299] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L306] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L312] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L318] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L324] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L329] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L333] COND TRUE ((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15))) [L334] a17 = 0 [L335] a16 = 4 [L336] return 21; VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, \result=21, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L591] RET, EXPR calculate_output(input) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, calculate_output(input)=21, d=4, e=5, f=6, input=3, output=-1, u=21, v=22, w=23, x=24, y=25, z=26] [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, output=21, u=21, v=22, w=23, x=24, y=25, z=26] [L591] CALL, EXPR calculate_output(input) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L268] COND TRUE (((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4)) [L269] a20 = 0 [L270] a17 = 1 [L271] a16 = 6 [L272] return 21; VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, \result=21, a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L591] RET, EXPR calculate_output(input) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, calculate_output(input)=21, d=4, e=5, f=6, input=4, output=21, u=21, v=22, w=23, x=24, y=25, z=26] [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, output=21, u=21, v=22, w=23, x=24, y=25, z=26] [L591] CALL, EXPR calculate_output(input) VAL [\old(a16)=6, \old(a17)=1, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [\old(a16)=6, \old(a17)=1, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [\old(a16)=6, \old(a17)=1, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [\old(a16)=6, \old(a17)=1, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [\old(a16)=6, \old(a17)=1, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [\old(a16)=6, \old(a17)=1, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND TRUE (((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6)) [L63] a17 = 0 [L64] return 26; VAL [\old(a16)=6, \old(a17)=1, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, \result=26, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L591] RET, EXPR calculate_output(input) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, calculate_output(input)=26, d=4, e=5, f=6, input=4, output=21, u=21, v=22, w=23, x=24, y=25, z=26] [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, output=26, u=21, v=22, w=23, x=24, y=25, z=26] [L591] CALL, EXPR calculate_output(input) VAL [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND TRUE ((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8)) [L179] a17 = 0 [L180] a16 = 5 [L181] a21 = 1 [L182] a8 = 14 [L183] a7 = 1 [L184] a20 = 1 [L185] return -1; VAL [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, \result=-1, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L591] RET, EXPR calculate_output(input) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, calculate_output(input)=-1, d=4, e=5, f=6, input=4, output=26, u=21, v=22, w=23, x=24, y=25, z=26] [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=2, output=-1, u=21, v=22, w=23, x=24, y=25, z=26] [L591] CALL calculate_output(input) VAL [\old(a16)=5, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=2, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [\old(a16)=5, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=2, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [\old(a16)=5, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=2, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [\old(a16)=5, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=2, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [\old(a16)=5, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=2, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [\old(a16)=5, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=2, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [\old(a16)=5, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=2, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [\old(a16)=5, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=2, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [\old(a16)=5, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=2, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [\old(a16)=5, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=2, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [\old(a16)=5, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=2, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [\old(a16)=5, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=2, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [\old(a16)=5, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=2, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [\old(a16)=5, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=2, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [\old(a16)=5, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=2, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [\old(a16)=5, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=2, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [\old(a16)=5, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=2, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [\old(a16)=5, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=2, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [\old(a16)=5, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=2, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [\old(a16)=5, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=2, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [\old(a16)=5, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=2, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [\old(a16)=5, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=2, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [\old(a16)=5, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=2, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [\old(a16)=5, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=2, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [\old(a16)=5, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=2, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [\old(a16)=5, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=2, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [\old(a16)=5, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=2, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [\old(a16)=5, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=2, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [\old(a16)=5, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=2, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [\old(a16)=5, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=2, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [\old(a16)=5, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=2, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [\old(a16)=5, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=2, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [\old(a16)=5, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=2, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [\old(a16)=5, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=2, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [\old(a16)=5, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=2, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [\old(a16)=5, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=2, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [\old(a16)=5, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=2, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [\old(a16)=5, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=2, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [\old(a16)=5, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=2, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [\old(a16)=5, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=2, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [\old(a16)=5, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=2, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [\old(a16)=5, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=2, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [\old(a16)=5, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=2, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [\old(a16)=5, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=2, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L268] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [\old(a16)=5, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=2, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L273] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [\old(a16)=5, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=2, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [\old(a16)=5, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=2, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [\old(a16)=5, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=2, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L292] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [\old(a16)=5, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=2, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L299] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [\old(a16)=5, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=2, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L306] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [\old(a16)=5, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=2, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L312] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [\old(a16)=5, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=2, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [\old(a16)=5, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=2, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L318] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [\old(a16)=5, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=2, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L324] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [\old(a16)=5, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=2, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L329] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [\old(a16)=5, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=2, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L333] COND FALSE !(((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15)))) VAL [\old(a16)=5, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=2, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L337] COND FALSE !((!(a21==1)&&((a20==1)&&(((a12==8)&&((a8==13)&&((((a16==5)&&!(a17==1))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==2))))&&(a7==1))))) VAL [\old(a16)=5, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=2, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L345] COND FALSE !(((a7==1)&&((a12==8)&&((((a20==1)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||((a16==4)&&!(a17==1))))&&(input==4)))&&(a8==13))&&!(a21==1))))) VAL [\old(a16)=5, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=2, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L353] COND FALSE !(((a21==1)&&((((!(a7==1)&&((a8==15)&&(!(a20==1)&&(input==4))))&&(a17==1))&&(a16==5))&&(a12==8)))) VAL [\old(a16)=5, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=2, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L355] COND FALSE !((((!(a7==1)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(a16==5))) VAL [\old(a16)=5, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=2, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L361] COND FALSE !(((((!(a17==1)&&(!(a20==1)&&((a8==15)&&((input==1)&&(a16==5)))))&&(a12==8))&&(a21==1))&&!(a7==1))) VAL [\old(a16)=5, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=2, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L363] COND FALSE !(((((a21==1)&&((a8==15)&&(((a16==5)&&((a12==8)&&(input==1)))&&(a17==1))))&&!(a7==1))&&!(a20==1))) VAL [\old(a16)=5, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=2, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L365] COND FALSE !(((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5))) VAL [\old(a16)=5, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=2, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L372] COND FALSE !((((!(a7==1)&&((a21==1)&&((((input==6)&&(a20==1))&&(a8==15))&&!(a17==1))))&&(a12==8))&&(a16==4))) VAL [\old(a16)=5, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=2, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L377] COND FALSE !(((((a20==1)&&(((!(a21==1)&&((a7==1)&&(input==1)))&&(a8==13))&&(a17==1)))&&(a12==8))&&(a16==5))) VAL [\old(a16)=5, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=2, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L382] COND FALSE !(((a12==8)&&((input==5)&&((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==15))&&(a16==6))&&(a21==1))||(!(a21==1)&&((a16==4)&&(((a20==1)&&((a7==1)&&(a17==1)))&&(a8==13)))))))) VAL [\old(a16)=5, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=2, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L391] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) VAL [\old(a16)=5, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=2, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L394] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) VAL [\old(a16)=5, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=2, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L397] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==4))&&(a21==1))) VAL [\old(a16)=5, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=2, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L400] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==6))&&(a21==1))) VAL [\old(a16)=5, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=2, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L403] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) VAL [\old(a16)=5, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=2, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L406] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==5))&&(a21==1))) VAL [\old(a16)=5, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=2, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L409] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) VAL [\old(a16)=5, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=2, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L412] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) VAL [\old(a16)=5, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=2, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L415] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1))) VAL [\old(a16)=5, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=2, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L418] COND TRUE ((((((!(a17==1)&&(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1)) VAL [\old(a16)=5, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=2, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] [L419] __VERIFIER_error() VAL [\old(a16)=5, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=2, a=1, a12=8, a16=5, a17=0, a20=1, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=2, u=21, v=22, w=23, x=24, y=25, z=26] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 207 locations, 1 error locations. UNSAFE Result, 48.2s OverallTime, 15 OverallIterations, 6 TraceHistogramMax, 40.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 661 SDtfs, 17740 SDslu, 1816 SDs, 0 SdLazy, 23671 SolverSat, 4231 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18.6s Time, PredicateUnifierStatistics: 8 DeclaredPredicates, 3696 GetRequests, 3272 SyntacticMatches, 21 SemanticMatches, 403 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6933 ImplicationChecksByTransitivity, 12.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10268occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.9s AbstIntTime, 10 AbstIntIterations, 4 AbstIntStrong, 0.9967042429055448 AbsIntWeakeningRatio, 0.24496124031007752 AbsIntAvgWeakeningVarsNumRemoved, 28.08062015503876 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 14 MinimizatonAttempts, 5221 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 3816 NumberOfCodeBlocks, 3816 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 4800 ConstructedInterpolants, 0 QuantifiedInterpolants, 5074595 SizeOfPredicates, 18 NumberOfNonLiveVariables, 3529 ConjunctsInSsa, 56 ConjunctsInUnsatCore, 26 InterpolantComputations, 4 PerfectInterpolantSequences, 3907/4615 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...